/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/concurrent/bpl/mcr/example_10.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.25-d9e330d [2020-02-10 20:25:58,227 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-02-10 20:25:58,230 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-02-10 20:25:58,242 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-02-10 20:25:58,243 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-02-10 20:25:58,244 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-02-10 20:25:58,245 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-02-10 20:25:58,247 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-02-10 20:25:58,249 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-02-10 20:25:58,250 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-02-10 20:25:58,251 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-02-10 20:25:58,252 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-02-10 20:25:58,252 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-02-10 20:25:58,253 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-02-10 20:25:58,254 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-02-10 20:25:58,255 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-02-10 20:25:58,256 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-02-10 20:25:58,257 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-02-10 20:25:58,259 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-02-10 20:25:58,261 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-02-10 20:25:58,262 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-02-10 20:25:58,263 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-02-10 20:25:58,264 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-02-10 20:25:58,265 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-02-10 20:25:58,267 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-02-10 20:25:58,267 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-02-10 20:25:58,267 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-02-10 20:25:58,271 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-02-10 20:25:58,272 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-02-10 20:25:58,273 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-02-10 20:25:58,273 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-02-10 20:25:58,276 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-02-10 20:25:58,277 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-02-10 20:25:58,277 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-02-10 20:25:58,278 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-02-10 20:25:58,279 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-02-10 20:25:58,279 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-02-10 20:25:58,279 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-02-10 20:25:58,281 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-02-10 20:25:58,282 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-02-10 20:25:58,284 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-02-10 20:25:58,284 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2020-02-10 20:25:58,303 INFO L113 SettingsManager]: Loading preferences was successful [2020-02-10 20:25:58,303 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-02-10 20:25:58,305 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-02-10 20:25:58,306 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-02-10 20:25:58,306 INFO L138 SettingsManager]: * Use SBE=true [2020-02-10 20:25:58,306 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-02-10 20:25:58,306 INFO L138 SettingsManager]: * sizeof long=4 [2020-02-10 20:25:58,307 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-02-10 20:25:58,307 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-02-10 20:25:58,307 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-02-10 20:25:58,308 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-02-10 20:25:58,308 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-02-10 20:25:58,308 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-02-10 20:25:58,309 INFO L138 SettingsManager]: * sizeof long double=12 [2020-02-10 20:25:58,309 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-02-10 20:25:58,309 INFO L138 SettingsManager]: * Use constant arrays=true [2020-02-10 20:25:58,309 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-02-10 20:25:58,309 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-02-10 20:25:58,310 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-02-10 20:25:58,310 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-02-10 20:25:58,310 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-02-10 20:25:58,310 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-02-10 20:25:58,311 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-02-10 20:25:58,311 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-02-10 20:25:58,311 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-02-10 20:25:58,311 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-02-10 20:25:58,311 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-02-10 20:25:58,311 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-02-10 20:25:58,312 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-02-10 20:25:58,312 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-02-10 20:25:58,621 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-02-10 20:25:58,642 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-02-10 20:25:58,646 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-02-10 20:25:58,647 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2020-02-10 20:25:58,648 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2020-02-10 20:25:58,649 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 20:25:58,650 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/mcr/example_10.bpl' [2020-02-10 20:25:58,694 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-02-10 20:25:58,699 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-02-10 20:25:58,699 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-02-10 20:25:58,699 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-02-10 20:25:58,700 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-02-10 20:25:58,718 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 08:25:58" (1/1) ... [2020-02-10 20:25:58,729 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 08:25:58" (1/1) ... [2020-02-10 20:25:58,739 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-02-10 20:25:58,740 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-02-10 20:25:58,740 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-02-10 20:25:58,740 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-02-10 20:25:58,752 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 08:25:58" (1/1) ... [2020-02-10 20:25:58,753 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 08:25:58" (1/1) ... [2020-02-10 20:25:58,754 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 08:25:58" (1/1) ... [2020-02-10 20:25:58,755 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 08:25:58" (1/1) ... [2020-02-10 20:25:58,763 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 08:25:58" (1/1) ... [2020-02-10 20:25:58,765 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 08:25:58" (1/1) ... [2020-02-10 20:25:58,766 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 08:25:58" (1/1) ... [2020-02-10 20:25:58,770 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-02-10 20:25:58,770 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-02-10 20:25:58,770 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-02-10 20:25:58,771 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-02-10 20:25:58,772 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "example_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:25:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-02-10 20:25:58,858 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_1 given in one single declaration [2020-02-10 20:25:58,859 INFO L130 BoogieDeclarations]: Found specification of procedure set_1 [2020-02-10 20:25:58,860 INFO L138 BoogieDeclarations]: Found implementation of procedure set_1 [2020-02-10 20:25:58,861 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_2 given in one single declaration [2020-02-10 20:25:58,861 INFO L130 BoogieDeclarations]: Found specification of procedure set_2 [2020-02-10 20:25:58,861 INFO L138 BoogieDeclarations]: Found implementation of procedure set_2 [2020-02-10 20:25:58,862 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_3 given in one single declaration [2020-02-10 20:25:58,862 INFO L130 BoogieDeclarations]: Found specification of procedure set_3 [2020-02-10 20:25:58,862 INFO L138 BoogieDeclarations]: Found implementation of procedure set_3 [2020-02-10 20:25:58,862 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_4 given in one single declaration [2020-02-10 20:25:58,863 INFO L130 BoogieDeclarations]: Found specification of procedure set_4 [2020-02-10 20:25:58,863 INFO L138 BoogieDeclarations]: Found implementation of procedure set_4 [2020-02-10 20:25:58,863 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_0 given in one single declaration [2020-02-10 20:25:58,863 INFO L130 BoogieDeclarations]: Found specification of procedure set_0 [2020-02-10 20:25:58,863 INFO L138 BoogieDeclarations]: Found implementation of procedure set_0 [2020-02-10 20:25:58,863 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_9 given in one single declaration [2020-02-10 20:25:58,864 INFO L130 BoogieDeclarations]: Found specification of procedure set_9 [2020-02-10 20:25:58,864 INFO L138 BoogieDeclarations]: Found implementation of procedure set_9 [2020-02-10 20:25:58,864 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2020-02-10 20:25:58,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-02-10 20:25:58,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-02-10 20:25:58,865 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_5 given in one single declaration [2020-02-10 20:25:58,865 INFO L130 BoogieDeclarations]: Found specification of procedure set_5 [2020-02-10 20:25:58,866 INFO L138 BoogieDeclarations]: Found implementation of procedure set_5 [2020-02-10 20:25:58,866 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_6 given in one single declaration [2020-02-10 20:25:58,873 INFO L130 BoogieDeclarations]: Found specification of procedure set_6 [2020-02-10 20:25:58,873 INFO L138 BoogieDeclarations]: Found implementation of procedure set_6 [2020-02-10 20:25:58,874 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_7 given in one single declaration [2020-02-10 20:25:58,875 INFO L130 BoogieDeclarations]: Found specification of procedure set_7 [2020-02-10 20:25:58,875 INFO L138 BoogieDeclarations]: Found implementation of procedure set_7 [2020-02-10 20:25:58,875 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_8 given in one single declaration [2020-02-10 20:25:58,875 INFO L130 BoogieDeclarations]: Found specification of procedure set_8 [2020-02-10 20:25:58,875 INFO L138 BoogieDeclarations]: Found implementation of procedure set_8 [2020-02-10 20:25:58,876 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-02-10 20:25:59,176 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-02-10 20:25:59,177 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-02-10 20:25:59,182 INFO L202 PluginConnector]: Adding new model example_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 08:25:59 BoogieIcfgContainer [2020-02-10 20:25:59,182 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-02-10 20:25:59,185 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-02-10 20:25:59,186 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-02-10 20:25:59,189 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-02-10 20:25:59,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "example_10.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:25:58" (1/2) ... [2020-02-10 20:25:59,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46d67534 and model type example_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.02 08:25:59, skipping insertion in model container [2020-02-10 20:25:59,191 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 08:25:59" (2/2) ... [2020-02-10 20:25:59,194 INFO L109 eAbstractionObserver]: Analyzing ICFG example_10.bpl [2020-02-10 20:25:59,206 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-02-10 20:25:59,206 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-02-10 20:25:59,215 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-02-10 20:25:59,216 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-02-10 20:25:59,479 INFO L251 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2020-02-10 20:25:59,498 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-02-10 20:25:59,498 INFO L376 AbstractCegarLoop]: Hoare is true [2020-02-10 20:25:59,499 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-02-10 20:25:59,499 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-02-10 20:25:59,499 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-02-10 20:25:59,499 INFO L380 AbstractCegarLoop]: Difference is false [2020-02-10 20:25:59,499 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-02-10 20:25:59,500 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-02-10 20:25:59,518 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 143 transitions [2020-02-10 20:25:59,520 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 84 places, 143 transitions [2020-02-10 20:26:02,523 INFO L129 PetriNetUnfolder]: 4097/5153 cut-off events. [2020-02-10 20:26:02,524 INFO L130 PetriNetUnfolder]: For 5120/5120 co-relation queries the response was YES. [2020-02-10 20:26:02,590 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 20:26:02,685 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 84 places, 143 transitions [2020-02-10 20:26:05,503 INFO L129 PetriNetUnfolder]: 4097/5153 cut-off events. [2020-02-10 20:26:05,503 INFO L130 PetriNetUnfolder]: For 5120/5120 co-relation queries the response was YES. [2020-02-10 20:26:05,545 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 20:26:05,656 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 3780 [2020-02-10 20:26:05,658 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-02-10 20:26:06,033 INFO L206 etLargeBlockEncoding]: Checked pairs total: 1035 [2020-02-10 20:26:06,033 INFO L214 etLargeBlockEncoding]: Total number of compositions: 11 [2020-02-10 20:26:06,037 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 73 places, 132 transitions [2020-02-10 20:26:20,802 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 60074 states. [2020-02-10 20:26:20,803 INFO L276 IsEmpty]: Start isEmpty. Operand 60074 states. [2020-02-10 20:26:21,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:26:21,151 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:26:21,152 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:26:21,153 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 20:26:21,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:26:21,162 INFO L82 PathProgramCache]: Analyzing trace with hash 661896340, now seen corresponding path program 1 times [2020-02-10 20:26:21,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:26:21,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483632221] [2020-02-10 20:26:21,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:26:21,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:26:21,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:26:21,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483632221] [2020-02-10 20:26:21,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:26:21,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:26:21,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277558177] [2020-02-10 20:26:21,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:26:21,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:26:21,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:26:21,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:26:21,365 INFO L87 Difference]: Start difference. First operand 60074 states. Second operand 3 states. [2020-02-10 20:26:22,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:26:22,244 INFO L93 Difference]: Finished difference Result 59562 states and 393662 transitions. [2020-02-10 20:26:22,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:26:22,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2020-02-10 20:26:22,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:26:24,929 INFO L225 Difference]: With dead ends: 59562 [2020-02-10 20:26:24,930 INFO L226 Difference]: Without dead ends: 59561 [2020-02-10 20:26:24,932 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:26:27,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59561 states. [2020-02-10 20:26:29,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59561 to 59561. [2020-02-10 20:26:29,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59561 states. [2020-02-10 20:26:29,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59561 states to 59561 states and 393661 transitions. [2020-02-10 20:26:29,838 INFO L78 Accepts]: Start accepts. Automaton has 59561 states and 393661 transitions. Word has length 31 [2020-02-10 20:26:29,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:26:29,839 INFO L479 AbstractCegarLoop]: Abstraction has 59561 states and 393661 transitions. [2020-02-10 20:26:29,840 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:26:29,840 INFO L276 IsEmpty]: Start isEmpty. Operand 59561 states and 393661 transitions. [2020-02-10 20:26:30,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:26:30,069 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:26:30,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:26:30,069 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 20:26:30,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:26:30,070 INFO L82 PathProgramCache]: Analyzing trace with hash 426637814, now seen corresponding path program 1 times [2020-02-10 20:26:30,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:26:30,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034151393] [2020-02-10 20:26:30,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:26:30,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:26:30,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 20:26:30,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034151393] [2020-02-10 20:26:30,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:26:30,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:26:30,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621711621] [2020-02-10 20:26:30,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:26:30,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:26:30,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:26:30,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:26:30,129 INFO L87 Difference]: Start difference. First operand 59561 states and 393661 transitions. Second operand 3 states. [2020-02-10 20:26:33,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:26:33,758 INFO L93 Difference]: Finished difference Result 46761 states and 293565 transitions. [2020-02-10 20:26:33,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:26:33,759 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2020-02-10 20:26:33,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:26:34,077 INFO L225 Difference]: With dead ends: 46761 [2020-02-10 20:26:34,078 INFO L226 Difference]: Without dead ends: 46761 [2020-02-10 20:26:34,079 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:26:35,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46761 states. [2020-02-10 20:26:36,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46761 to 46761. [2020-02-10 20:26:36,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46761 states. [2020-02-10 20:26:37,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46761 states to 46761 states and 293565 transitions. [2020-02-10 20:26:37,118 INFO L78 Accepts]: Start accepts. Automaton has 46761 states and 293565 transitions. Word has length 31 [2020-02-10 20:26:37,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:26:37,119 INFO L479 AbstractCegarLoop]: Abstraction has 46761 states and 293565 transitions. [2020-02-10 20:26:37,119 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:26:37,119 INFO L276 IsEmpty]: Start isEmpty. Operand 46761 states and 293565 transitions. [2020-02-10 20:26:37,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:26:37,222 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:26:37,223 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:26:37,223 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 20:26:37,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:26:37,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1161690204, now seen corresponding path program 1 times [2020-02-10 20:26:37,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:26:37,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182339093] [2020-02-10 20:26:37,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:26:37,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:26:37,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:26:37,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182339093] [2020-02-10 20:26:37,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:26:37,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:26:37,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714214294] [2020-02-10 20:26:37,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:26:37,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:26:37,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:26:37,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:26:37,268 INFO L87 Difference]: Start difference. First operand 46761 states and 293565 transitions. Second operand 3 states. [2020-02-10 20:26:37,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:26:37,584 INFO L93 Difference]: Finished difference Result 44201 states and 271549 transitions. [2020-02-10 20:26:37,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:26:37,584 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2020-02-10 20:26:37,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:26:37,776 INFO L225 Difference]: With dead ends: 44201 [2020-02-10 20:26:37,776 INFO L226 Difference]: Without dead ends: 44201 [2020-02-10 20:26:37,777 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:26:39,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44201 states. [2020-02-10 20:26:43,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44201 to 44201. [2020-02-10 20:26:43,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44201 states. [2020-02-10 20:26:43,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44201 states to 44201 states and 271549 transitions. [2020-02-10 20:26:43,332 INFO L78 Accepts]: Start accepts. Automaton has 44201 states and 271549 transitions. Word has length 31 [2020-02-10 20:26:43,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:26:43,332 INFO L479 AbstractCegarLoop]: Abstraction has 44201 states and 271549 transitions. [2020-02-10 20:26:43,333 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:26:43,333 INFO L276 IsEmpty]: Start isEmpty. Operand 44201 states and 271549 transitions. [2020-02-10 20:26:43,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:26:43,448 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:26:43,448 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:26:43,448 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 20:26:43,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:26:43,448 INFO L82 PathProgramCache]: Analyzing trace with hash 852645084, now seen corresponding path program 1 times [2020-02-10 20:26:43,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:26:43,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636893125] [2020-02-10 20:26:43,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:26:43,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:26:43,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:26:43,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636893125] [2020-02-10 20:26:43,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:26:43,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:26:43,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803870313] [2020-02-10 20:26:43,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:26:43,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:26:43,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:26:43,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:26:43,484 INFO L87 Difference]: Start difference. First operand 44201 states and 271549 transitions. Second operand 3 states. [2020-02-10 20:26:43,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:26:43,744 INFO L93 Difference]: Finished difference Result 38313 states and 225981 transitions. [2020-02-10 20:26:43,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:26:43,745 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2020-02-10 20:26:43,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:26:43,897 INFO L225 Difference]: With dead ends: 38313 [2020-02-10 20:26:43,898 INFO L226 Difference]: Without dead ends: 38313 [2020-02-10 20:26:43,898 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:26:45,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38313 states. [2020-02-10 20:26:46,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38313 to 38313. [2020-02-10 20:26:46,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38313 states. [2020-02-10 20:26:46,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38313 states to 38313 states and 225981 transitions. [2020-02-10 20:26:46,455 INFO L78 Accepts]: Start accepts. Automaton has 38313 states and 225981 transitions. Word has length 31 [2020-02-10 20:26:46,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:26:46,455 INFO L479 AbstractCegarLoop]: Abstraction has 38313 states and 225981 transitions. [2020-02-10 20:26:46,455 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:26:46,455 INFO L276 IsEmpty]: Start isEmpty. Operand 38313 states and 225981 transitions. [2020-02-10 20:26:46,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:26:46,534 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:26:46,534 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:26:46,534 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 20:26:46,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:26:46,535 INFO L82 PathProgramCache]: Analyzing trace with hash 567479930, now seen corresponding path program 1 times [2020-02-10 20:26:46,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:26:46,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855704389] [2020-02-10 20:26:46,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:26:46,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:26:46,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:26:46,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855704389] [2020-02-10 20:26:46,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:26:46,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:26:46,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234749457] [2020-02-10 20:26:46,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:26:46,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:26:46,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:26:46,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:26:46,571 INFO L87 Difference]: Start difference. First operand 38313 states and 225981 transitions. Second operand 3 states. [2020-02-10 20:26:46,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:26:46,757 INFO L93 Difference]: Finished difference Result 25961 states and 144061 transitions. [2020-02-10 20:26:46,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:26:46,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2020-02-10 20:26:46,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:26:46,847 INFO L225 Difference]: With dead ends: 25961 [2020-02-10 20:26:46,847 INFO L226 Difference]: Without dead ends: 25961 [2020-02-10 20:26:46,847 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:26:47,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25961 states. [2020-02-10 20:26:47,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25961 to 25961. [2020-02-10 20:26:47,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25961 states. [2020-02-10 20:26:51,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25961 states to 25961 states and 144061 transitions. [2020-02-10 20:26:51,185 INFO L78 Accepts]: Start accepts. Automaton has 25961 states and 144061 transitions. Word has length 31 [2020-02-10 20:26:51,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:26:51,185 INFO L479 AbstractCegarLoop]: Abstraction has 25961 states and 144061 transitions. [2020-02-10 20:26:51,185 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:26:51,185 INFO L276 IsEmpty]: Start isEmpty. Operand 25961 states and 144061 transitions. [2020-02-10 20:26:51,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:26:51,240 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:26:51,240 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:26:51,240 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 20:26:51,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:26:51,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1677176002, now seen corresponding path program 1 times [2020-02-10 20:26:51,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:26:51,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675934615] [2020-02-10 20:26:51,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:26:51,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:26:51,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:26:51,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675934615] [2020-02-10 20:26:51,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:26:51,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:26:51,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395749279] [2020-02-10 20:26:51,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:26:51,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:26:51,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:26:51,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:26:51,271 INFO L87 Difference]: Start difference. First operand 25961 states and 144061 transitions. Second operand 3 states. [2020-02-10 20:26:51,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:26:51,384 INFO L93 Difference]: Finished difference Result 15753 states and 82941 transitions. [2020-02-10 20:26:51,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:26:51,386 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2020-02-10 20:26:51,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:26:51,430 INFO L225 Difference]: With dead ends: 15753 [2020-02-10 20:26:51,431 INFO L226 Difference]: Without dead ends: 15753 [2020-02-10 20:26:51,431 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:26:51,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15753 states. [2020-02-10 20:26:51,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15753 to 15753. [2020-02-10 20:26:51,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15753 states. [2020-02-10 20:26:52,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15753 states to 15753 states and 82941 transitions. [2020-02-10 20:26:52,040 INFO L78 Accepts]: Start accepts. Automaton has 15753 states and 82941 transitions. Word has length 31 [2020-02-10 20:26:52,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:26:52,041 INFO L479 AbstractCegarLoop]: Abstraction has 15753 states and 82941 transitions. [2020-02-10 20:26:52,041 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:26:52,041 INFO L276 IsEmpty]: Start isEmpty. Operand 15753 states and 82941 transitions. [2020-02-10 20:26:52,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:26:52,072 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:26:52,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 20:26:52,072 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 20:26:52,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:26:52,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1856579948, now seen corresponding path program 1 times [2020-02-10 20:26:52,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:26:52,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355917051] [2020-02-10 20:26:52,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:26:52,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:26:52,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:26:52,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355917051] [2020-02-10 20:26:52,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:26:52,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:26:52,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664693531] [2020-02-10 20:26:52,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:26:52,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:26:52,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:26:52,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:26:52,112 INFO L87 Difference]: Start difference. First operand 15753 states and 82941 transitions. Second operand 3 states. [2020-02-10 20:26:52,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:26:52,183 INFO L93 Difference]: Finished difference Result 8825 states and 45229 transitions. [2020-02-10 20:26:52,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:26:52,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2020-02-10 20:26:52,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:26:52,209 INFO L225 Difference]: With dead ends: 8825 [2020-02-10 20:26:52,210 INFO L226 Difference]: Without dead ends: 8825 [2020-02-10 20:26:52,210 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:26:52,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8825 states. [2020-02-10 20:26:52,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8825 to 8825. [2020-02-10 20:26:52,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8825 states. [2020-02-10 20:26:52,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8825 states to 8825 states and 45229 transitions. [2020-02-10 20:26:52,548 INFO L78 Accepts]: Start accepts. Automaton has 8825 states and 45229 transitions. Word has length 31 [2020-02-10 20:26:52,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:26:52,548 INFO L479 AbstractCegarLoop]: Abstraction has 8825 states and 45229 transitions. [2020-02-10 20:26:52,548 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:26:52,549 INFO L276 IsEmpty]: Start isEmpty. Operand 8825 states and 45229 transitions. [2020-02-10 20:26:52,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:26:52,564 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:26:52,564 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:26:52,564 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 20:26:52,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:26:52,564 INFO L82 PathProgramCache]: Analyzing trace with hash 982570830, now seen corresponding path program 1 times [2020-02-10 20:26:52,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:26:52,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560008302] [2020-02-10 20:26:52,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:26:52,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:26:52,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:26:52,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560008302] [2020-02-10 20:26:52,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:26:52,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:26:52,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600036217] [2020-02-10 20:26:52,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:26:52,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:26:52,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:26:52,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:26:52,592 INFO L87 Difference]: Start difference. First operand 8825 states and 45229 transitions. Second operand 3 states. [2020-02-10 20:26:52,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:26:52,649 INFO L93 Difference]: Finished difference Result 5097 states and 25581 transitions. [2020-02-10 20:26:52,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:26:52,650 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2020-02-10 20:26:52,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:26:52,664 INFO L225 Difference]: With dead ends: 5097 [2020-02-10 20:26:52,665 INFO L226 Difference]: Without dead ends: 5097 [2020-02-10 20:26:52,665 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:26:52,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5097 states. [2020-02-10 20:26:52,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5097 to 5097. [2020-02-10 20:26:52,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5097 states. [2020-02-10 20:26:52,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5097 states to 5097 states and 25581 transitions. [2020-02-10 20:26:52,884 INFO L78 Accepts]: Start accepts. Automaton has 5097 states and 25581 transitions. Word has length 31 [2020-02-10 20:26:52,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:26:52,885 INFO L479 AbstractCegarLoop]: Abstraction has 5097 states and 25581 transitions. [2020-02-10 20:26:52,885 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:26:52,885 INFO L276 IsEmpty]: Start isEmpty. Operand 5097 states and 25581 transitions. [2020-02-10 20:26:52,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:26:52,894 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:26:52,894 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:26:52,894 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 20:26:52,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:26:52,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1054359614, now seen corresponding path program 1 times [2020-02-10 20:26:52,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:26:52,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972014382] [2020-02-10 20:26:52,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:26:52,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:26:52,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:26:52,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972014382] [2020-02-10 20:26:52,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:26:52,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:26:52,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387484714] [2020-02-10 20:26:52,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:26:52,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:26:52,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:26:52,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:26:52,923 INFO L87 Difference]: Start difference. First operand 5097 states and 25581 transitions. Second operand 3 states. [2020-02-10 20:26:52,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:26:52,957 INFO L93 Difference]: Finished difference Result 3071 states and 15361 transitions. [2020-02-10 20:26:52,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:26:52,957 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2020-02-10 20:26:52,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:26:52,967 INFO L225 Difference]: With dead ends: 3071 [2020-02-10 20:26:52,967 INFO L226 Difference]: Without dead ends: 3071 [2020-02-10 20:26:52,968 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:26:53,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3071 states. [2020-02-10 20:26:53,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3071 to 3071. [2020-02-10 20:26:53,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3071 states. [2020-02-10 20:26:53,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3071 states to 3071 states and 15361 transitions. [2020-02-10 20:26:53,128 INFO L78 Accepts]: Start accepts. Automaton has 3071 states and 15361 transitions. Word has length 31 [2020-02-10 20:26:53,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:26:53,128 INFO L479 AbstractCegarLoop]: Abstraction has 3071 states and 15361 transitions. [2020-02-10 20:26:53,128 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:26:53,128 INFO L276 IsEmpty]: Start isEmpty. Operand 3071 states and 15361 transitions. [2020-02-10 20:26:53,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:26:53,135 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:26:53,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:26:53,136 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 20:26:53,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:26:53,136 INFO L82 PathProgramCache]: Analyzing trace with hash -605876662, now seen corresponding path program 1 times [2020-02-10 20:26:53,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:26:53,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791089958] [2020-02-10 20:26:53,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:26:53,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:26:53,987 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 31 [2020-02-10 20:26:54,134 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 20:26:54,317 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 37 [2020-02-10 20:26:54,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:26:54,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791089958] [2020-02-10 20:26:54,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:26:54,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:26:54,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631094001] [2020-02-10 20:26:54,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:26:54,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:26:54,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:26:54,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:26:54,333 INFO L87 Difference]: Start difference. First operand 3071 states and 15361 transitions. Second operand 12 states. [2020-02-10 20:26:54,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:26:54,660 INFO L93 Difference]: Finished difference Result 6095 states and 27102 transitions. [2020-02-10 20:26:54,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:26:54,660 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:26:54,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:26:54,674 INFO L225 Difference]: With dead ends: 6095 [2020-02-10 20:26:54,675 INFO L226 Difference]: Without dead ends: 6076 [2020-02-10 20:26:54,675 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 20:26:54,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6076 states. [2020-02-10 20:26:54,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6076 to 3141. [2020-02-10 20:26:54,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3141 states. [2020-02-10 20:26:54,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3141 states to 3141 states and 15673 transitions. [2020-02-10 20:26:54,891 INFO L78 Accepts]: Start accepts. Automaton has 3141 states and 15673 transitions. Word has length 31 [2020-02-10 20:26:54,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:26:54,891 INFO L479 AbstractCegarLoop]: Abstraction has 3141 states and 15673 transitions. [2020-02-10 20:26:54,891 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:26:54,891 INFO L276 IsEmpty]: Start isEmpty. Operand 3141 states and 15673 transitions. [2020-02-10 20:26:54,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:26:54,898 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:26:54,898 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:26:54,898 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 20:26:54,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:26:54,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1873333840, now seen corresponding path program 2 times [2020-02-10 20:26:54,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:26:54,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199036736] [2020-02-10 20:26:54,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:26:54,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:26:55,465 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 27 [2020-02-10 20:26:55,850 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2020-02-10 20:26:55,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:26:55,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199036736] [2020-02-10 20:26:55,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:26:55,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:26:55,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954452188] [2020-02-10 20:26:55,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:26:55,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:26:55,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:26:55,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:26:55,862 INFO L87 Difference]: Start difference. First operand 3141 states and 15673 transitions. Second operand 12 states. [2020-02-10 20:26:56,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:26:56,241 INFO L93 Difference]: Finished difference Result 6096 states and 27096 transitions. [2020-02-10 20:26:56,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:26:56,242 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:26:56,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:26:56,258 INFO L225 Difference]: With dead ends: 6096 [2020-02-10 20:26:56,258 INFO L226 Difference]: Without dead ends: 6068 [2020-02-10 20:26:56,258 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:26:56,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6068 states. [2020-02-10 20:26:56,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6068 to 3133. [2020-02-10 20:26:56,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-02-10 20:26:56,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15651 transitions. [2020-02-10 20:26:56,480 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15651 transitions. Word has length 31 [2020-02-10 20:26:56,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:26:56,481 INFO L479 AbstractCegarLoop]: Abstraction has 3133 states and 15651 transitions. [2020-02-10 20:26:56,481 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:26:56,481 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15651 transitions. [2020-02-10 20:26:56,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:26:56,488 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:26:56,488 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:26:56,489 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 20:26:56,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:26:56,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1454499134, now seen corresponding path program 3 times [2020-02-10 20:26:56,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:26:56,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871931998] [2020-02-10 20:26:56,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:26:56,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:26:57,185 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:26:57,328 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 37 [2020-02-10 20:26:57,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:26:57,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871931998] [2020-02-10 20:26:57,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:26:57,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:26:57,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186549014] [2020-02-10 20:26:57,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:26:57,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:26:57,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:26:57,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:26:57,343 INFO L87 Difference]: Start difference. First operand 3133 states and 15651 transitions. Second operand 12 states. [2020-02-10 20:26:57,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:26:57,667 INFO L93 Difference]: Finished difference Result 6092 states and 27088 transitions. [2020-02-10 20:26:57,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:26:57,667 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:26:57,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:26:57,685 INFO L225 Difference]: With dead ends: 6092 [2020-02-10 20:26:57,686 INFO L226 Difference]: Without dead ends: 6073 [2020-02-10 20:26:57,686 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:26:57,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6073 states. [2020-02-10 20:26:57,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6073 to 3140. [2020-02-10 20:26:57,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3140 states. [2020-02-10 20:26:57,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3140 states to 3140 states and 15664 transitions. [2020-02-10 20:26:57,899 INFO L78 Accepts]: Start accepts. Automaton has 3140 states and 15664 transitions. Word has length 31 [2020-02-10 20:26:57,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:26:57,899 INFO L479 AbstractCegarLoop]: Abstraction has 3140 states and 15664 transitions. [2020-02-10 20:26:57,899 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:26:57,899 INFO L276 IsEmpty]: Start isEmpty. Operand 3140 states and 15664 transitions. [2020-02-10 20:26:57,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:26:57,906 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:26:57,906 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:26:57,907 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 20:26:57,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:26:57,907 INFO L82 PathProgramCache]: Analyzing trace with hash -116931920, now seen corresponding path program 4 times [2020-02-10 20:26:57,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:26:57,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163005769] [2020-02-10 20:26:57,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:26:57,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:26:58,555 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 20:26:58,701 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2020-02-10 20:26:58,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:26:58,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163005769] [2020-02-10 20:26:58,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:26:58,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:26:58,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361437538] [2020-02-10 20:26:58,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:26:58,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:26:58,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:26:58,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:26:58,715 INFO L87 Difference]: Start difference. First operand 3140 states and 15664 transitions. Second operand 12 states. [2020-02-10 20:26:59,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:26:59,009 INFO L93 Difference]: Finished difference Result 6091 states and 27079 transitions. [2020-02-10 20:26:59,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:26:59,010 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:26:59,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:26:59,029 INFO L225 Difference]: With dead ends: 6091 [2020-02-10 20:26:59,029 INFO L226 Difference]: Without dead ends: 6066 [2020-02-10 20:26:59,029 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:26:59,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6066 states. [2020-02-10 20:26:59,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6066 to 3133. [2020-02-10 20:26:59,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-02-10 20:26:59,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15644 transitions. [2020-02-10 20:26:59,235 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15644 transitions. Word has length 31 [2020-02-10 20:26:59,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:26:59,235 INFO L479 AbstractCegarLoop]: Abstraction has 3133 states and 15644 transitions. [2020-02-10 20:26:59,236 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:26:59,236 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15644 transitions. [2020-02-10 20:26:59,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:26:59,241 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:26:59,241 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:26:59,241 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 20:26:59,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:26:59,241 INFO L82 PathProgramCache]: Analyzing trace with hash 936544130, now seen corresponding path program 5 times [2020-02-10 20:26:59,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:26:59,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199877318] [2020-02-10 20:26:59,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:26:59,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:26:59,811 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:26:59,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:26:59,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199877318] [2020-02-10 20:26:59,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:26:59,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:26:59,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800684534] [2020-02-10 20:26:59,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:26:59,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:26:59,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:26:59,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:26:59,977 INFO L87 Difference]: Start difference. First operand 3133 states and 15644 transitions. Second operand 12 states. [2020-02-10 20:27:00,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:27:00,275 INFO L93 Difference]: Finished difference Result 6094 states and 27085 transitions. [2020-02-10 20:27:00,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:27:00,276 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:27:00,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:27:00,290 INFO L225 Difference]: With dead ends: 6094 [2020-02-10 20:27:00,290 INFO L226 Difference]: Without dead ends: 6074 [2020-02-10 20:27:00,291 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:27:00,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6074 states. [2020-02-10 20:27:00,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6074 to 3140. [2020-02-10 20:27:00,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3140 states. [2020-02-10 20:27:00,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3140 states to 3140 states and 15657 transitions. [2020-02-10 20:27:00,482 INFO L78 Accepts]: Start accepts. Automaton has 3140 states and 15657 transitions. Word has length 31 [2020-02-10 20:27:00,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:27:00,482 INFO L479 AbstractCegarLoop]: Abstraction has 3140 states and 15657 transitions. [2020-02-10 20:27:00,482 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:27:00,482 INFO L276 IsEmpty]: Start isEmpty. Operand 3140 states and 15657 transitions. [2020-02-10 20:27:00,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:27:00,488 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:27:00,488 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:27:00,488 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 20:27:00,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:27:00,489 INFO L82 PathProgramCache]: Analyzing trace with hash -753398774, now seen corresponding path program 6 times [2020-02-10 20:27:00,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:27:00,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252127249] [2020-02-10 20:27:00,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:27:00,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:27:01,216 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:27:01,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:27:01,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252127249] [2020-02-10 20:27:01,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:27:01,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:27:01,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20685436] [2020-02-10 20:27:01,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:27:01,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:27:01,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:27:01,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:27:01,230 INFO L87 Difference]: Start difference. First operand 3140 states and 15657 transitions. Second operand 12 states. [2020-02-10 20:27:01,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:27:01,624 INFO L93 Difference]: Finished difference Result 6092 states and 27074 transitions. [2020-02-10 20:27:01,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:27:01,625 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:27:01,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:27:01,640 INFO L225 Difference]: With dead ends: 6092 [2020-02-10 20:27:01,640 INFO L226 Difference]: Without dead ends: 6060 [2020-02-10 20:27: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 20:27:01,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6060 states. [2020-02-10 20:27:01,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6060 to 3126. [2020-02-10 20:27:01,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 20:27:01,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15624 transitions. [2020-02-10 20:27:01,834 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15624 transitions. Word has length 31 [2020-02-10 20:27:01,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:27:01,834 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15624 transitions. [2020-02-10 20:27:01,834 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:27:01,834 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15624 transitions. [2020-02-10 20:27:01,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:27:01,840 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:27:01,840 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:27:01,840 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 20:27:01,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:27:01,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1138487344, now seen corresponding path program 7 times [2020-02-10 20:27:01,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:27:01,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121532081] [2020-02-10 20:27:01,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:27:01,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:27:02,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:27:02,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121532081] [2020-02-10 20:27:02,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:27:02,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:27:02,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700213014] [2020-02-10 20:27:02,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:27:02,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:27:02,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:27:02,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:27:02,582 INFO L87 Difference]: Start difference. First operand 3126 states and 15624 transitions. Second operand 12 states. [2020-02-10 20:27:02,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:27:02,834 INFO L93 Difference]: Finished difference Result 6109 states and 27126 transitions. [2020-02-10 20:27:02,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:27:02,835 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:27:02,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:27:02,849 INFO L225 Difference]: With dead ends: 6109 [2020-02-10 20:27:02,849 INFO L226 Difference]: Without dead ends: 6090 [2020-02-10 20:27:02,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:27:02,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6090 states. [2020-02-10 20:27:03,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6090 to 3145. [2020-02-10 20:27:03,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3145 states. [2020-02-10 20:27:03,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3145 states to 3145 states and 15676 transitions. [2020-02-10 20:27:03,036 INFO L78 Accepts]: Start accepts. Automaton has 3145 states and 15676 transitions. Word has length 31 [2020-02-10 20:27:03,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:27:03,036 INFO L479 AbstractCegarLoop]: Abstraction has 3145 states and 15676 transitions. [2020-02-10 20:27:03,036 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:27:03,037 INFO L276 IsEmpty]: Start isEmpty. Operand 3145 states and 15676 transitions. [2020-02-10 20:27:03,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:27:03,043 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:27:03,043 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:27:03,043 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 20:27:03,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:27:03,044 INFO L82 PathProgramCache]: Analyzing trace with hash -128969834, now seen corresponding path program 8 times [2020-02-10 20:27:03,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:27:03,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871200701] [2020-02-10 20:27:03,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:27:03,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:27:03,659 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:27:03,802 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:27:03,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:27:03,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871200701] [2020-02-10 20:27:03,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:27:03,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:27:03,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16081764] [2020-02-10 20:27:03,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:27:03,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:27:03,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:27:03,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:27:03,820 INFO L87 Difference]: Start difference. First operand 3145 states and 15676 transitions. Second operand 12 states. [2020-02-10 20:27:04,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:27:04,060 INFO L93 Difference]: Finished difference Result 6110 states and 27120 transitions. [2020-02-10 20:27:04,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:27:04,061 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:27:04,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:27:04,076 INFO L225 Difference]: With dead ends: 6110 [2020-02-10 20:27:04,076 INFO L226 Difference]: Without dead ends: 6082 [2020-02-10 20:27:04,077 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:27:04,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6082 states. [2020-02-10 20:27:04,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6082 to 3137. [2020-02-10 20:27:04,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3137 states. [2020-02-10 20:27:04,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3137 states to 3137 states and 15653 transitions. [2020-02-10 20:27:04,262 INFO L78 Accepts]: Start accepts. Automaton has 3137 states and 15653 transitions. Word has length 31 [2020-02-10 20:27:04,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:27:04,262 INFO L479 AbstractCegarLoop]: Abstraction has 3137 states and 15653 transitions. [2020-02-10 20:27:04,262 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:27:04,262 INFO L276 IsEmpty]: Start isEmpty. Operand 3137 states and 15653 transitions. [2020-02-10 20:27:04,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:27:04,267 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:27:04,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:27:04,268 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 20:27:04,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:27:04,268 INFO L82 PathProgramCache]: Analyzing trace with hash -346601982, now seen corresponding path program 9 times [2020-02-10 20:27:04,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:27:04,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282814107] [2020-02-10 20:27:04,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:27:04,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:27:04,965 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:27:04,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:27:04,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282814107] [2020-02-10 20:27:04,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:27:04,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:27:04,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555637518] [2020-02-10 20:27:04,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:27:04,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:27:04,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:27:04,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:27:04,977 INFO L87 Difference]: Start difference. First operand 3137 states and 15653 transitions. Second operand 12 states. [2020-02-10 20:27:05,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:27:05,261 INFO L93 Difference]: Finished difference Result 6112 states and 27123 transitions. [2020-02-10 20:27:05,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:27:05,262 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:27:05,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:27:05,277 INFO L225 Difference]: With dead ends: 6112 [2020-02-10 20:27:05,277 INFO L226 Difference]: Without dead ends: 6093 [2020-02-10 20:27:05,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:27:05,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6093 states. [2020-02-10 20:27:05,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6093 to 3146. [2020-02-10 20:27:05,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3146 states. [2020-02-10 20:27:05,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3146 states to 3146 states and 15670 transitions. [2020-02-10 20:27:05,463 INFO L78 Accepts]: Start accepts. Automaton has 3146 states and 15670 transitions. Word has length 31 [2020-02-10 20:27:05,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:27:05,464 INFO L479 AbstractCegarLoop]: Abstraction has 3146 states and 15670 transitions. [2020-02-10 20:27:05,464 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:27:05,464 INFO L276 IsEmpty]: Start isEmpty. Operand 3146 states and 15670 transitions. [2020-02-10 20:27:05,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:27:05,469 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:27:05,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:27:05,469 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 20:27:05,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:27:05,469 INFO L82 PathProgramCache]: Analyzing trace with hash -276491946, now seen corresponding path program 10 times [2020-02-10 20:27:05,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:27:05,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616715350] [2020-02-10 20:27:05,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:27:05,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:27:06,073 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 36 [2020-02-10 20:27:06,208 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:27:06,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:27:06,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616715350] [2020-02-10 20:27:06,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:27:06,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:27:06,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298072398] [2020-02-10 20:27:06,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:27:06,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:27:06,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:27:06,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:27:06,220 INFO L87 Difference]: Start difference. First operand 3146 states and 15670 transitions. Second operand 12 states. [2020-02-10 20:27:06,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:27:06,442 INFO L93 Difference]: Finished difference Result 6115 states and 27120 transitions. [2020-02-10 20:27:06,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:27:06,443 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:27:06,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:27:06,460 INFO L225 Difference]: With dead ends: 6115 [2020-02-10 20:27:06,460 INFO L226 Difference]: Without dead ends: 6084 [2020-02-10 20:27:06,461 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:27:06,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6084 states. [2020-02-10 20:27:06,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6084 to 3137. [2020-02-10 20:27:06,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3137 states. [2020-02-10 20:27:06,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3137 states to 3137 states and 15644 transitions. [2020-02-10 20:27:06,741 INFO L78 Accepts]: Start accepts. Automaton has 3137 states and 15644 transitions. Word has length 31 [2020-02-10 20:27:06,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:27:06,741 INFO L479 AbstractCegarLoop]: Abstraction has 3137 states and 15644 transitions. [2020-02-10 20:27:06,741 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:27:06,741 INFO L276 IsEmpty]: Start isEmpty. Operand 3137 states and 15644 transitions. [2020-02-10 20:27:06,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:27:06,746 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:27:06,746 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:27:06,747 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 20:27:06,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:27:06,747 INFO L82 PathProgramCache]: Analyzing trace with hash 2044441282, now seen corresponding path program 11 times [2020-02-10 20:27:06,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:27:06,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511658970] [2020-02-10 20:27:06,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:27:06,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:27:07,366 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:27:07,498 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:27:07,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:27:07,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511658970] [2020-02-10 20:27:07,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:27:07,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:27:07,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621089977] [2020-02-10 20:27:07,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:27:07,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:27:07,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:27:07,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:27:07,510 INFO L87 Difference]: Start difference. First operand 3137 states and 15644 transitions. Second operand 12 states. [2020-02-10 20:27:07,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:27:07,776 INFO L93 Difference]: Finished difference Result 6116 states and 27122 transitions. [2020-02-10 20:27:07,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:27:07,777 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:27:07,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:27:07,791 INFO L225 Difference]: With dead ends: 6116 [2020-02-10 20:27:07,792 INFO L226 Difference]: Without dead ends: 6096 [2020-02-10 20:27:07,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:27:07,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6096 states. [2020-02-10 20:27:07,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6096 to 3148. [2020-02-10 20:27:07,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3148 states. [2020-02-10 20:27:07,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3148 states to 3148 states and 15664 transitions. [2020-02-10 20:27:07,982 INFO L78 Accepts]: Start accepts. Automaton has 3148 states and 15664 transitions. Word has length 31 [2020-02-10 20:27:07,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:27:07,982 INFO L479 AbstractCegarLoop]: Abstraction has 3148 states and 15664 transitions. [2020-02-10 20:27:07,983 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:27:07,983 INFO L276 IsEmpty]: Start isEmpty. Operand 3148 states and 15664 transitions. [2020-02-10 20:27:07,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:27:07,988 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:27:07,988 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:27:07,988 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 20:27:07,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:27:07,989 INFO L82 PathProgramCache]: Analyzing trace with hash -912958800, now seen corresponding path program 12 times [2020-02-10 20:27:07,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:27:07,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521634500] [2020-02-10 20:27:07,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:27:07,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:27:08,596 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:27:08,730 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 35 [2020-02-10 20:27:08,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:27:08,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521634500] [2020-02-10 20:27:08,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:27:08,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:27:08,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472217100] [2020-02-10 20:27:08,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:27:08,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:27:08,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:27:08,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:27:08,742 INFO L87 Difference]: Start difference. First operand 3148 states and 15664 transitions. Second operand 12 states. [2020-02-10 20:27:09,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:27:09,089 INFO L93 Difference]: Finished difference Result 6118 states and 27116 transitions. [2020-02-10 20:27:09,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:27:09,090 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:27:09,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:27:09,104 INFO L225 Difference]: With dead ends: 6118 [2020-02-10 20:27:09,104 INFO L226 Difference]: Without dead ends: 6074 [2020-02-10 20:27:09,105 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:27:09,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6074 states. [2020-02-10 20:27:09,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6074 to 3126. [2020-02-10 20:27:09,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 20:27:09,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15614 transitions. [2020-02-10 20:27:09,289 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15614 transitions. Word has length 31 [2020-02-10 20:27:09,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:27:09,289 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15614 transitions. [2020-02-10 20:27:09,289 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:27:09,289 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15614 transitions. [2020-02-10 20:27:09,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:27:09,295 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:27:09,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:27:09,295 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 20:27:09,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:27:09,295 INFO L82 PathProgramCache]: Analyzing trace with hash -247627984, now seen corresponding path program 13 times [2020-02-10 20:27:09,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:27:09,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548134239] [2020-02-10 20:27:09,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:27:09,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:27:09,979 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 20:27:09,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:27:09,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548134239] [2020-02-10 20:27:09,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:27:09,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:27:09,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651054933] [2020-02-10 20:27:09,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:27:09,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:27:09,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:27:09,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:27:09,990 INFO L87 Difference]: Start difference. First operand 3126 states and 15614 transitions. Second operand 12 states. [2020-02-10 20:27:10,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:27:10,370 INFO L93 Difference]: Finished difference Result 6097 states and 27088 transitions. [2020-02-10 20:27:10,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:27:10,371 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:27:10,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:27:10,386 INFO L225 Difference]: With dead ends: 6097 [2020-02-10 20:27:10,386 INFO L226 Difference]: Without dead ends: 6078 [2020-02-10 20:27:10,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:27:10,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6078 states. [2020-02-10 20:27:10,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6078 to 3141. [2020-02-10 20:27:10,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3141 states. [2020-02-10 20:27:10,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3141 states to 3141 states and 15657 transitions. [2020-02-10 20:27:10,577 INFO L78 Accepts]: Start accepts. Automaton has 3141 states and 15657 transitions. Word has length 31 [2020-02-10 20:27:10,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:27:10,577 INFO L479 AbstractCegarLoop]: Abstraction has 3141 states and 15657 transitions. [2020-02-10 20:27:10,577 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:27:10,577 INFO L276 IsEmpty]: Start isEmpty. Operand 3141 states and 15657 transitions. [2020-02-10 20:27:10,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:27:10,582 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:27:10,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:27:10,583 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 20:27:10,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:27:10,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1089939230, now seen corresponding path program 14 times [2020-02-10 20:27:10,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:27:10,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974906893] [2020-02-10 20:27:10,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:27:10,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:27:11,159 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:27:11,297 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:27:11,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:27:11,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974906893] [2020-02-10 20:27:11,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:27:11,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:27:11,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022529000] [2020-02-10 20:27:11,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:27:11,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:27:11,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:27:11,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:27:11,308 INFO L87 Difference]: Start difference. First operand 3141 states and 15657 transitions. Second operand 12 states. [2020-02-10 20:27:11,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:27:11,669 INFO L93 Difference]: Finished difference Result 6096 states and 27079 transitions. [2020-02-10 20:27:11,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:27:11,670 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:27:11,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:27:11,685 INFO L225 Difference]: With dead ends: 6096 [2020-02-10 20:27:11,685 INFO L226 Difference]: Without dead ends: 6071 [2020-02-10 20:27:11,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:27:11,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6071 states. [2020-02-10 20:27:11,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6071 to 3134. [2020-02-10 20:27:11,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3134 states. [2020-02-10 20:27:11,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3134 states to 3134 states and 15637 transitions. [2020-02-10 20:27:11,870 INFO L78 Accepts]: Start accepts. Automaton has 3134 states and 15637 transitions. Word has length 31 [2020-02-10 20:27:11,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:27:11,870 INFO L479 AbstractCegarLoop]: Abstraction has 3134 states and 15637 transitions. [2020-02-10 20:27:11,870 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:27:11,870 INFO L276 IsEmpty]: Start isEmpty. Operand 3134 states and 15637 transitions. [2020-02-10 20:27:11,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:27:11,875 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:27:11,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:27:11,876 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 20:27:11,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:27:11,876 INFO L82 PathProgramCache]: Analyzing trace with hash -884094838, now seen corresponding path program 15 times [2020-02-10 20:27:11,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:27:11,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235123286] [2020-02-10 20:27:11,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:27:11,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:27:12,426 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 31 [2020-02-10 20:27:12,551 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:27:12,683 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:27:12,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:27:12,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235123286] [2020-02-10 20:27:12,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:27:12,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:27:12,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722392931] [2020-02-10 20:27:12,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:27:12,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:27:12,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:27:12,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:27:12,695 INFO L87 Difference]: Start difference. First operand 3134 states and 15637 transitions. Second operand 12 states. [2020-02-10 20:27:12,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:27:12,994 INFO L93 Difference]: Finished difference Result 6103 states and 27093 transitions. [2020-02-10 20:27:12,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:27:12,994 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:27:12,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:27:13,008 INFO L225 Difference]: With dead ends: 6103 [2020-02-10 20:27:13,009 INFO L226 Difference]: Without dead ends: 6084 [2020-02-10 20:27:13,009 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:27:13,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6084 states. [2020-02-10 20:27:13,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6084 to 3143. [2020-02-10 20:27:13,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3143 states. [2020-02-10 20:27:13,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3143 states to 3143 states and 15654 transitions. [2020-02-10 20:27:13,200 INFO L78 Accepts]: Start accepts. Automaton has 3143 states and 15654 transitions. Word has length 31 [2020-02-10 20:27:13,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:27:13,200 INFO L479 AbstractCegarLoop]: Abstraction has 3143 states and 15654 transitions. [2020-02-10 20:27:13,200 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:27:13,200 INFO L276 IsEmpty]: Start isEmpty. Operand 3143 states and 15654 transitions. [2020-02-10 20:27:13,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:27:13,205 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:27:13,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:27:13,206 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 20:27:13,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:27:13,206 INFO L82 PathProgramCache]: Analyzing trace with hash -813984802, now seen corresponding path program 16 times [2020-02-10 20:27:13,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:27:13,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305151735] [2020-02-10 20:27:13,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:27:13,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:27:13,782 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 36 [2020-02-10 20:27:13,913 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:27:13,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:27:13,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305151735] [2020-02-10 20:27:13,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:27:13,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:27:13,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619804852] [2020-02-10 20:27:13,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:27:13,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:27:13,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:27:13,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:27:13,925 INFO L87 Difference]: Start difference. First operand 3143 states and 15654 transitions. Second operand 12 states. [2020-02-10 20:27:14,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:27:14,173 INFO L93 Difference]: Finished difference Result 6106 states and 27090 transitions. [2020-02-10 20:27:14,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:27:14,174 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:27:14,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:27:14,188 INFO L225 Difference]: With dead ends: 6106 [2020-02-10 20:27:14,188 INFO L226 Difference]: Without dead ends: 6075 [2020-02-10 20:27:14,188 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:27:14,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6075 states. [2020-02-10 20:27:14,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6075 to 3134. [2020-02-10 20:27:14,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3134 states. [2020-02-10 20:27:14,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3134 states to 3134 states and 15629 transitions. [2020-02-10 20:27:14,373 INFO L78 Accepts]: Start accepts. Automaton has 3134 states and 15629 transitions. Word has length 31 [2020-02-10 20:27:14,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:27:14,373 INFO L479 AbstractCegarLoop]: Abstraction has 3134 states and 15629 transitions. [2020-02-10 20:27:14,373 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:27:14,373 INFO L276 IsEmpty]: Start isEmpty. Operand 3134 states and 15629 transitions. [2020-02-10 20:27:14,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:27:14,378 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:27:14,378 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:27:14,379 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 20:27:14,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:27:14,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1031616950, now seen corresponding path program 17 times [2020-02-10 20:27:14,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:27:14,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863003234] [2020-02-10 20:27:14,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:27:14,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:27:15,022 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:27:15,153 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:27:15,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:27:15,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863003234] [2020-02-10 20:27:15,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:27:15,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:27:15,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627203072] [2020-02-10 20:27:15,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:27:15,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:27:15,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:27:15,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:27:15,164 INFO L87 Difference]: Start difference. First operand 3134 states and 15629 transitions. Second operand 12 states. [2020-02-10 20:27:15,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:27:15,390 INFO L93 Difference]: Finished difference Result 6100 states and 27078 transitions. [2020-02-10 20:27:15,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:27:15,391 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:27:15,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:27:15,406 INFO L225 Difference]: With dead ends: 6100 [2020-02-10 20:27:15,406 INFO L226 Difference]: Without dead ends: 6082 [2020-02-10 20:27:15,406 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:27:15,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6082 states. [2020-02-10 20:27:15,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6082 to 3142. [2020-02-10 20:27:15,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3142 states. [2020-02-10 20:27:15,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3142 states to 3142 states and 15644 transitions. [2020-02-10 20:27:15,595 INFO L78 Accepts]: Start accepts. Automaton has 3142 states and 15644 transitions. Word has length 31 [2020-02-10 20:27:15,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:27:15,596 INFO L479 AbstractCegarLoop]: Abstraction has 3142 states and 15644 transitions. [2020-02-10 20:27:15,596 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:27:15,596 INFO L276 IsEmpty]: Start isEmpty. Operand 3142 states and 15644 transitions. [2020-02-10 20:27:15,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:27:15,601 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:27:15,601 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:27:15,602 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 20:27:15,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:27:15,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1995893168, now seen corresponding path program 18 times [2020-02-10 20:27:15,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:27:15,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118732686] [2020-02-10 20:27:15,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:27:15,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:27:16,205 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 35 [2020-02-10 20:27:16,339 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:27:16,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:27:16,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118732686] [2020-02-10 20:27:16,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:27:16,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:27:16,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938099104] [2020-02-10 20:27:16,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:27:16,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:27:16,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:27:16,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:27:16,350 INFO L87 Difference]: Start difference. First operand 3142 states and 15644 transitions. Second operand 12 states. [2020-02-10 20:27:16,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:27:16,539 INFO L93 Difference]: Finished difference Result 6104 states and 27078 transitions. [2020-02-10 20:27:16,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:27:16,540 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:27:16,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:27:16,555 INFO L225 Difference]: With dead ends: 6104 [2020-02-10 20:27:16,555 INFO L226 Difference]: Without dead ends: 6066 [2020-02-10 20:27:16,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:27:16,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6066 states. [2020-02-10 20:27:16,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6066 to 3126. [2020-02-10 20:27:16,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 20:27:16,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15606 transitions. [2020-02-10 20:27:16,742 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15606 transitions. Word has length 31 [2020-02-10 20:27:16,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:27:16,742 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15606 transitions. [2020-02-10 20:27:16,742 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:27:16,742 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15606 transitions. [2020-02-10 20:27:16,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:27:16,747 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:27:16,748 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:27:16,748 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 20:27:16,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:27:16,748 INFO L82 PathProgramCache]: Analyzing trace with hash -407188010, now seen corresponding path program 19 times [2020-02-10 20:27:16,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:27:16,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490771325] [2020-02-10 20:27:16,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:27:16,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:27:17,325 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:27:17,458 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:27:17,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:27:17,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490771325] [2020-02-10 20:27:17,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:27:17,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:27:17,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539776259] [2020-02-10 20:27:17,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:27:17,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:27:17,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:27:17,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:27:17,470 INFO L87 Difference]: Start difference. First operand 3126 states and 15606 transitions. Second operand 12 states. [2020-02-10 20:27:17,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:27:17,695 INFO L93 Difference]: Finished difference Result 6103 states and 27092 transitions. [2020-02-10 20:27:17,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:27:17,695 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:27:17,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:27:17,710 INFO L225 Difference]: With dead ends: 6103 [2020-02-10 20:27:17,710 INFO L226 Difference]: Without dead ends: 6083 [2020-02-10 20:27: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:27:17,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6083 states. [2020-02-10 20:27:17,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6083 to 3142. [2020-02-10 20:27:17,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3142 states. [2020-02-10 20:27:17,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3142 states to 3142 states and 15651 transitions. [2020-02-10 20:27:17,977 INFO L78 Accepts]: Start accepts. Automaton has 3142 states and 15651 transitions. Word has length 31 [2020-02-10 20:27:17,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:27:17,978 INFO L479 AbstractCegarLoop]: Abstraction has 3142 states and 15651 transitions. [2020-02-10 20:27:17,978 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:27:17,978 INFO L276 IsEmpty]: Start isEmpty. Operand 3142 states and 15651 transitions. [2020-02-10 20:27:17,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:27:17,983 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:27:17,983 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:27:17,983 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 20:27:17,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:27:17,983 INFO L82 PathProgramCache]: Analyzing trace with hash -2097130914, now seen corresponding path program 20 times [2020-02-10 20:27:17,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:27:17,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830853105] [2020-02-10 20:27:17,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:27:17,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:27:18,541 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 30 [2020-02-10 20:27:18,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:27:18,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830853105] [2020-02-10 20:27:18,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:27:18,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:27:18,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273399627] [2020-02-10 20:27:18,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:27:18,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:27:18,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:27:18,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:27:18,798 INFO L87 Difference]: Start difference. First operand 3142 states and 15651 transitions. Second operand 12 states. [2020-02-10 20:27:19,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:27:19,015 INFO L93 Difference]: Finished difference Result 6101 states and 27081 transitions. [2020-02-10 20:27:19,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:27:19,015 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:27:19,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:27:19,033 INFO L225 Difference]: With dead ends: 6101 [2020-02-10 20:27:19,033 INFO L226 Difference]: Without dead ends: 6076 [2020-02-10 20:27:19,035 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:27:19,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6076 states. [2020-02-10 20:27:19,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6076 to 3135. [2020-02-10 20:27:19,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2020-02-10 20:27:19,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 15631 transitions. [2020-02-10 20:27:19,229 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 15631 transitions. Word has length 31 [2020-02-10 20:27:19,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:27:19,229 INFO L479 AbstractCegarLoop]: Abstraction has 3135 states and 15631 transitions. [2020-02-10 20:27:19,230 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:27:19,230 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 15631 transitions. [2020-02-10 20:27:19,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:27:19,235 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:27:19,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:27:19,235 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 20:27:19,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:27:19,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1043654864, now seen corresponding path program 21 times [2020-02-10 20:27:19,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:27:19,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890927547] [2020-02-10 20:27:19,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:27:19,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:27:19,822 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:27:19,957 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:27:19,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:27:19,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890927547] [2020-02-10 20:27:19,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:27:19,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:27:19,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612090747] [2020-02-10 20:27:19,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:27:19,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:27:19,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:27:19,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:27:19,969 INFO L87 Difference]: Start difference. First operand 3135 states and 15631 transitions. Second operand 12 states. [2020-02-10 20:27:20,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:27:20,202 INFO L93 Difference]: Finished difference Result 6111 states and 27101 transitions. [2020-02-10 20:27:20,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:27:20,202 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:27:20,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:27:20,219 INFO L225 Difference]: With dead ends: 6111 [2020-02-10 20:27:20,219 INFO L226 Difference]: Without dead ends: 6091 [2020-02-10 20:27:20,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:27:20,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6091 states. [2020-02-10 20:27:20,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6091 to 3146. [2020-02-10 20:27:20,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3146 states. [2020-02-10 20:27:20,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3146 states to 3146 states and 15651 transitions. [2020-02-10 20:27:20,524 INFO L78 Accepts]: Start accepts. Automaton has 3146 states and 15651 transitions. Word has length 31 [2020-02-10 20:27:20,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:27:20,525 INFO L479 AbstractCegarLoop]: Abstraction has 3146 states and 15651 transitions. [2020-02-10 20:27:20,525 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:27:20,525 INFO L276 IsEmpty]: Start isEmpty. Operand 3146 states and 15651 transitions. [2020-02-10 20:27:20,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:27:20,532 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:27:20,532 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:27:20,533 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 20:27:20,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:27:20,533 INFO L82 PathProgramCache]: Analyzing trace with hash 293912350, now seen corresponding path program 22 times [2020-02-10 20:27:20,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:27:20,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169134000] [2020-02-10 20:27:20,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:27:20,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:27:21,130 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:27:21,259 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:27:21,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:27:21,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169134000] [2020-02-10 20:27:21,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:27:21,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:27:21,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655920468] [2020-02-10 20:27:21,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:27:21,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:27:21,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:27:21,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:27:21,270 INFO L87 Difference]: Start difference. First operand 3146 states and 15651 transitions. Second operand 12 states. [2020-02-10 20:27:21,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:27:21,466 INFO L93 Difference]: Finished difference Result 6113 states and 27095 transitions. [2020-02-10 20:27:21,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:27:21,466 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:27:21,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:27:21,481 INFO L225 Difference]: With dead ends: 6113 [2020-02-10 20:27:21,481 INFO L226 Difference]: Without dead ends: 6080 [2020-02-10 20:27:21,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:27:21,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6080 states. [2020-02-10 20:27:21,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6080 to 3135. [2020-02-10 20:27:21,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2020-02-10 20:27:21,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 15622 transitions. [2020-02-10 20:27:21,670 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 15622 transitions. Word has length 31 [2020-02-10 20:27:21,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:27:21,671 INFO L479 AbstractCegarLoop]: Abstraction has 3135 states and 15622 transitions. [2020-02-10 20:27:21,671 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:27:21,671 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 15622 transitions. [2020-02-10 20:27:21,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:27:21,676 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:27:21,676 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:27:21,676 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 20:27:21,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:27:21,677 INFO L82 PathProgramCache]: Analyzing trace with hash 712747056, now seen corresponding path program 23 times [2020-02-10 20:27:21,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:27:21,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456694458] [2020-02-10 20:27:21,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:27:21,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:27:22,284 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:27:22,416 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:27:22,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:27:22,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456694458] [2020-02-10 20:27:22,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:27:22,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:27:22,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252611878] [2020-02-10 20:27:22,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:27:22,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:27:22,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:27:22,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:27:22,428 INFO L87 Difference]: Start difference. First operand 3135 states and 15622 transitions. Second operand 12 states. [2020-02-10 20:27:22,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:27:22,660 INFO L93 Difference]: Finished difference Result 6104 states and 27077 transitions. [2020-02-10 20:27:22,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:27:22,661 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:27:22,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:27:22,676 INFO L225 Difference]: With dead ends: 6104 [2020-02-10 20:27:22,676 INFO L226 Difference]: Without dead ends: 6086 [2020-02-10 20:27:22,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:27:22,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6086 states. [2020-02-10 20:27:22,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6086 to 3143. [2020-02-10 20:27:22,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3143 states. [2020-02-10 20:27:22,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3143 states to 3143 states and 15637 transitions. [2020-02-10 20:27:22,866 INFO L78 Accepts]: Start accepts. Automaton has 3143 states and 15637 transitions. Word has length 31 [2020-02-10 20:27:22,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:27:22,866 INFO L479 AbstractCegarLoop]: Abstraction has 3143 states and 15637 transitions. [2020-02-10 20:27:22,867 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:27:22,867 INFO L276 IsEmpty]: Start isEmpty. Operand 3143 states and 15637 transitions. [2020-02-10 20:27:22,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:27:22,872 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:27:22,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:27:22,872 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 20:27:22,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:27:22,872 INFO L82 PathProgramCache]: Analyzing trace with hash -554710122, now seen corresponding path program 24 times [2020-02-10 20:27:22,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:27:22,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908257554] [2020-02-10 20:27:22,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:27:22,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:27:23,479 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 20:27:23,610 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:27:23,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:27:23,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908257554] [2020-02-10 20:27:23,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:27:23,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:27:23,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871417589] [2020-02-10 20:27:23,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:27:23,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:27:23,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:27:23,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:27:23,621 INFO L87 Difference]: Start difference. First operand 3143 states and 15637 transitions. Second operand 12 states. [2020-02-10 20:27:23,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:27:23,818 INFO L93 Difference]: Finished difference Result 6108 states and 27077 transitions. [2020-02-10 20:27:23,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:27:23,818 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:27:23,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:27:23,912 INFO L225 Difference]: With dead ends: 6108 [2020-02-10 20:27:23,912 INFO L226 Difference]: Without dead ends: 6058 [2020-02-10 20:27:23,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:27:24,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6058 states. [2020-02-10 20:27:24,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6058 to 3115. [2020-02-10 20:27:24,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3115 states. [2020-02-10 20:27:24,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3115 states to 3115 states and 15577 transitions. [2020-02-10 20:27:24,099 INFO L78 Accepts]: Start accepts. Automaton has 3115 states and 15577 transitions. Word has length 31 [2020-02-10 20:27:24,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:27:24,099 INFO L479 AbstractCegarLoop]: Abstraction has 3115 states and 15577 transitions. [2020-02-10 20:27:24,099 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:27:24,099 INFO L276 IsEmpty]: Start isEmpty. Operand 3115 states and 15577 transitions. [2020-02-10 20:27:24,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:27:24,107 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:27:24,107 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:27:24,107 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 20:27:24,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:27:24,108 INFO L82 PathProgramCache]: Analyzing trace with hash -365158536, now seen corresponding path program 25 times [2020-02-10 20:27:24,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:27:24,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363943544] [2020-02-10 20:27:24,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:27:24,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:27:24,680 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:27:24,812 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:27:24,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:27:24,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363943544] [2020-02-10 20:27:24,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:27:24,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:27:24,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491212131] [2020-02-10 20:27:24,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:27:24,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:27:24,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:27:24,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:27:24,823 INFO L87 Difference]: Start difference. First operand 3115 states and 15577 transitions. Second operand 12 states. [2020-02-10 20:27:25,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:27:25,060 INFO L93 Difference]: Finished difference Result 6061 states and 27001 transitions. [2020-02-10 20:27:25,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:27:25,060 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:27:25,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:27:25,075 INFO L225 Difference]: With dead ends: 6061 [2020-02-10 20:27:25,075 INFO L226 Difference]: Without dead ends: 6042 [2020-02-10 20:27:25,076 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:27:25,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6042 states. [2020-02-10 20:27:25,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6042 to 3135. [2020-02-10 20:27:25,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2020-02-10 20:27:25,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 15644 transitions. [2020-02-10 20:27:25,266 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 15644 transitions. Word has length 31 [2020-02-10 20:27:25,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:27:25,267 INFO L479 AbstractCegarLoop]: Abstraction has 3135 states and 15644 transitions. [2020-02-10 20:27:25,267 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:27:25,267 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 15644 transitions. [2020-02-10 20:27:25,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:27:25,272 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:27:25,272 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:27:25,272 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 20:27:25,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:27:25,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1632615714, now seen corresponding path program 26 times [2020-02-10 20:27:25,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:27:25,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642146740] [2020-02-10 20:27:25,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:27:25,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:27:25,846 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:27:25,976 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:27:25,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:27:25,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642146740] [2020-02-10 20:27:25,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:27:25,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:27:25,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827392383] [2020-02-10 20:27:25,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:27:25,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:27:25,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:27:25,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:27:25,987 INFO L87 Difference]: Start difference. First operand 3135 states and 15644 transitions. Second operand 12 states. [2020-02-10 20:27:26,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:27:26,245 INFO L93 Difference]: Finished difference Result 6062 states and 26995 transitions. [2020-02-10 20:27:26,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:27:26,246 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:27:26,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:27:26,261 INFO L225 Difference]: With dead ends: 6062 [2020-02-10 20:27:26,261 INFO L226 Difference]: Without dead ends: 6034 [2020-02-10 20:27:26,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:27:26,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6034 states. [2020-02-10 20:27:26,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6034 to 3127. [2020-02-10 20:27:26,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:27:26,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15623 transitions. [2020-02-10 20:27:26,444 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15623 transitions. Word has length 31 [2020-02-10 20:27:26,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:27:26,444 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15623 transitions. [2020-02-10 20:27:26,444 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:27:26,445 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15623 transitions. [2020-02-10 20:27:26,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:27:26,449 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:27:26,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:27:26,450 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 20:27:26,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:27:26,450 INFO L82 PathProgramCache]: Analyzing trace with hash -789469772, now seen corresponding path program 27 times [2020-02-10 20:27:26,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:27:26,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003891470] [2020-02-10 20:27:26,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:27:26,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:27:27,029 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:27:27,157 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:27:27,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:27:27,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003891470] [2020-02-10 20:27:27,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:27:27,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:27:27,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466717302] [2020-02-10 20:27:27,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:27:27,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:27:27,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:27:27,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:27:27,168 INFO L87 Difference]: Start difference. First operand 3127 states and 15623 transitions. Second operand 12 states. [2020-02-10 20:27:27,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:27:27,405 INFO L93 Difference]: Finished difference Result 6056 states and 26983 transitions. [2020-02-10 20:27:27,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:27:27,405 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:27:27,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:27:27,420 INFO L225 Difference]: With dead ends: 6056 [2020-02-10 20:27:27,420 INFO L226 Difference]: Without dead ends: 6037 [2020-02-10 20:27:27,421 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:27:27,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6037 states. [2020-02-10 20:27:27,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6037 to 3133. [2020-02-10 20:27:27,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-02-10 20:27:27,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15634 transitions. [2020-02-10 20:27:27,611 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15634 transitions. Word has length 31 [2020-02-10 20:27:27,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:27:27,611 INFO L479 AbstractCegarLoop]: Abstraction has 3133 states and 15634 transitions. [2020-02-10 20:27:27,611 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:27:27,611 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15634 transitions. [2020-02-10 20:27:27,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:27:27,616 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:27:27,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:27:27,616 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 20:27:27,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:27:27,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1393068894, now seen corresponding path program 28 times [2020-02-10 20:27:27,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:27:27,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694952276] [2020-02-10 20:27:27,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:27:27,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:27:28,182 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:27:28,319 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 20:27:28,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:27:28,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694952276] [2020-02-10 20:27:28,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:27:28,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:27:28,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875863270] [2020-02-10 20:27:28,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:27:28,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:27:28,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:27:28,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:27:28,330 INFO L87 Difference]: Start difference. First operand 3133 states and 15634 transitions. Second operand 12 states. [2020-02-10 20:27:28,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:27:28,575 INFO L93 Difference]: Finished difference Result 6054 states and 26973 transitions. [2020-02-10 20:27:28,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:27:28,576 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:27:28,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:27:28,591 INFO L225 Difference]: With dead ends: 6054 [2020-02-10 20:27:28,591 INFO L226 Difference]: Without dead ends: 6031 [2020-02-10 20:27:28,591 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:27:28,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6031 states. [2020-02-10 20:27:28,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6031 to 3127. [2020-02-10 20:27:28,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:27:28,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15617 transitions. [2020-02-10 20:27:28,775 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15617 transitions. Word has length 31 [2020-02-10 20:27:28,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:27:28,775 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15617 transitions. [2020-02-10 20:27:28,775 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:27:28,775 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15617 transitions. [2020-02-10 20:27:28,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:27:28,780 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:27:28,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:27:28,781 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 20:27:28,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:27:28,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1601573492, now seen corresponding path program 29 times [2020-02-10 20:27:28,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:27:28,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348764479] [2020-02-10 20:27:28,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:27:28,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:27:29,356 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:27:29,497 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:27:29,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:27:29,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348764479] [2020-02-10 20:27:29,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:27:29,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:27:29,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661299656] [2020-02-10 20:27:29,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:27:29,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:27:29,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:27:29,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:27:29,508 INFO L87 Difference]: Start difference. First operand 3127 states and 15617 transitions. Second operand 12 states. [2020-02-10 20:27:29,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:27:29,825 INFO L93 Difference]: Finished difference Result 6058 states and 26981 transitions. [2020-02-10 20:27:29,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:27:29,825 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:27:29,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:27:29,840 INFO L225 Difference]: With dead ends: 6058 [2020-02-10 20:27:29,840 INFO L226 Difference]: Without dead ends: 6038 [2020-02-10 20:27:29,841 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:27:29,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6038 states. [2020-02-10 20:27:30,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6038 to 3133. [2020-02-10 20:27:30,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-02-10 20:27:30,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15628 transitions. [2020-02-10 20:27:30,030 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15628 transitions. Word has length 31 [2020-02-10 20:27:30,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:27:30,031 INFO L479 AbstractCegarLoop]: Abstraction has 3133 states and 15628 transitions. [2020-02-10 20:27:30,031 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:27:30,031 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15628 transitions. [2020-02-10 20:27:30,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:27:30,038 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:27:30,038 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:27:30,038 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 20:27:30,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:27:30,039 INFO L82 PathProgramCache]: Analyzing trace with hash 756602040, now seen corresponding path program 30 times [2020-02-10 20:27:30,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:27:30,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676458793] [2020-02-10 20:27:30,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:27:30,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:27:30,639 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:27:30,772 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:27:30,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:27:30,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676458793] [2020-02-10 20:27:30,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:27:30,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:27:30,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21097880] [2020-02-10 20:27:30,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:27:30,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:27:30,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:27:30,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:27:30,783 INFO L87 Difference]: Start difference. First operand 3133 states and 15628 transitions. Second operand 12 states. [2020-02-10 20:27:31,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:27:31,070 INFO L93 Difference]: Finished difference Result 6055 states and 26969 transitions. [2020-02-10 20:27:31,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:27:31,071 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:27:31,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:27:31,085 INFO L225 Difference]: With dead ends: 6055 [2020-02-10 20:27:31,085 INFO L226 Difference]: Without dead ends: 6026 [2020-02-10 20:27:31,085 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:27:31,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6026 states. [2020-02-10 20:27:31,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6026 to 3121. [2020-02-10 20:27:31,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 20:27:31,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15600 transitions. [2020-02-10 20:27:31,274 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15600 transitions. Word has length 31 [2020-02-10 20:27:31,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:27:31,274 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15600 transitions. [2020-02-10 20:27:31,274 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:27:31,275 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15600 transitions. [2020-02-10 20:27:31,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:27:31,280 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:27:31,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:27:31,280 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 20:27:31,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:27:31,281 INFO L82 PathProgramCache]: Analyzing trace with hash -633904964, now seen corresponding path program 31 times [2020-02-10 20:27:31,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:27:31,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584737516] [2020-02-10 20:27:31,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:27:31,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:27:31,985 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:27:31,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:27:31,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584737516] [2020-02-10 20:27:31,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:27:31,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:27:31,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270268632] [2020-02-10 20:27:31,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:27:31,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:27:31,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:27:31,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:27:31,996 INFO L87 Difference]: Start difference. First operand 3121 states and 15600 transitions. Second operand 12 states. [2020-02-10 20:27:32,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:27:32,231 INFO L93 Difference]: Finished difference Result 6065 states and 27007 transitions. [2020-02-10 20:27:32,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:27:32,232 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:27:32,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:27:32,247 INFO L225 Difference]: With dead ends: 6065 [2020-02-10 20:27:32,247 INFO L226 Difference]: Without dead ends: 6046 [2020-02-10 20:27:32,247 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:27:32,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6046 states. [2020-02-10 20:27:32,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6046 to 3136. [2020-02-10 20:27:32,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3136 states. [2020-02-10 20:27:32,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3136 states to 3136 states and 15642 transitions. [2020-02-10 20:27:32,432 INFO L78 Accepts]: Start accepts. Automaton has 3136 states and 15642 transitions. Word has length 31 [2020-02-10 20:27:32,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:27:32,432 INFO L479 AbstractCegarLoop]: Abstraction has 3136 states and 15642 transitions. [2020-02-10 20:27:32,432 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:27:32,432 INFO L276 IsEmpty]: Start isEmpty. Operand 3136 states and 15642 transitions. [2020-02-10 20:27:32,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:27:32,437 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:27:32,437 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:27:32,437 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 20:27:32,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:27:32,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1901362142, now seen corresponding path program 32 times [2020-02-10 20:27:32,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:27:32,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378271540] [2020-02-10 20:27:32,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:27:32,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:27:33,054 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:27:33,187 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:27:33,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:27:33,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378271540] [2020-02-10 20:27:33,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:27:33,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:27:33,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448920021] [2020-02-10 20:27:33,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:27:33,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:27:33,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:27:33,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:27:33,198 INFO L87 Difference]: Start difference. First operand 3136 states and 15642 transitions. Second operand 12 states. [2020-02-10 20:27:33,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:27:33,443 INFO L93 Difference]: Finished difference Result 6066 states and 27001 transitions. [2020-02-10 20:27:33,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:27:33,444 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:27:33,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:27:33,459 INFO L225 Difference]: With dead ends: 6066 [2020-02-10 20:27:33,459 INFO L226 Difference]: Without dead ends: 6038 [2020-02-10 20:27:33,459 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:27:33,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6038 states. [2020-02-10 20:27:33,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6038 to 3128. [2020-02-10 20:27:33,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 20:27:33,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15620 transitions. [2020-02-10 20:27:33,652 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15620 transitions. Word has length 31 [2020-02-10 20:27:33,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:27:33,652 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15620 transitions. [2020-02-10 20:27:33,652 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:27:33,652 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15620 transitions. [2020-02-10 20:27:33,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:27:33,657 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:27:33,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:27:33,657 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 20:27:33,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:27:33,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1482527436, now seen corresponding path program 33 times [2020-02-10 20:27:33,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:27:33,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747506524] [2020-02-10 20:27:33,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:27:33,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:27:34,229 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 20:27:34,360 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 37 [2020-02-10 20:27:34,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:27:34,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747506524] [2020-02-10 20:27:34,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:27:34,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:27:34,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236896486] [2020-02-10 20:27:34,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:27:34,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:27:34,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:27:34,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:27:34,371 INFO L87 Difference]: Start difference. First operand 3128 states and 15620 transitions. Second operand 12 states. [2020-02-10 20:27:34,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:27:34,614 INFO L93 Difference]: Finished difference Result 6062 states and 26993 transitions. [2020-02-10 20:27:34,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:27:34,615 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:27:34,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:27:34,630 INFO L225 Difference]: With dead ends: 6062 [2020-02-10 20:27:34,630 INFO L226 Difference]: Without dead ends: 6043 [2020-02-10 20:27:34,630 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:27:34,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6043 states. [2020-02-10 20:27:34,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6043 to 3135. [2020-02-10 20:27:34,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2020-02-10 20:27:34,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 15633 transitions. [2020-02-10 20:27:34,818 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 15633 transitions. Word has length 31 [2020-02-10 20:27:34,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:27:34,819 INFO L479 AbstractCegarLoop]: Abstraction has 3135 states and 15633 transitions. [2020-02-10 20:27:34,819 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:27:34,819 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 15633 transitions. [2020-02-10 20:27:34,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:27:34,824 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:27:34,824 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:27:34,824 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 20:27:34,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:27:34,825 INFO L82 PathProgramCache]: Analyzing trace with hash -144960222, now seen corresponding path program 34 times [2020-02-10 20:27:34,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:27:34,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645503433] [2020-02-10 20:27:34,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:27:34,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:27:35,412 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:27:35,548 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:27:35,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:27:35,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645503433] [2020-02-10 20:27:35,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:27:35,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:27:35,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289112782] [2020-02-10 20:27:35,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:27:35,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:27:35,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:27:35,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:27:35,560 INFO L87 Difference]: Start difference. First operand 3135 states and 15633 transitions. Second operand 12 states. [2020-02-10 20:27:35,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:27:35,990 INFO L93 Difference]: Finished difference Result 6061 states and 26984 transitions. [2020-02-10 20:27:35,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:27:35,990 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:27:35,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:27:36,005 INFO L225 Difference]: With dead ends: 6061 [2020-02-10 20:27:36,006 INFO L226 Difference]: Without dead ends: 6036 [2020-02-10 20:27:36,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 20:27:36,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6036 states. [2020-02-10 20:27:36,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6036 to 3128. [2020-02-10 20:27:36,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 20:27:36,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15613 transitions. [2020-02-10 20:27:36,197 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15613 transitions. Word has length 31 [2020-02-10 20:27:36,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:27:36,197 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15613 transitions. [2020-02-10 20:27:36,197 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:27:36,198 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15613 transitions. [2020-02-10 20:27:36,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:27:36,203 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:27:36,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 20:27:36,203 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 20:27:36,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:27:36,204 INFO L82 PathProgramCache]: Analyzing trace with hash 908515828, now seen corresponding path program 35 times [2020-02-10 20:27:36,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:27:36,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100856795] [2020-02-10 20:27:36,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:27:36,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:27:36,786 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:27:36,922 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:27:36,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:27:36,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100856795] [2020-02-10 20:27:36,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:27:36,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:27:36,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101998113] [2020-02-10 20:27:36,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:27:36,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:27:36,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:27:36,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:27:36,934 INFO L87 Difference]: Start difference. First operand 3128 states and 15613 transitions. Second operand 12 states. [2020-02-10 20:27:37,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:27:37,188 INFO L93 Difference]: Finished difference Result 6064 states and 26990 transitions. [2020-02-10 20:27:37,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:27:37,188 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:27:37,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:27:37,202 INFO L225 Difference]: With dead ends: 6064 [2020-02-10 20:27:37,203 INFO L226 Difference]: Without dead ends: 6044 [2020-02-10 20:27:37,203 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:27:37,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6044 states. [2020-02-10 20:27:37,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6044 to 3135. [2020-02-10 20:27:37,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2020-02-10 20:27:37,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 15626 transitions. [2020-02-10 20:27:37,387 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 15626 transitions. Word has length 31 [2020-02-10 20:27:37,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:27:37,387 INFO L479 AbstractCegarLoop]: Abstraction has 3135 states and 15626 transitions. [2020-02-10 20:27:37,388 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:27:37,388 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 15626 transitions. [2020-02-10 20:27:37,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:27:37,393 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:27:37,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:27:37,393 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 20:27:37,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:27:37,393 INFO L82 PathProgramCache]: Analyzing trace with hash -781427076, now seen corresponding path program 36 times [2020-02-10 20:27:37,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:27:37,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665127159] [2020-02-10 20:27:37,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:27:37,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:27:37,952 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:27:38,088 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:27:38,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:27:38,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665127159] [2020-02-10 20:27:38,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:27:38,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:27:38,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927128304] [2020-02-10 20:27:38,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:27:38,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:27:38,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:27:38,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:27:38,098 INFO L87 Difference]: Start difference. First operand 3135 states and 15626 transitions. Second operand 12 states. [2020-02-10 20:27:38,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:27:38,350 INFO L93 Difference]: Finished difference Result 6062 states and 26979 transitions. [2020-02-10 20:27:38,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:27:38,351 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:27:38,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:27:38,364 INFO L225 Difference]: With dead ends: 6062 [2020-02-10 20:27:38,365 INFO L226 Difference]: Without dead ends: 6030 [2020-02-10 20:27:38,365 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:27:38,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6030 states. [2020-02-10 20:27:38,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6030 to 3121. [2020-02-10 20:27:38,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 20:27:38,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15594 transitions. [2020-02-10 20:27:38,548 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15594 transitions. Word has length 31 [2020-02-10 20:27:38,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:27:38,548 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15594 transitions. [2020-02-10 20:27:38,548 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:27:38,548 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15594 transitions. [2020-02-10 20:27:38,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:27:38,553 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:27:38,553 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:27:38,553 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 20:27:38,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:27:38,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1326962628, now seen corresponding path program 37 times [2020-02-10 20:27:38,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:27:38,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632862029] [2020-02-10 20:27:38,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:27:38,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:27:39,104 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:27:39,235 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:27:39,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:27:39,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632862029] [2020-02-10 20:27:39,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:27:39,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:27:39,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733395304] [2020-02-10 20:27:39,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:27:39,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:27:39,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:27:39,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:27:39,246 INFO L87 Difference]: Start difference. First operand 3121 states and 15594 transitions. Second operand 12 states. [2020-02-10 20:27:39,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:27:39,503 INFO L93 Difference]: Finished difference Result 6053 states and 26970 transitions. [2020-02-10 20:27:39,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:27:39,504 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:27:39,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:27:39,518 INFO L225 Difference]: With dead ends: 6053 [2020-02-10 20:27:39,518 INFO L226 Difference]: Without dead ends: 6034 [2020-02-10 20:27:39,518 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:27:39,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6034 states. [2020-02-10 20:27:39,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6034 to 3133. [2020-02-10 20:27:39,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-02-10 20:27:39,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15628 transitions. [2020-02-10 20:27:39,710 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15628 transitions. Word has length 31 [2020-02-10 20:27:39,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:27:39,710 INFO L479 AbstractCegarLoop]: Abstraction has 3133 states and 15628 transitions. [2020-02-10 20:27:39,710 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:27:39,711 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15628 transitions. [2020-02-10 20:27:39,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:27:39,716 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:27:39,716 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:27:39,716 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 20:27:39,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:27:39,716 INFO L82 PathProgramCache]: Analyzing trace with hash 855576038, now seen corresponding path program 38 times [2020-02-10 20:27:39,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:27:39,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648191925] [2020-02-10 20:27:39,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:27:39,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:27:40,484 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:27:40,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:27:40,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648191925] [2020-02-10 20:27:40,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:27:40,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:27:40,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987235619] [2020-02-10 20:27:40,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:27:40,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:27:40,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:27:40,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:27:40,495 INFO L87 Difference]: Start difference. First operand 3133 states and 15628 transitions. Second operand 12 states. [2020-02-10 20:27:40,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:27:40,764 INFO L93 Difference]: Finished difference Result 6051 states and 26960 transitions. [2020-02-10 20:27:40,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:27:40,764 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:27:40,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:27:40,779 INFO L225 Difference]: With dead ends: 6051 [2020-02-10 20:27:40,779 INFO L226 Difference]: Without dead ends: 6028 [2020-02-10 20:27:40,779 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:27:40,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6028 states. [2020-02-10 20:27:40,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6028 to 3127. [2020-02-10 20:27:40,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:27:40,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15611 transitions. [2020-02-10 20:27:40,969 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15611 transitions. Word has length 31 [2020-02-10 20:27:40,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:27:40,970 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15611 transitions. [2020-02-10 20:27:40,970 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:27:40,970 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15611 transitions. [2020-02-10 20:27:40,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:27:40,975 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:27:40,975 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:27:40,975 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 20:27:40,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:27:40,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1751273864, now seen corresponding path program 39 times [2020-02-10 20:27:40,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:27:40,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020628534] [2020-02-10 20:27:40,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:27:40,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:27:41,561 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:27:41,693 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:27:41,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:27:41,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020628534] [2020-02-10 20:27:41,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:27:41,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:27:41,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856854891] [2020-02-10 20:27:41,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:27:41,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:27:41,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:27:41,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:27:41,704 INFO L87 Difference]: Start difference. First operand 3127 states and 15611 transitions. Second operand 12 states. [2020-02-10 20:27:42,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:27:42,048 INFO L93 Difference]: Finished difference Result 6055 states and 26969 transitions. [2020-02-10 20:27:42,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:27:42,048 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:27:42,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:27:42,063 INFO L225 Difference]: With dead ends: 6055 [2020-02-10 20:27:42,063 INFO L226 Difference]: Without dead ends: 6036 [2020-02-10 20:27:42,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:27:42,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6036 states. [2020-02-10 20:27:42,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6036 to 3134. [2020-02-10 20:27:42,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3134 states. [2020-02-10 20:27:42,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3134 states to 3134 states and 15624 transitions. [2020-02-10 20:27:42,259 INFO L78 Accepts]: Start accepts. Automaton has 3134 states and 15624 transitions. Word has length 31 [2020-02-10 20:27:42,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:27:42,259 INFO L479 AbstractCegarLoop]: Abstraction has 3134 states and 15624 transitions. [2020-02-10 20:27:42,259 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:27:42,259 INFO L276 IsEmpty]: Start isEmpty. Operand 3134 states and 15624 transitions. [2020-02-10 20:27:42,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:27:42,264 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:27:42,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:27:42,264 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 20:27:42,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:27:42,265 INFO L82 PathProgramCache]: Analyzing trace with hash -413706650, now seen corresponding path program 40 times [2020-02-10 20:27:42,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:27:42,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945780883] [2020-02-10 20:27:42,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:27:42,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:27:43,043 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:27:43,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:27:43,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945780883] [2020-02-10 20:27:43,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:27:43,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:27:43,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049698742] [2020-02-10 20:27:43,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:27:43,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:27:43,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:27:43,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:27:43,054 INFO L87 Difference]: Start difference. First operand 3134 states and 15624 transitions. Second operand 12 states. [2020-02-10 20:27:43,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:27:43,321 INFO L93 Difference]: Finished difference Result 6054 states and 26960 transitions. [2020-02-10 20:27:43,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:27:43,322 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:27:43,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:27:43,337 INFO L225 Difference]: With dead ends: 6054 [2020-02-10 20:27:43,337 INFO L226 Difference]: Without dead ends: 6029 [2020-02-10 20:27:43,338 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:27:43,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6029 states. [2020-02-10 20:27:43,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6029 to 3127. [2020-02-10 20:27:43,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:27:43,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15605 transitions. [2020-02-10 20:27:43,522 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15605 transitions. Word has length 31 [2020-02-10 20:27:43,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:27:43,522 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15605 transitions. [2020-02-10 20:27:43,522 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:27:43,523 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15605 transitions. [2020-02-10 20:27:43,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:27:43,528 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:27:43,528 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:27:43,528 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 20:27:43,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:27:43,528 INFO L82 PathProgramCache]: Analyzing trace with hash -629513288, now seen corresponding path program 41 times [2020-02-10 20:27:43,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:27:43,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637239603] [2020-02-10 20:27:43,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:27:43,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:27:44,214 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:27:44,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:27:44,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637239603] [2020-02-10 20:27:44,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:27:44,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:27:44,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382117057] [2020-02-10 20:27:44,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:27:44,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:27:44,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:27:44,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:27:44,226 INFO L87 Difference]: Start difference. First operand 3127 states and 15605 transitions. Second operand 12 states. [2020-02-10 20:27:44,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:27:44,465 INFO L93 Difference]: Finished difference Result 6050 states and 26952 transitions. [2020-02-10 20:27:44,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:27:44,466 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:27:44,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:27:44,480 INFO L225 Difference]: With dead ends: 6050 [2020-02-10 20:27:44,480 INFO L226 Difference]: Without dead ends: 6033 [2020-02-10 20:27: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:27:44,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6033 states. [2020-02-10 20:27:44,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6033 to 3133. [2020-02-10 20:27:44,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-02-10 20:27:44,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15616 transitions. [2020-02-10 20:27:44,665 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15616 transitions. Word has length 31 [2020-02-10 20:27:44,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:27:44,665 INFO L479 AbstractCegarLoop]: Abstraction has 3133 states and 15616 transitions. [2020-02-10 20:27:44,666 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:27:44,666 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15616 transitions. [2020-02-10 20:27:44,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:27:44,671 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:27:44,671 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:27:44,671 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 20:27:44,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:27:44,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1474484740, now seen corresponding path program 42 times [2020-02-10 20:27:44,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:27:44,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468825281] [2020-02-10 20:27:44,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:27:44,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:27:45,229 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:27:45,360 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:27:45,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:27:45,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468825281] [2020-02-10 20:27:45,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:27:45,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:27:45,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813964848] [2020-02-10 20:27:45,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:27:45,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:27:45,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:27:45,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:27:45,371 INFO L87 Difference]: Start difference. First operand 3133 states and 15616 transitions. Second operand 12 states. [2020-02-10 20:27:45,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:27:45,647 INFO L93 Difference]: Finished difference Result 6051 states and 26948 transitions. [2020-02-10 20:27:45,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:27:45,647 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:27:45,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:27:45,662 INFO L225 Difference]: With dead ends: 6051 [2020-02-10 20:27:45,662 INFO L226 Difference]: Without dead ends: 6021 [2020-02-10 20:27:45,662 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:27:45,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6021 states. [2020-02-10 20:27:45,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6021 to 3121. [2020-02-10 20:27:45,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 20:27:45,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15588 transitions. [2020-02-10 20:27:45,851 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15588 transitions. Word has length 31 [2020-02-10 20:27:45,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:27:45,851 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15588 transitions. [2020-02-10 20:27:45,851 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:27:45,851 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15588 transitions. [2020-02-10 20:27:45,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:27:45,856 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:27:45,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:27:45,857 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 20:27:45,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:27:45,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1486522654, now seen corresponding path program 43 times [2020-02-10 20:27:45,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:27:45,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437930613] [2020-02-10 20:27:45,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:27:45,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:27:46,414 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:27:46,547 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:27:46,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 20:27:46,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437930613] [2020-02-10 20:27:46,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:27:46,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:27:46,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220423531] [2020-02-10 20:27:46,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:27:46,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:27:46,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:27:46,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:27:46,558 INFO L87 Difference]: Start difference. First operand 3121 states and 15588 transitions. Second operand 12 states. [2020-02-10 20:27:46,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:27:46,855 INFO L93 Difference]: Finished difference Result 6056 states and 26970 transitions. [2020-02-10 20:27:46,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:27:46,856 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:27:46,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:27:46,870 INFO L225 Difference]: With dead ends: 6056 [2020-02-10 20:27:46,870 INFO L226 Difference]: Without dead ends: 6036 [2020-02-10 20:27:46,871 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:27:47,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6036 states. [2020-02-10 20:27:47,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6036 to 3133. [2020-02-10 20:27:47,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-02-10 20:27:47,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15622 transitions. [2020-02-10 20:27:47,061 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15622 transitions. Word has length 31 [2020-02-10 20:27:47,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:27:47,062 INFO L479 AbstractCegarLoop]: Abstraction has 3133 states and 15622 transitions. [2020-02-10 20:27:47,062 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:27:47,062 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15622 transitions. [2020-02-10 20:27:47,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:27:47,067 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:27:47,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:27:47,067 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 20:27:47,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:27:47,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1963473190, now seen corresponding path program 44 times [2020-02-10 20:27:47,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:27:47,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472563346] [2020-02-10 20:27:47,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:27:47,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:27:47,624 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:27:47,753 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:27:47,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:27:47,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472563346] [2020-02-10 20:27:47,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:27:47,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:27:47,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746536684] [2020-02-10 20:27:47,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:27:47,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:27:47,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:27:47,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:27:47,763 INFO L87 Difference]: Start difference. First operand 3133 states and 15622 transitions. Second operand 12 states. [2020-02-10 20:27:48,113 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 35 [2020-02-10 20:27:48,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:27:48,136 INFO L93 Difference]: Finished difference Result 6053 states and 26958 transitions. [2020-02-10 20:27:48,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:27:48,137 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:27:48,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:27:48,152 INFO L225 Difference]: With dead ends: 6053 [2020-02-10 20:27:48,152 INFO L226 Difference]: Without dead ends: 6030 [2020-02-10 20:27:48,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 20:27:48,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6030 states. [2020-02-10 20:27:48,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6030 to 3127. [2020-02-10 20:27:48,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:27:48,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15605 transitions. [2020-02-10 20:27:48,336 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15605 transitions. Word has length 31 [2020-02-10 20:27:48,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:27:48,336 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15605 transitions. [2020-02-10 20:27:48,336 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:27:48,336 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15605 transitions. [2020-02-10 20:27:48,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:27:48,342 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:27:48,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:27:48,342 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 20:27:48,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:27:48,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1910833890, now seen corresponding path program 45 times [2020-02-10 20:27:48,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:27:48,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019830101] [2020-02-10 20:27:48,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:27:48,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:27:48,887 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:27:49,022 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:27:49,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:27:49,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019830101] [2020-02-10 20:27:49,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:27:49,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:27:49,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546948465] [2020-02-10 20:27:49,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:27:49,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:27:49,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:27:49,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:27:49,033 INFO L87 Difference]: Start difference. First operand 3127 states and 15605 transitions. Second operand 12 states. [2020-02-10 20:27:49,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:27:49,350 INFO L93 Difference]: Finished difference Result 6058 states and 26969 transitions. [2020-02-10 20:27:49,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:27:49,350 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:27:49,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:27:49,364 INFO L225 Difference]: With dead ends: 6058 [2020-02-10 20:27:49,364 INFO L226 Difference]: Without dead ends: 6038 [2020-02-10 20:27:49,364 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:27:49,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6038 states. [2020-02-10 20:27:49,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6038 to 3134. [2020-02-10 20:27:49,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3134 states. [2020-02-10 20:27:49,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3134 states to 3134 states and 15618 transitions. [2020-02-10 20:27:49,553 INFO L78 Accepts]: Start accepts. Automaton has 3134 states and 15618 transitions. Word has length 31 [2020-02-10 20:27:49,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:27:49,553 INFO L479 AbstractCegarLoop]: Abstraction has 3134 states and 15618 transitions. [2020-02-10 20:27:49,553 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:27:49,554 INFO L276 IsEmpty]: Start isEmpty. Operand 3134 states and 15618 transitions. [2020-02-10 20:27:49,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:27:49,559 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:27:49,559 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:27:49,559 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 20:27:49,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:27:49,559 INFO L82 PathProgramCache]: Analyzing trace with hash 694190502, now seen corresponding path program 46 times [2020-02-10 20:27:49,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:27:49,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67757019] [2020-02-10 20:27:49,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:27:49,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:27:50,117 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:27:50,249 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:27:50,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:27:50,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67757019] [2020-02-10 20:27:50,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:27:50,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:27:50,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310342945] [2020-02-10 20:27:50,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:27:50,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:27:50,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:27:50,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:27:50,260 INFO L87 Difference]: Start difference. First operand 3134 states and 15618 transitions. Second operand 12 states. [2020-02-10 20:27:50,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:27:50,506 INFO L93 Difference]: Finished difference Result 6056 states and 26958 transitions. [2020-02-10 20:27:50,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:27:50,507 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:27:50,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:27:50,522 INFO L225 Difference]: With dead ends: 6056 [2020-02-10 20:27:50,522 INFO L226 Difference]: Without dead ends: 6031 [2020-02-10 20:27:50,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:27:50,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6031 states. [2020-02-10 20:27:50,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6031 to 3127. [2020-02-10 20:27:50,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:27:50,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15599 transitions. [2020-02-10 20:27:50,712 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15599 transitions. Word has length 31 [2020-02-10 20:27:50,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:27:50,712 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15599 transitions. [2020-02-10 20:27:50,712 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:27:50,712 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15599 transitions. [2020-02-10 20:27:50,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:27:50,718 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:27:50,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:27:50,718 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 20:27:50,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:27:50,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1114850718, now seen corresponding path program 47 times [2020-02-10 20:27:50,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:27:50,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636600795] [2020-02-10 20:27:50,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:27:50,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:27:51,410 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:27:51,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:27:51,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636600795] [2020-02-10 20:27:51,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:27:51,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:27:51,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703040790] [2020-02-10 20:27:51,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:27:51,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:27:51,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:27:51,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:27:51,421 INFO L87 Difference]: Start difference. First operand 3127 states and 15599 transitions. Second operand 12 states. [2020-02-10 20:27:51,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:27:51,741 INFO L93 Difference]: Finished difference Result 6051 states and 26948 transitions. [2020-02-10 20:27:51,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:27:51,742 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:27:51,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:27:51,759 INFO L225 Difference]: With dead ends: 6051 [2020-02-10 20:27:51,759 INFO L226 Difference]: Without dead ends: 6034 [2020-02-10 20:27:51,760 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:27:51,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6034 states. [2020-02-10 20:27:51,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6034 to 3133. [2020-02-10 20:27:51,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-02-10 20:27:51,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15610 transitions. [2020-02-10 20:27:51,966 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15610 transitions. Word has length 31 [2020-02-10 20:27:51,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:27:51,967 INFO L479 AbstractCegarLoop]: Abstraction has 3133 states and 15610 transitions. [2020-02-10 20:27:51,967 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:27:51,967 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15610 transitions. [2020-02-10 20:27:51,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:27:51,972 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:27:51,972 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:27:51,972 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 20:27:51,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:27:51,972 INFO L82 PathProgramCache]: Analyzing trace with hash 269879266, now seen corresponding path program 48 times [2020-02-10 20:27:51,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:27:51,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977849627] [2020-02-10 20:27:51,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:27:51,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:27:52,578 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:27:52,710 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:27:52,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:27:52,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977849627] [2020-02-10 20:27:52,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:27:52,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:27:52,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279545161] [2020-02-10 20:27:52,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:27:52,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:27:52,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:27:52,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:27:52,720 INFO L87 Difference]: Start difference. First operand 3133 states and 15610 transitions. Second operand 12 states. [2020-02-10 20:27:52,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:27:52,983 INFO L93 Difference]: Finished difference Result 6052 states and 26944 transitions. [2020-02-10 20:27:52,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:27:52,984 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:27:52,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:27:52,999 INFO L225 Difference]: With dead ends: 6052 [2020-02-10 20:27:52,999 INFO L226 Difference]: Without dead ends: 6016 [2020-02-10 20:27:52,999 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:27:53,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6016 states. [2020-02-10 20:27:53,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6016 to 3115. [2020-02-10 20:27:53,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3115 states. [2020-02-10 20:27:53,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3115 states to 3115 states and 15571 transitions. [2020-02-10 20:27:53,184 INFO L78 Accepts]: Start accepts. Automaton has 3115 states and 15571 transitions. Word has length 31 [2020-02-10 20:27:53,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:27:53,184 INFO L479 AbstractCegarLoop]: Abstraction has 3115 states and 15571 transitions. [2020-02-10 20:27:53,184 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:27:53,184 INFO L276 IsEmpty]: Start isEmpty. Operand 3115 states and 15571 transitions. [2020-02-10 20:27:53,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:27:53,189 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:27:53,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:27:53,189 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 20:27:53,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:27:53,189 INFO L82 PathProgramCache]: Analyzing trace with hash -2124449198, now seen corresponding path program 49 times [2020-02-10 20:27:53,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:27:53,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286016383] [2020-02-10 20:27:53,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:27:53,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:27:53,751 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:27:53,885 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:27:53,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:27:53,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286016383] [2020-02-10 20:27:53,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:27:53,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:27:53,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561457752] [2020-02-10 20:27:53,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:27:53,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:27:53,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:27:53,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:27:53,896 INFO L87 Difference]: Start difference. First operand 3115 states and 15571 transitions. Second operand 12 states. [2020-02-10 20:27:54,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:27:54,202 INFO L93 Difference]: Finished difference Result 6082 states and 27045 transitions. [2020-02-10 20:27:54,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:27:54,203 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:27:54,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:27:54,218 INFO L225 Difference]: With dead ends: 6082 [2020-02-10 20:27:54,218 INFO L226 Difference]: Without dead ends: 6063 [2020-02-10 20:27:54,218 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:27:54,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6063 states. [2020-02-10 20:27:54,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6063 to 3138. [2020-02-10 20:27:54,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3138 states. [2020-02-10 20:27:54,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3138 states to 3138 states and 15647 transitions. [2020-02-10 20:27:54,483 INFO L78 Accepts]: Start accepts. Automaton has 3138 states and 15647 transitions. Word has length 31 [2020-02-10 20:27:54,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:27:54,484 INFO L479 AbstractCegarLoop]: Abstraction has 3138 states and 15647 transitions. [2020-02-10 20:27:54,484 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:27:54,484 INFO L276 IsEmpty]: Start isEmpty. Operand 3138 states and 15647 transitions. [2020-02-10 20:27:54,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:27:54,489 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:27:54,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:27:54,489 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 20:27:54,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:27:54,490 INFO L82 PathProgramCache]: Analyzing trace with hash 903060920, now seen corresponding path program 50 times [2020-02-10 20:27:54,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:27:54,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135379288] [2020-02-10 20:27:54,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:27:54,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:27:55,050 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:27:55,182 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:27:55,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:27:55,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135379288] [2020-02-10 20:27:55,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:27:55,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:27:55,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505145348] [2020-02-10 20:27:55,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:27:55,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:27:55,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:27:55,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:27:55,192 INFO L87 Difference]: Start difference. First operand 3138 states and 15647 transitions. Second operand 12 states. [2020-02-10 20:27:55,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:27:55,501 INFO L93 Difference]: Finished difference Result 6083 states and 27039 transitions. [2020-02-10 20:27:55,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:27:55,502 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:27:55,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:27:55,517 INFO L225 Difference]: With dead ends: 6083 [2020-02-10 20:27:55,517 INFO L226 Difference]: Without dead ends: 6055 [2020-02-10 20:27:55,518 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:27:55,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6055 states. [2020-02-10 20:27:55,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6055 to 3130. [2020-02-10 20:27:55,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 20:27:55,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15626 transitions. [2020-02-10 20:27:55,706 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15626 transitions. Word has length 31 [2020-02-10 20:27:55,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:27:55,706 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15626 transitions. [2020-02-10 20:27:55,706 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:27:55,706 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15626 transitions. [2020-02-10 20:27:55,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:27:55,711 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:27:55,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:27:55,712 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 20:27:55,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:27:55,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1746206862, now seen corresponding path program 51 times [2020-02-10 20:27:55,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:27:55,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528740412] [2020-02-10 20:27:55,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:27:55,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:27:56,263 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:27:56,395 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:27:56,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:27:56,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528740412] [2020-02-10 20:27:56,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:27:56,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:27:56,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377719225] [2020-02-10 20:27:56,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:27:56,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:27:56,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:27:56,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:27:56,406 INFO L87 Difference]: Start difference. First operand 3130 states and 15626 transitions. Second operand 12 states. [2020-02-10 20:27:56,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:27:56,648 INFO L93 Difference]: Finished difference Result 6077 states and 27027 transitions. [2020-02-10 20:27:56,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:27:56,648 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:27:56,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:27:56,662 INFO L225 Difference]: With dead ends: 6077 [2020-02-10 20:27:56,663 INFO L226 Difference]: Without dead ends: 6058 [2020-02-10 20:27:56,663 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:27:56,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6058 states. [2020-02-10 20:27:56,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6058 to 3136. [2020-02-10 20:27:56,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3136 states. [2020-02-10 20:27:56,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3136 states to 3136 states and 15637 transitions. [2020-02-10 20:27:56,845 INFO L78 Accepts]: Start accepts. Automaton has 3136 states and 15637 transitions. Word has length 31 [2020-02-10 20:27:56,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:27:56,845 INFO L479 AbstractCegarLoop]: Abstraction has 3136 states and 15637 transitions. [2020-02-10 20:27:56,846 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:27:56,846 INFO L276 IsEmpty]: Start isEmpty. Operand 3136 states and 15637 transitions. [2020-02-10 20:27:56,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:27:56,851 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:27:56,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:27:56,851 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 20:27:56,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:27:56,851 INFO L82 PathProgramCache]: Analyzing trace with hash -366221768, now seen corresponding path program 52 times [2020-02-10 20:27:56,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:27:56,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562753293] [2020-02-10 20:27:56,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:27:56,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:27:57,394 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:27:57,527 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:27:57,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:27:57,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562753293] [2020-02-10 20:27:57,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:27:57,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:27:57,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999340541] [2020-02-10 20:27:57,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:27:57,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:27:57,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:27:57,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:27:57,538 INFO L87 Difference]: Start difference. First operand 3136 states and 15637 transitions. Second operand 12 states. [2020-02-10 20:27:57,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:27:57,848 INFO L93 Difference]: Finished difference Result 6075 states and 27017 transitions. [2020-02-10 20:27:57,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:27:57,849 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:27:57,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:27:57,863 INFO L225 Difference]: With dead ends: 6075 [2020-02-10 20:27:57,864 INFO L226 Difference]: Without dead ends: 6052 [2020-02-10 20:27:57,864 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:27:57,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6052 states. [2020-02-10 20:27:58,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6052 to 3130. [2020-02-10 20:27:58,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 20:27:58,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15620 transitions. [2020-02-10 20:27:58,054 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15620 transitions. Word has length 31 [2020-02-10 20:27:58,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:27:58,054 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15620 transitions. [2020-02-10 20:27:58,054 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:27:58,054 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15620 transitions. [2020-02-10 20:27:58,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:27:58,059 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:27:58,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:27:58,060 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 20:27:58,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:27:58,060 INFO L82 PathProgramCache]: Analyzing trace with hash -157717170, now seen corresponding path program 53 times [2020-02-10 20:27:58,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:27:58,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086959728] [2020-02-10 20:27:58,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:27:58,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:27:58,603 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:27:58,734 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:27:58,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:27:58,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086959728] [2020-02-10 20:27:58,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:27:58,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:27:58,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454842690] [2020-02-10 20:27:58,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:27:58,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:27:58,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:27:58,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:27:58,744 INFO L87 Difference]: Start difference. First operand 3130 states and 15620 transitions. Second operand 12 states. [2020-02-10 20:27:59,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:27:59,020 INFO L93 Difference]: Finished difference Result 6079 states and 27025 transitions. [2020-02-10 20:27:59,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:27:59,021 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:27:59,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:27:59,040 INFO L225 Difference]: With dead ends: 6079 [2020-02-10 20:27:59,040 INFO L226 Difference]: Without dead ends: 6059 [2020-02-10 20:27:59,040 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:27:59,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6059 states. [2020-02-10 20:27:59,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6059 to 3136. [2020-02-10 20:27:59,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3136 states. [2020-02-10 20:27:59,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3136 states to 3136 states and 15631 transitions. [2020-02-10 20:27:59,229 INFO L78 Accepts]: Start accepts. Automaton has 3136 states and 15631 transitions. Word has length 31 [2020-02-10 20:27:59,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:27:59,229 INFO L479 AbstractCegarLoop]: Abstraction has 3136 states and 15631 transitions. [2020-02-10 20:27:59,229 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:27:59,229 INFO L276 IsEmpty]: Start isEmpty. Operand 3136 states and 15631 transitions. [2020-02-10 20:27:59,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:27:59,234 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:27:59,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:27:59,234 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 20:27:59,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:27:59,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1002688622, now seen corresponding path program 54 times [2020-02-10 20:27:59,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:27:59,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379316017] [2020-02-10 20:27:59,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:27:59,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:27:59,791 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:27:59,922 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:27:59,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:27:59,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379316017] [2020-02-10 20:27:59,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:27:59,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:27:59,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637952518] [2020-02-10 20:27:59,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:27:59,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:27:59,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:27:59,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:27:59,933 INFO L87 Difference]: Start difference. First operand 3136 states and 15631 transitions. Second operand 12 states. [2020-02-10 20:28:00,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:28:00,252 INFO L93 Difference]: Finished difference Result 6076 states and 27013 transitions. [2020-02-10 20:28:00,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:28:00,253 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:28:00,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:28:00,268 INFO L225 Difference]: With dead ends: 6076 [2020-02-10 20:28:00,268 INFO L226 Difference]: Without dead ends: 6047 [2020-02-10 20:28:00,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:28:00,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6047 states. [2020-02-10 20:28:00,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6047 to 3124. [2020-02-10 20:28:00,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:28:00,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15603 transitions. [2020-02-10 20:28:00,457 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15603 transitions. Word has length 31 [2020-02-10 20:28:00,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:28:00,457 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15603 transitions. [2020-02-10 20:28:00,457 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:28:00,457 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15603 transitions. [2020-02-10 20:28:00,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:28:00,545 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:28:00,545 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:28:00,545 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 20:28:00,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:28:00,545 INFO L82 PathProgramCache]: Analyzing trace with hash -648831620, now seen corresponding path program 55 times [2020-02-10 20:28:00,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:28:00,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693236103] [2020-02-10 20:28:00,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:28:00,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:28:01,233 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:28:01,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:28:01,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693236103] [2020-02-10 20:28:01,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:28:01,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:28:01,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038345076] [2020-02-10 20:28:01,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:28:01,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:28:01,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:28:01,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:28:01,245 INFO L87 Difference]: Start difference. First operand 3124 states and 15603 transitions. Second operand 12 states. [2020-02-10 20:28:01,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:28:01,617 INFO L93 Difference]: Finished difference Result 6100 states and 27082 transitions. [2020-02-10 20:28:01,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:28:01,617 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:28:01,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:28:01,635 INFO L225 Difference]: With dead ends: 6100 [2020-02-10 20:28:01,635 INFO L226 Difference]: Without dead ends: 6081 [2020-02-10 20:28:01,635 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:28:01,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6081 states. [2020-02-10 20:28:01,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6081 to 3143. [2020-02-10 20:28:01,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3143 states. [2020-02-10 20:28:01,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3143 states to 3143 states and 15655 transitions. [2020-02-10 20:28:01,821 INFO L78 Accepts]: Start accepts. Automaton has 3143 states and 15655 transitions. Word has length 31 [2020-02-10 20:28:01,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:28:01,822 INFO L479 AbstractCegarLoop]: Abstraction has 3143 states and 15655 transitions. [2020-02-10 20:28:01,822 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:28:01,822 INFO L276 IsEmpty]: Start isEmpty. Operand 3143 states and 15655 transitions. [2020-02-10 20:28:01,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:28:01,828 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:28:01,828 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:28:01,828 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 20:28:01,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:28:01,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1916288798, now seen corresponding path program 56 times [2020-02-10 20:28:01,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:28:01,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129273330] [2020-02-10 20:28:01,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:28:01,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:28:02,392 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:28:02,522 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:28:02,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:28:02,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129273330] [2020-02-10 20:28:02,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:28:02,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:28:02,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079731385] [2020-02-10 20:28:02,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:28:02,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:28:02,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:28:02,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:28:02,533 INFO L87 Difference]: Start difference. First operand 3143 states and 15655 transitions. Second operand 12 states. [2020-02-10 20:28:02,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:28:02,900 INFO L93 Difference]: Finished difference Result 6101 states and 27076 transitions. [2020-02-10 20:28:02,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:28:02,900 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:28:02,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:28:02,916 INFO L225 Difference]: With dead ends: 6101 [2020-02-10 20:28:02,916 INFO L226 Difference]: Without dead ends: 6073 [2020-02-10 20:28:02,916 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:28:03,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6073 states. [2020-02-10 20:28:03,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6073 to 3135. [2020-02-10 20:28:03,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2020-02-10 20:28:03,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 15632 transitions. [2020-02-10 20:28:03,099 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 15632 transitions. Word has length 31 [2020-02-10 20:28:03,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:28:03,100 INFO L479 AbstractCegarLoop]: Abstraction has 3135 states and 15632 transitions. [2020-02-10 20:28:03,100 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:28:03,100 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 15632 transitions. [2020-02-10 20:28:03,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:28:03,105 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:28:03,105 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:28:03,105 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 20:28:03,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:28:03,106 INFO L82 PathProgramCache]: Analyzing trace with hash -2133920946, now seen corresponding path program 57 times [2020-02-10 20:28:03,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:28:03,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532156904] [2020-02-10 20:28:03,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:28:03,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:28:03,697 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:28:03,828 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:28:03,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:28:03,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532156904] [2020-02-10 20:28:03,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:28:03,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:28:03,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730429175] [2020-02-10 20:28:03,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:28:03,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:28:03,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:28:03,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:28:03,839 INFO L87 Difference]: Start difference. First operand 3135 states and 15632 transitions. Second operand 12 states. [2020-02-10 20:28:04,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:28:04,206 INFO L93 Difference]: Finished difference Result 6103 states and 27079 transitions. [2020-02-10 20:28:04,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:28:04,207 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:28:04,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:28:04,222 INFO L225 Difference]: With dead ends: 6103 [2020-02-10 20:28:04,222 INFO L226 Difference]: Without dead ends: 6084 [2020-02-10 20:28:04,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:28:04,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6084 states. [2020-02-10 20:28:04,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6084 to 3144. [2020-02-10 20:28:04,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3144 states. [2020-02-10 20:28:04,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3144 states to 3144 states and 15649 transitions. [2020-02-10 20:28:04,410 INFO L78 Accepts]: Start accepts. Automaton has 3144 states and 15649 transitions. Word has length 31 [2020-02-10 20:28:04,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:28:04,410 INFO L479 AbstractCegarLoop]: Abstraction has 3144 states and 15649 transitions. [2020-02-10 20:28:04,410 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:28:04,410 INFO L276 IsEmpty]: Start isEmpty. Operand 3144 states and 15649 transitions. [2020-02-10 20:28:04,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:28:04,416 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:28:04,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:28:04,416 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 20:28:04,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:28:04,416 INFO L82 PathProgramCache]: Analyzing trace with hash -2063810910, now seen corresponding path program 58 times [2020-02-10 20:28:04,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:28:04,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060182736] [2020-02-10 20:28:04,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:28:04,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:28:04,987 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:28:05,122 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:28:05,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:28:05,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060182736] [2020-02-10 20:28:05,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:28:05,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:28:05,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16391538] [2020-02-10 20:28:05,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:28:05,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:28:05,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:28:05,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:28:05,132 INFO L87 Difference]: Start difference. First operand 3144 states and 15649 transitions. Second operand 12 states. [2020-02-10 20:28:05,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:28:05,461 INFO L93 Difference]: Finished difference Result 6106 states and 27076 transitions. [2020-02-10 20:28:05,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:28:05,462 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:28:05,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:28:05,477 INFO L225 Difference]: With dead ends: 6106 [2020-02-10 20:28:05,477 INFO L226 Difference]: Without dead ends: 6075 [2020-02-10 20:28:05,477 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:28:05,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6075 states. [2020-02-10 20:28:05,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6075 to 3135. [2020-02-10 20:28:05,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2020-02-10 20:28:05,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 15623 transitions. [2020-02-10 20:28:05,665 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 15623 transitions. Word has length 31 [2020-02-10 20:28:05,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:28:05,666 INFO L479 AbstractCegarLoop]: Abstraction has 3135 states and 15623 transitions. [2020-02-10 20:28:05,666 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:28:05,666 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 15623 transitions. [2020-02-10 20:28:05,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:28:05,671 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:28:05,671 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:28:05,671 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 20:28:05,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:28:05,671 INFO L82 PathProgramCache]: Analyzing trace with hash 257122318, now seen corresponding path program 59 times [2020-02-10 20:28:05,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:28:05,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888232087] [2020-02-10 20:28:05,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:28:05,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:28:06,251 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:28:06,384 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:28:06,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:28:06,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888232087] [2020-02-10 20:28:06,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:28:06,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:28:06,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144829825] [2020-02-10 20:28:06,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:28:06,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:28:06,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:28:06,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:28:06,395 INFO L87 Difference]: Start difference. First operand 3135 states and 15623 transitions. Second operand 12 states. [2020-02-10 20:28:06,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:28:06,634 INFO L93 Difference]: Finished difference Result 6107 states and 27078 transitions. [2020-02-10 20:28:06,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:28:06,635 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:28:06,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:28:06,650 INFO L225 Difference]: With dead ends: 6107 [2020-02-10 20:28:06,650 INFO L226 Difference]: Without dead ends: 6087 [2020-02-10 20:28:06,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:28:06,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6087 states. [2020-02-10 20:28:06,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6087 to 3146. [2020-02-10 20:28:06,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3146 states. [2020-02-10 20:28:06,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3146 states to 3146 states and 15643 transitions. [2020-02-10 20:28:06,838 INFO L78 Accepts]: Start accepts. Automaton has 3146 states and 15643 transitions. Word has length 31 [2020-02-10 20:28:06,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:28:06,839 INFO L479 AbstractCegarLoop]: Abstraction has 3146 states and 15643 transitions. [2020-02-10 20:28:06,839 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:28:06,839 INFO L276 IsEmpty]: Start isEmpty. Operand 3146 states and 15643 transitions. [2020-02-10 20:28:06,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:28:06,844 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:28:06,844 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:28:06,844 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 20:28:06,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:28:06,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1594689532, now seen corresponding path program 60 times [2020-02-10 20:28:06,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:28:06,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112439021] [2020-02-10 20:28:06,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:28:06,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:28:07,116 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 20 [2020-02-10 20:28:07,521 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 20:28:07,649 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:28:07,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:28:07,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112439021] [2020-02-10 20:28:07,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:28:07,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:28:07,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650994560] [2020-02-10 20:28:07,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:28:07,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:28:07,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:28:07,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:28:07,659 INFO L87 Difference]: Start difference. First operand 3146 states and 15643 transitions. Second operand 12 states. [2020-02-10 20:28:07,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:28:07,877 INFO L93 Difference]: Finished difference Result 6109 states and 27072 transitions. [2020-02-10 20:28:07,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:28:07,877 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:28:07,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:28:07,892 INFO L225 Difference]: With dead ends: 6109 [2020-02-10 20:28:07,892 INFO L226 Difference]: Without dead ends: 6065 [2020-02-10 20:28:07,892 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:28:08,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6065 states. [2020-02-10 20:28:08,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6065 to 3124. [2020-02-10 20:28:08,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:28:08,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15594 transitions. [2020-02-10 20:28:08,077 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15594 transitions. Word has length 31 [2020-02-10 20:28:08,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:28:08,077 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15594 transitions. [2020-02-10 20:28:08,077 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:28:08,077 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15594 transitions. [2020-02-10 20:28:08,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:28:08,082 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:28:08,083 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:28:08,083 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 20:28:08,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:28:08,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1341889284, now seen corresponding path program 61 times [2020-02-10 20:28:08,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:28:08,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379888008] [2020-02-10 20:28:08,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:28:08,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:28:08,625 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:28:08,753 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:28:08,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:28:08,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379888008] [2020-02-10 20:28:08,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:28:08,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:28:08,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498345475] [2020-02-10 20:28:08,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:28:08,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:28:08,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:28:08,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:28:08,764 INFO L87 Difference]: Start difference. First operand 3124 states and 15594 transitions. Second operand 12 states. [2020-02-10 20:28:09,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:28:09,004 INFO L93 Difference]: Finished difference Result 6082 states and 27028 transitions. [2020-02-10 20:28:09,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:28:09,005 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:28:09,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:28:09,019 INFO L225 Difference]: With dead ends: 6082 [2020-02-10 20:28:09,020 INFO L226 Difference]: Without dead ends: 6063 [2020-02-10 20:28:09,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:28:09,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6063 states. [2020-02-10 20:28:09,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6063 to 3137. [2020-02-10 20:28:09,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3137 states. [2020-02-10 20:28:09,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3137 states to 3137 states and 15631 transitions. [2020-02-10 20:28:09,209 INFO L78 Accepts]: Start accepts. Automaton has 3137 states and 15631 transitions. Word has length 31 [2020-02-10 20:28:09,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:28:09,210 INFO L479 AbstractCegarLoop]: Abstraction has 3137 states and 15631 transitions. [2020-02-10 20:28:09,210 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:28:09,210 INFO L276 IsEmpty]: Start isEmpty. Operand 3137 states and 15631 transitions. [2020-02-10 20:28:09,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:28:09,215 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:28:09,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:28:09,215 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 20:28:09,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:28:09,215 INFO L82 PathProgramCache]: Analyzing trace with hash 840649382, now seen corresponding path program 62 times [2020-02-10 20:28:09,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:28:09,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676703977] [2020-02-10 20:28:09,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:28:09,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:28:09,773 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:28:09,908 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:28:09,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:28:09,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676703977] [2020-02-10 20:28:09,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:28:09,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:28:09,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792557733] [2020-02-10 20:28:09,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:28:09,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:28:09,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:28:09,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:28:09,919 INFO L87 Difference]: Start difference. First operand 3137 states and 15631 transitions. Second operand 12 states. [2020-02-10 20:28:10,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:28:10,151 INFO L93 Difference]: Finished difference Result 6080 states and 27018 transitions. [2020-02-10 20:28:10,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:28:10,152 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:28:10,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:28:10,167 INFO L225 Difference]: With dead ends: 6080 [2020-02-10 20:28:10,168 INFO L226 Difference]: Without dead ends: 6057 [2020-02-10 20:28:10,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:28:10,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6057 states. [2020-02-10 20:28:10,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6057 to 3131. [2020-02-10 20:28:10,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 20:28:10,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15614 transitions. [2020-02-10 20:28:10,352 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15614 transitions. Word has length 31 [2020-02-10 20:28:10,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:28:10,352 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15614 transitions. [2020-02-10 20:28:10,352 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:28:10,352 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15614 transitions. [2020-02-10 20:28:10,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:28:10,357 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:28:10,357 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:28:10,358 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 20:28:10,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:28:10,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1892299922, now seen corresponding path program 63 times [2020-02-10 20:28:10,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:28:10,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769616960] [2020-02-10 20:28:10,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:28:10,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:28:10,923 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:28:11,050 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:28:11,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:28:11,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769616960] [2020-02-10 20:28:11,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:28:11,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:28:11,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686989549] [2020-02-10 20:28:11,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:28:11,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:28:11,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:28:11,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:28:11,060 INFO L87 Difference]: Start difference. First operand 3131 states and 15614 transitions. Second operand 12 states. [2020-02-10 20:28:11,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:28:11,285 INFO L93 Difference]: Finished difference Result 6090 states and 27039 transitions. [2020-02-10 20:28:11,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:28:11,285 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:28:11,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:28:11,301 INFO L225 Difference]: With dead ends: 6090 [2020-02-10 20:28:11,301 INFO L226 Difference]: Without dead ends: 6071 [2020-02-10 20:28:11,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:28:11,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6071 states. [2020-02-10 20:28:11,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6071 to 3140. [2020-02-10 20:28:11,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3140 states. [2020-02-10 20:28:11,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3140 states to 3140 states and 15631 transitions. [2020-02-10 20:28:11,488 INFO L78 Accepts]: Start accepts. Automaton has 3140 states and 15631 transitions. Word has length 31 [2020-02-10 20:28:11,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:28:11,488 INFO L479 AbstractCegarLoop]: Abstraction has 3140 states and 15631 transitions. [2020-02-10 20:28:11,488 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:28:11,488 INFO L276 IsEmpty]: Start isEmpty. Operand 3140 states and 15631 transitions. [2020-02-10 20:28:11,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:28:11,493 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:28:11,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:28:11,494 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 20:28:11,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:28:11,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1962409958, now seen corresponding path program 64 times [2020-02-10 20:28:11,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:28:11,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916635746] [2020-02-10 20:28:11,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:28:11,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:28:12,054 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:28:12,184 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:28:12,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:28:12,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916635746] [2020-02-10 20:28:12,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:28:12,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:28:12,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213017083] [2020-02-10 20:28:12,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:28:12,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:28:12,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:28:12,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:28:12,195 INFO L87 Difference]: Start difference. First operand 3140 states and 15631 transitions. Second operand 12 states. [2020-02-10 20:28:12,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:28:12,399 INFO L93 Difference]: Finished difference Result 6093 states and 27036 transitions. [2020-02-10 20:28:12,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:28:12,399 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:28:12,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:28:12,413 INFO L225 Difference]: With dead ends: 6093 [2020-02-10 20:28:12,413 INFO L226 Difference]: Without dead ends: 6062 [2020-02-10 20:28:12,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:28:12,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6062 states. [2020-02-10 20:28:12,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6062 to 3131. [2020-02-10 20:28:12,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 20:28:12,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15607 transitions. [2020-02-10 20:28:12,598 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15607 transitions. Word has length 31 [2020-02-10 20:28:12,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:28:12,598 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15607 transitions. [2020-02-10 20:28:12,598 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:28:12,598 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15607 transitions. [2020-02-10 20:28:12,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:28:12,603 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:28:12,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:28:12,603 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 20:28:12,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:28:12,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1280906798, now seen corresponding path program 65 times [2020-02-10 20:28:12,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:28:12,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74833199] [2020-02-10 20:28:12,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:28:12,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:28:13,157 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:28:13,289 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:28:13,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:28:13,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74833199] [2020-02-10 20:28:13,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:28:13,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:28:13,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51493962] [2020-02-10 20:28:13,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:28:13,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:28:13,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:28:13,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:28:13,300 INFO L87 Difference]: Start difference. First operand 3131 states and 15607 transitions. Second operand 12 states. [2020-02-10 20:28:13,585 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2020-02-10 20:28:13,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:28:13,604 INFO L93 Difference]: Finished difference Result 6084 states and 27018 transitions. [2020-02-10 20:28:13,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:28:13,604 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:28:13,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:28:13,619 INFO L225 Difference]: With dead ends: 6084 [2020-02-10 20:28:13,619 INFO L226 Difference]: Without dead ends: 6067 [2020-02-10 20:28:13,619 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:28:13,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6067 states. [2020-02-10 20:28:13,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6067 to 3138. [2020-02-10 20:28:13,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3138 states. [2020-02-10 20:28:13,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3138 states to 3138 states and 15620 transitions. [2020-02-10 20:28:13,803 INFO L78 Accepts]: Start accepts. Automaton has 3138 states and 15620 transitions. Word has length 31 [2020-02-10 20:28:13,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:28:13,803 INFO L479 AbstractCegarLoop]: Abstraction has 3138 states and 15620 transitions. [2020-02-10 20:28:13,803 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:28:13,803 INFO L276 IsEmpty]: Start isEmpty. Operand 3138 states and 15620 transitions. [2020-02-10 20:28:13,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:28:13,808 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:28:13,808 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:28:13,808 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 20:28:13,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:28:13,808 INFO L82 PathProgramCache]: Analyzing trace with hash 901631868, now seen corresponding path program 66 times [2020-02-10 20:28:13,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:28:13,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200367526] [2020-02-10 20:28:13,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:28:13,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:28:14,359 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:28:14,487 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:28:14,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:28:14,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200367526] [2020-02-10 20:28:14,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:28:14,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:28:14,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542293970] [2020-02-10 20:28:14,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:28:14,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:28:14,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:28:14,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:28:14,497 INFO L87 Difference]: Start difference. First operand 3138 states and 15620 transitions. Second operand 12 states. [2020-02-10 20:28:14,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:28:14,767 INFO L93 Difference]: Finished difference Result 6089 states and 27021 transitions. [2020-02-10 20:28:14,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:28:14,767 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:28:14,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:28:14,782 INFO L225 Difference]: With dead ends: 6089 [2020-02-10 20:28:14,782 INFO L226 Difference]: Without dead ends: 6053 [2020-02-10 20:28:14,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:28:14,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6053 states. [2020-02-10 20:28:14,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6053 to 3124. [2020-02-10 20:28:14,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:28:14,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15587 transitions. [2020-02-10 20:28:14,978 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15587 transitions. Word has length 31 [2020-02-10 20:28:14,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:28:14,978 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15587 transitions. [2020-02-10 20:28:14,978 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:28:14,979 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15587 transitions. [2020-02-10 20:28:14,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:28:14,984 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:28:14,984 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:28:14,984 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 20:28:14,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:28:14,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1501449310, now seen corresponding path program 67 times [2020-02-10 20:28:14,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:28:14,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817255817] [2020-02-10 20:28:14,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:28:14,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:28:15,537 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:28:15,670 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:28:15,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:28:15,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817255817] [2020-02-10 20:28:15,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:28:15,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:28:15,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482077255] [2020-02-10 20:28:15,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:28:15,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:28:15,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:28:15,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:28:15,681 INFO L87 Difference]: Start difference. First operand 3124 states and 15587 transitions. Second operand 12 states. [2020-02-10 20:28:15,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:28:15,952 INFO L93 Difference]: Finished difference Result 6088 states and 27033 transitions. [2020-02-10 20:28:15,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:28:15,953 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:28:15,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:28:15,967 INFO L225 Difference]: With dead ends: 6088 [2020-02-10 20:28:15,967 INFO L226 Difference]: Without dead ends: 6068 [2020-02-10 20:28:15,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:28:16,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6068 states. [2020-02-10 20:28:16,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6068 to 3138. [2020-02-10 20:28:16,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3138 states. [2020-02-10 20:28:16,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3138 states to 3138 states and 15626 transitions. [2020-02-10 20:28:16,156 INFO L78 Accepts]: Start accepts. Automaton has 3138 states and 15626 transitions. Word has length 31 [2020-02-10 20:28:16,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:28:16,156 INFO L479 AbstractCegarLoop]: Abstraction has 3138 states and 15626 transitions. [2020-02-10 20:28:16,157 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:28:16,157 INFO L276 IsEmpty]: Start isEmpty. Operand 3138 states and 15626 transitions. [2020-02-10 20:28:16,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:28:16,162 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:28:16,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:28:16,162 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 20:28:16,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:28:16,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1948546534, now seen corresponding path program 68 times [2020-02-10 20:28:16,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:28:16,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237316966] [2020-02-10 20:28:16,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:28:16,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:28:16,723 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:28:16,858 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:28:16,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:28:16,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237316966] [2020-02-10 20:28:16,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:28:16,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:28:16,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26909595] [2020-02-10 20:28:16,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:28:16,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:28:16,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:28:16,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:28:16,869 INFO L87 Difference]: Start difference. First operand 3138 states and 15626 transitions. Second operand 12 states. [2020-02-10 20:28:17,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:28:17,100 INFO L93 Difference]: Finished difference Result 6085 states and 27021 transitions. [2020-02-10 20:28:17,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:28:17,101 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:28:17,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:28:17,115 INFO L225 Difference]: With dead ends: 6085 [2020-02-10 20:28:17,116 INFO L226 Difference]: Without dead ends: 6062 [2020-02-10 20:28:17,116 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:28:17,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6062 states. [2020-02-10 20:28:17,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6062 to 3132. [2020-02-10 20:28:17,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-02-10 20:28:17,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15609 transitions. [2020-02-10 20:28:17,300 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15609 transitions. Word has length 31 [2020-02-10 20:28:17,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:28:17,300 INFO L479 AbstractCegarLoop]: Abstraction has 3132 states and 15609 transitions. [2020-02-10 20:28:17,300 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:28:17,300 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15609 transitions. [2020-02-10 20:28:17,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:28:17,305 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:28:17,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:28:17,306 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 20:28:17,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:28:17,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1732739896, now seen corresponding path program 69 times [2020-02-10 20:28:17,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:28:17,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83217694] [2020-02-10 20:28:17,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:28:17,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:28:17,867 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:28:17,995 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:28:18,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:28:18,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83217694] [2020-02-10 20:28:18,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:28:18,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:28:18,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704718335] [2020-02-10 20:28:18,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:28:18,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:28:18,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:28:18,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:28:18,006 INFO L87 Difference]: Start difference. First operand 3132 states and 15609 transitions. Second operand 12 states. [2020-02-10 20:28:18,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:28:18,248 INFO L93 Difference]: Finished difference Result 6098 states and 27048 transitions. [2020-02-10 20:28:18,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:28:18,249 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:28:18,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:28:18,263 INFO L225 Difference]: With dead ends: 6098 [2020-02-10 20:28:18,263 INFO L226 Difference]: Without dead ends: 6078 [2020-02-10 20:28:18,263 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:28:18,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6078 states. [2020-02-10 20:28:18,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6078 to 3143. [2020-02-10 20:28:18,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3143 states. [2020-02-10 20:28:18,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3143 states to 3143 states and 15629 transitions. [2020-02-10 20:28:18,447 INFO L78 Accepts]: Start accepts. Automaton has 3143 states and 15629 transitions. Word has length 31 [2020-02-10 20:28:18,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:28:18,448 INFO L479 AbstractCegarLoop]: Abstraction has 3143 states and 15629 transitions. [2020-02-10 20:28:18,448 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:28:18,448 INFO L276 IsEmpty]: Start isEmpty. Operand 3143 states and 15629 transitions. [2020-02-10 20:28:18,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:28:18,453 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:28:18,453 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:28:18,453 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 20:28:18,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:28:18,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1224660186, now seen corresponding path program 70 times [2020-02-10 20:28:18,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:28:18,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369389247] [2020-02-10 20:28:18,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:28:18,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:28:19,023 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:28:19,157 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:28:19,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:28:19,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369389247] [2020-02-10 20:28:19,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:28:19,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:28:19,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571106034] [2020-02-10 20:28:19,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:28:19,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:28:19,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:28:19,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:28:19,168 INFO L87 Difference]: Start difference. First operand 3143 states and 15629 transitions. Second operand 12 states. [2020-02-10 20:28:19,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:28:19,412 INFO L93 Difference]: Finished difference Result 6100 states and 27042 transitions. [2020-02-10 20:28:19,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:28:19,412 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:28:19,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:28:19,426 INFO L225 Difference]: With dead ends: 6100 [2020-02-10 20:28:19,426 INFO L226 Difference]: Without dead ends: 6067 [2020-02-10 20:28:19,426 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:28:19,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6067 states. [2020-02-10 20:28:19,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6067 to 3132. [2020-02-10 20:28:19,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-02-10 20:28:19,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15601 transitions. [2020-02-10 20:28:19,611 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15601 transitions. Word has length 31 [2020-02-10 20:28:19,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:28:19,611 INFO L479 AbstractCegarLoop]: Abstraction has 3132 states and 15601 transitions. [2020-02-10 20:28:19,611 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:28:19,611 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15601 transitions. [2020-02-10 20:28:19,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:28:19,616 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:28:19,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:28:19,616 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 20:28:19,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:28:19,617 INFO L82 PathProgramCache]: Analyzing trace with hash 463457208, now seen corresponding path program 71 times [2020-02-10 20:28:19,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:28:19,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571013724] [2020-02-10 20:28:19,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:28:19,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:28:20,280 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:28:20,415 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:28:20,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:28:20,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571013724] [2020-02-10 20:28:20,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:28:20,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:28:20,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641848955] [2020-02-10 20:28:20,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:28:20,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:28:20,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:28:20,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:28:20,426 INFO L87 Difference]: Start difference. First operand 3132 states and 15601 transitions. Second operand 12 states. [2020-02-10 20:28:20,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:28:20,657 INFO L93 Difference]: Finished difference Result 6088 states and 27018 transitions. [2020-02-10 20:28:20,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:28:20,658 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:28:20,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:28:20,674 INFO L225 Difference]: With dead ends: 6088 [2020-02-10 20:28:20,674 INFO L226 Difference]: Without dead ends: 6071 [2020-02-10 20:28:20,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:28:20,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6071 states. [2020-02-10 20:28:20,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6071 to 3139. [2020-02-10 20:28:20,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3139 states. [2020-02-10 20:28:20,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3139 states to 3139 states and 15614 transitions. [2020-02-10 20:28:20,860 INFO L78 Accepts]: Start accepts. Automaton has 3139 states and 15614 transitions. Word has length 31 [2020-02-10 20:28:20,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:28:20,860 INFO L479 AbstractCegarLoop]: Abstraction has 3139 states and 15614 transitions. [2020-02-10 20:28:20,860 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:28:20,861 INFO L276 IsEmpty]: Start isEmpty. Operand 3139 states and 15614 transitions. [2020-02-10 20:28:20,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:28:20,866 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:28:20,866 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:28:20,866 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:28:20,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:28:20,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1648971422, now seen corresponding path program 72 times [2020-02-10 20:28:20,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:28:20,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013094591] [2020-02-10 20:28:20,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:28:20,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:28:21,456 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:28:21,587 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:28:21,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:28:21,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013094591] [2020-02-10 20:28:21,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:28:21,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:28:21,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727652098] [2020-02-10 20:28:21,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:28:21,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:28:21,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:28:21,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:28:21,597 INFO L87 Difference]: Start difference. First operand 3139 states and 15614 transitions. Second operand 12 states. [2020-02-10 20:28:21,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:28:21,786 INFO L93 Difference]: Finished difference Result 6093 states and 27021 transitions. [2020-02-10 20:28:21,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:28:21,786 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:28:21,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:28:21,801 INFO L225 Difference]: With dead ends: 6093 [2020-02-10 20:28:21,802 INFO L226 Difference]: Without dead ends: 6047 [2020-02-10 20:28:21,802 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:28:21,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6047 states. [2020-02-10 20:28:21,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6047 to 3115. [2020-02-10 20:28:21,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3115 states. [2020-02-10 20:28:21,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3115 states to 3115 states and 15562 transitions. [2020-02-10 20:28:21,984 INFO L78 Accepts]: Start accepts. Automaton has 3115 states and 15562 transitions. Word has length 31 [2020-02-10 20:28:21,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:28:21,984 INFO L479 AbstractCegarLoop]: Abstraction has 3115 states and 15562 transitions. [2020-02-10 20:28:21,984 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:28:21,984 INFO L276 IsEmpty]: Start isEmpty. Operand 3115 states and 15562 transitions. [2020-02-10 20:28:21,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:28:21,989 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:28:21,989 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:28:21,989 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:28:21,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:28:21,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1726304654, now seen corresponding path program 73 times [2020-02-10 20:28:21,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:28:21,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299916302] [2020-02-10 20:28:21,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:28:21,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:28:22,532 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:28:22,660 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:28:22,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:28:22,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299916302] [2020-02-10 20:28:22,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:28:22,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:28:22,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348323712] [2020-02-10 20:28:22,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:28:22,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:28:22,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:28:22,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:28:22,671 INFO L87 Difference]: Start difference. First operand 3115 states and 15562 transitions. Second operand 12 states. [2020-02-10 20:28:22,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:28:22,907 INFO L93 Difference]: Finished difference Result 6062 states and 26989 transitions. [2020-02-10 20:28:22,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:28:22,908 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:28:22,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:28:22,923 INFO L225 Difference]: With dead ends: 6062 [2020-02-10 20:28:22,923 INFO L226 Difference]: Without dead ends: 6043 [2020-02-10 20:28:22,923 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:28:23,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6043 states. [2020-02-10 20:28:23,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6043 to 3134. [2020-02-10 20:28:23,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3134 states. [2020-02-10 20:28:23,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3134 states to 3134 states and 15629 transitions. [2020-02-10 20:28:23,108 INFO L78 Accepts]: Start accepts. Automaton has 3134 states and 15629 transitions. Word has length 31 [2020-02-10 20:28:23,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:28:23,108 INFO L479 AbstractCegarLoop]: Abstraction has 3134 states and 15629 transitions. [2020-02-10 20:28:23,108 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:28:23,108 INFO L276 IsEmpty]: Start isEmpty. Operand 3134 states and 15629 transitions. [2020-02-10 20:28:23,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:28:23,113 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:28:23,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:28:23,113 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:28:23,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:28:23,114 INFO L82 PathProgramCache]: Analyzing trace with hash -386123976, now seen corresponding path program 74 times [2020-02-10 20:28:23,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:28:23,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469530078] [2020-02-10 20:28:23,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:28:23,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:28:23,685 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:28:23,815 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:28:23,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:28:23,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469530078] [2020-02-10 20:28:23,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:28:23,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:28:23,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359290422] [2020-02-10 20:28:23,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:28:23,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:28:23,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:28:23,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:28:23,826 INFO L87 Difference]: Start difference. First operand 3134 states and 15629 transitions. Second operand 12 states. [2020-02-10 20:28:24,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:28:24,121 INFO L93 Difference]: Finished difference Result 6060 states and 26979 transitions. [2020-02-10 20:28:24,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:28:24,121 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:28:24,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:28:24,136 INFO L225 Difference]: With dead ends: 6060 [2020-02-10 20:28:24,137 INFO L226 Difference]: Without dead ends: 6037 [2020-02-10 20:28:24,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:28:24,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6037 states. [2020-02-10 20:28:24,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6037 to 3128. [2020-02-10 20:28:24,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 20:28:24,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15612 transitions. [2020-02-10 20:28:24,326 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15612 transitions. Word has length 31 [2020-02-10 20:28:24,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:28:24,326 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15612 transitions. [2020-02-10 20:28:24,326 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:28:24,326 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15612 transitions. [2020-02-10 20:28:24,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:28:24,331 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:28:24,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:28:24,332 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:28:24,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:28:24,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1301993418, now seen corresponding path program 75 times [2020-02-10 20:28:24,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:28:24,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429682528] [2020-02-10 20:28:24,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:28:24,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:28:24,868 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:28:24,998 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:28:25,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:28:25,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429682528] [2020-02-10 20:28:25,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:28:25,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:28:25,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103874424] [2020-02-10 20:28:25,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:28:25,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:28:25,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:28:25,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:28:25,009 INFO L87 Difference]: Start difference. First operand 3128 states and 15612 transitions. Second operand 12 states. [2020-02-10 20:28:25,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:28:25,261 INFO L93 Difference]: Finished difference Result 6064 states and 26988 transitions. [2020-02-10 20:28:25,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:28:25,262 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:28:25,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:28:25,278 INFO L225 Difference]: With dead ends: 6064 [2020-02-10 20:28:25,278 INFO L226 Difference]: Without dead ends: 6045 [2020-02-10 20:28:25,278 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:28:25,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6045 states. [2020-02-10 20:28:25,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6045 to 3135. [2020-02-10 20:28:25,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2020-02-10 20:28:25,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 15625 transitions. [2020-02-10 20:28:25,469 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 15625 transitions. Word has length 31 [2020-02-10 20:28:25,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:28:25,470 INFO L479 AbstractCegarLoop]: Abstraction has 3135 states and 15625 transitions. [2020-02-10 20:28:25,470 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:28:25,470 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 15625 transitions. [2020-02-10 20:28:25,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:28:25,475 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:28:25,475 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:28:25,475 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:28:25,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:28:25,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1655406664, now seen corresponding path program 76 times [2020-02-10 20:28:25,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:28:25,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500919421] [2020-02-10 20:28:25,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:28:25,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:28:26,242 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-02-10 20:28:26,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:28:26,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500919421] [2020-02-10 20:28:26,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:28:26,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:28:26,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729176012] [2020-02-10 20:28:26,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:28:26,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:28:26,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:28:26,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:28:26,253 INFO L87 Difference]: Start difference. First operand 3135 states and 15625 transitions. Second operand 12 states. [2020-02-10 20:28:26,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:28:26,501 INFO L93 Difference]: Finished difference Result 6063 states and 26979 transitions. [2020-02-10 20:28:26,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:28:26,502 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:28:26,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:28:26,516 INFO L225 Difference]: With dead ends: 6063 [2020-02-10 20:28:26,516 INFO L226 Difference]: Without dead ends: 6038 [2020-02-10 20:28:26,516 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:28:26,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6038 states. [2020-02-10 20:28:26,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6038 to 3128. [2020-02-10 20:28:26,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 20:28:26,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15606 transitions. [2020-02-10 20:28:26,706 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15606 transitions. Word has length 31 [2020-02-10 20:28:26,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:28:26,706 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15606 transitions. [2020-02-10 20:28:26,706 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:28:26,706 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15606 transitions. [2020-02-10 20:28:26,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:28:26,712 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:28:26,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:28:26,712 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:28:26,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:28:26,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1871213302, now seen corresponding path program 77 times [2020-02-10 20:28:26,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:28:26,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978655944] [2020-02-10 20:28:26,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:28:26,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:28:27,282 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:28:27,412 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:28:27,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:28:27,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978655944] [2020-02-10 20:28:27,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:28:27,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:28:27,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76589474] [2020-02-10 20:28:27,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:28:27,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:28:27,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:28:27,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:28:27,424 INFO L87 Difference]: Start difference. First operand 3128 states and 15606 transitions. Second operand 12 states. [2020-02-10 20:28:27,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:28:27,710 INFO L93 Difference]: Finished difference Result 6059 states and 26971 transitions. [2020-02-10 20:28:27,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:28:27,711 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:28:27,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:28:27,726 INFO L225 Difference]: With dead ends: 6059 [2020-02-10 20:28:27,726 INFO L226 Difference]: Without dead ends: 6042 [2020-02-10 20:28:27,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 20:28:27,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6042 states. [2020-02-10 20:28:27,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6042 to 3134. [2020-02-10 20:28:27,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3134 states. [2020-02-10 20:28:27,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3134 states to 3134 states and 15617 transitions. [2020-02-10 20:28:27,924 INFO L78 Accepts]: Start accepts. Automaton has 3134 states and 15617 transitions. Word has length 31 [2020-02-10 20:28:27,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:28:27,924 INFO L479 AbstractCegarLoop]: Abstraction has 3134 states and 15617 transitions. [2020-02-10 20:28:27,924 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:28:27,925 INFO L276 IsEmpty]: Start isEmpty. Operand 3134 states and 15617 transitions. [2020-02-10 20:28:27,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:28:27,931 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:28:27,931 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:28:27,931 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:28:27,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:28:27,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1578782542, now seen corresponding path program 78 times [2020-02-10 20:28:27,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:28:27,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826878571] [2020-02-10 20:28:27,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:28:27,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:28:28,485 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:28:28,618 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:28:28,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:28:28,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826878571] [2020-02-10 20:28:28,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:28:28,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:28:28,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211488683] [2020-02-10 20:28:28,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:28:28,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:28:28,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:28:28,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:28:28,629 INFO L87 Difference]: Start difference. First operand 3134 states and 15617 transitions. Second operand 12 states. [2020-02-10 20:28:28,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:28:28,867 INFO L93 Difference]: Finished difference Result 6060 states and 26967 transitions. [2020-02-10 20:28:28,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:28:28,867 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:28:28,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:28:28,882 INFO L225 Difference]: With dead ends: 6060 [2020-02-10 20:28:28,882 INFO L226 Difference]: Without dead ends: 6030 [2020-02-10 20:28:28,883 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:28:29,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6030 states. [2020-02-10 20:28:29,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6030 to 3122. [2020-02-10 20:28:29,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-02-10 20:28:29,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15589 transitions. [2020-02-10 20:28:29,071 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15589 transitions. Word has length 31 [2020-02-10 20:28:29,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:28:29,071 INFO L479 AbstractCegarLoop]: Abstraction has 3122 states and 15589 transitions. [2020-02-10 20:28:29,071 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:28:29,071 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15589 transitions. [2020-02-10 20:28:29,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:28:29,076 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:28:29,076 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:28:29,076 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:28:29,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:28:29,076 INFO L82 PathProgramCache]: Analyzing trace with hash -824298636, now seen corresponding path program 79 times [2020-02-10 20:28:29,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:28:29,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348528910] [2020-02-10 20:28:29,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:28:29,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:28:29,615 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:28:29,750 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:28:29,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:28:29,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348528910] [2020-02-10 20:28:29,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:28:29,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:28:29,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121321522] [2020-02-10 20:28:29,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:28:29,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:28:29,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:28:29,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:28:29,761 INFO L87 Difference]: Start difference. First operand 3122 states and 15589 transitions. Second operand 12 states. [2020-02-10 20:28:30,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:28:30,013 INFO L93 Difference]: Finished difference Result 6070 states and 27000 transitions. [2020-02-10 20:28:30,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:28:30,014 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:28:30,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:28:30,029 INFO L225 Difference]: With dead ends: 6070 [2020-02-10 20:28:30,029 INFO L226 Difference]: Without dead ends: 6051 [2020-02-10 20:28:30,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 20:28:30,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6051 states. [2020-02-10 20:28:30,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6051 to 3135. [2020-02-10 20:28:30,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2020-02-10 20:28:30,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 15626 transitions. [2020-02-10 20:28:30,213 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 15626 transitions. Word has length 31 [2020-02-10 20:28:30,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:28:30,213 INFO L479 AbstractCegarLoop]: Abstraction has 3135 states and 15626 transitions. [2020-02-10 20:28:30,213 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:28:30,213 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 15626 transitions. [2020-02-10 20:28:30,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:28:30,218 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:28:30,218 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:28:30,218 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:28:30,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:28:30,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1358240030, now seen corresponding path program 80 times [2020-02-10 20:28:30,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:28:30,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929858224] [2020-02-10 20:28:30,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:28:30,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:28:30,784 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:28:30,914 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:28:30,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:28:30,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929858224] [2020-02-10 20:28:30,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:28:30,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:28:30,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219521507] [2020-02-10 20:28:30,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:28:30,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:28:30,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:28:30,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:28:30,925 INFO L87 Difference]: Start difference. First operand 3135 states and 15626 transitions. Second operand 12 states. [2020-02-10 20:28:31,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:28:31,158 INFO L93 Difference]: Finished difference Result 6068 states and 26990 transitions. [2020-02-10 20:28:31,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:28:31,159 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:28:31,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:28:31,174 INFO L225 Difference]: With dead ends: 6068 [2020-02-10 20:28:31,174 INFO L226 Difference]: Without dead ends: 6045 [2020-02-10 20:28:31,174 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:28:31,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6045 states. [2020-02-10 20:28:31,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6045 to 3129. [2020-02-10 20:28:31,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 20:28:31,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15609 transitions. [2020-02-10 20:28:31,362 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15609 transitions. Word has length 31 [2020-02-10 20:28:31,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:28:31,362 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15609 transitions. [2020-02-10 20:28:31,362 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:28:31,362 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15609 transitions. [2020-02-10 20:28:31,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:28:31,367 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:28:31,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:28:31,368 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:28:31,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:28:31,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1885076726, now seen corresponding path program 81 times [2020-02-10 20:28:31,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:28:31,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178323570] [2020-02-10 20:28:31,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:28:31,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:28:31,939 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:28:32,070 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:28:32,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:28:32,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178323570] [2020-02-10 20:28:32,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:28:32,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:28:32,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679637961] [2020-02-10 20:28:32,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:28:32,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:28:32,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:28:32,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:28:32,080 INFO L87 Difference]: Start difference. First operand 3129 states and 15609 transitions. Second operand 12 states. [2020-02-10 20:28:32,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:28:32,316 INFO L93 Difference]: Finished difference Result 6078 states and 27011 transitions. [2020-02-10 20:28:32,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:28:32,317 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:28:32,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:28:32,332 INFO L225 Difference]: With dead ends: 6078 [2020-02-10 20:28:32,332 INFO L226 Difference]: Without dead ends: 6059 [2020-02-10 20:28:32,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:28:32,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6059 states. [2020-02-10 20:28:32,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6059 to 3138. [2020-02-10 20:28:32,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3138 states. [2020-02-10 20:28:32,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3138 states to 3138 states and 15626 transitions. [2020-02-10 20:28:32,574 INFO L78 Accepts]: Start accepts. Automaton has 3138 states and 15626 transitions. Word has length 31 [2020-02-10 20:28:32,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:28:32,574 INFO L479 AbstractCegarLoop]: Abstraction has 3138 states and 15626 transitions. [2020-02-10 20:28:32,574 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:28:32,574 INFO L276 IsEmpty]: Start isEmpty. Operand 3138 states and 15626 transitions. [2020-02-10 20:28:32,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:28:32,579 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:28:32,580 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:28:32,580 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:28:32,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:28:32,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1814966690, now seen corresponding path program 82 times [2020-02-10 20:28:32,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:28:32,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889541111] [2020-02-10 20:28:32,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:28:32,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:28:33,315 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:28:33,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:28:33,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889541111] [2020-02-10 20:28:33,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:28:33,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:28:33,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34511801] [2020-02-10 20:28:33,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:28:33,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:28:33,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:28:33,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:28:33,326 INFO L87 Difference]: Start difference. First operand 3138 states and 15626 transitions. Second operand 12 states. [2020-02-10 20:28:33,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:28:33,536 INFO L93 Difference]: Finished difference Result 6081 states and 27008 transitions. [2020-02-10 20:28:33,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:28:33,537 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:28:33,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:28:33,551 INFO L225 Difference]: With dead ends: 6081 [2020-02-10 20:28:33,551 INFO L226 Difference]: Without dead ends: 6050 [2020-02-10 20:28:33,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:28:33,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6050 states. [2020-02-10 20:28:33,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6050 to 3129. [2020-02-10 20:28:33,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 20:28:33,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15602 transitions. [2020-02-10 20:28:33,740 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15602 transitions. Word has length 31 [2020-02-10 20:28:33,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:28:33,741 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15602 transitions. [2020-02-10 20:28:33,741 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:28:33,741 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15602 transitions. [2020-02-10 20:28:33,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:28:33,748 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:28:33,748 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:28:33,748 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:28:33,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:28:33,749 INFO L82 PathProgramCache]: Analyzing trace with hash -763316150, now seen corresponding path program 83 times [2020-02-10 20:28:33,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:28:33,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210579670] [2020-02-10 20:28:33,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:28:33,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:28:34,306 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:28:34,439 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:28:34,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:28:34,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210579670] [2020-02-10 20:28:34,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:28:34,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:28:34,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858683206] [2020-02-10 20:28:34,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:28:34,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:28:34,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:28:34,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:28:34,450 INFO L87 Difference]: Start difference. First operand 3129 states and 15602 transitions. Second operand 12 states. [2020-02-10 20:28:34,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:28:34,686 INFO L93 Difference]: Finished difference Result 6072 states and 26990 transitions. [2020-02-10 20:28:34,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:28:34,686 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:28:34,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:28:34,702 INFO L225 Difference]: With dead ends: 6072 [2020-02-10 20:28:34,702 INFO L226 Difference]: Without dead ends: 6055 [2020-02-10 20:28:34,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:28:34,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6055 states. [2020-02-10 20:28:34,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6055 to 3136. [2020-02-10 20:28:34,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3136 states. [2020-02-10 20:28:34,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3136 states to 3136 states and 15615 transitions. [2020-02-10 20:28:34,885 INFO L78 Accepts]: Start accepts. Automaton has 3136 states and 15615 transitions. Word has length 31 [2020-02-10 20:28:34,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:28:34,886 INFO L479 AbstractCegarLoop]: Abstraction has 3136 states and 15615 transitions. [2020-02-10 20:28:34,886 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:28:34,886 INFO L276 IsEmpty]: Start isEmpty. Operand 3136 states and 15615 transitions. [2020-02-10 20:28:34,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:28:34,891 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:28:34,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:28:34,891 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:28:34,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:28:34,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1419222516, now seen corresponding path program 84 times [2020-02-10 20:28:34,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:28:34,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260977680] [2020-02-10 20:28:34,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:28:34,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:28:35,451 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-02-10 20:28:35,582 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:28:35,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:28:35,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260977680] [2020-02-10 20:28:35,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:28:35,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:28:35,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044061684] [2020-02-10 20:28:35,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:28:35,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:28:35,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:28:35,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:28:35,593 INFO L87 Difference]: Start difference. First operand 3136 states and 15615 transitions. Second operand 12 states. [2020-02-10 20:28:35,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:28:35,825 INFO L93 Difference]: Finished difference Result 6077 states and 26993 transitions. [2020-02-10 20:28:35,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:28:35,826 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:28:35,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:28:35,840 INFO L225 Difference]: With dead ends: 6077 [2020-02-10 20:28:35,841 INFO L226 Difference]: Without dead ends: 6041 [2020-02-10 20:28:35,841 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:28:35,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6041 states. [2020-02-10 20:28:36,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6041 to 3122. [2020-02-10 20:28:36,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-02-10 20:28:36,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15582 transitions. [2020-02-10 20:28:36,030 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15582 transitions. Word has length 31 [2020-02-10 20:28:36,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:28:36,030 INFO L479 AbstractCegarLoop]: Abstraction has 3122 states and 15582 transitions. [2020-02-10 20:28:36,030 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:28:36,030 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15582 transitions. [2020-02-10 20:28:36,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:28:36,035 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:28:36,036 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:28:36,036 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:28:36,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:28:36,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1517356300, now seen corresponding path program 85 times [2020-02-10 20:28:36,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:28:36,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756459877] [2020-02-10 20:28:36,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:28:36,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:28:36,587 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:28:36,718 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:28:36,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:28:36,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756459877] [2020-02-10 20:28:36,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:28:36,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:28:36,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278488188] [2020-02-10 20:28:36,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:28:36,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:28:36,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:28:36,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:28:36,729 INFO L87 Difference]: Start difference. First operand 3122 states and 15582 transitions. Second operand 12 states. [2020-02-10 20:28:37,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:28:37,023 INFO L93 Difference]: Finished difference Result 6076 states and 27010 transitions. [2020-02-10 20:28:37,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:28:37,024 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:28:37,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:28:37,039 INFO L225 Difference]: With dead ends: 6076 [2020-02-10 20:28:37,039 INFO L226 Difference]: Without dead ends: 6057 [2020-02-10 20:28:37,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:28:37,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6057 states. [2020-02-10 20:28:37,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6057 to 3137. [2020-02-10 20:28:37,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3137 states. [2020-02-10 20:28:37,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3137 states to 3137 states and 15625 transitions. [2020-02-10 20:28:37,228 INFO L78 Accepts]: Start accepts. Automaton has 3137 states and 15625 transitions. Word has length 31 [2020-02-10 20:28:37,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:28:37,228 INFO L479 AbstractCegarLoop]: Abstraction has 3137 states and 15625 transitions. [2020-02-10 20:28:37,228 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:28:37,228 INFO L276 IsEmpty]: Start isEmpty. Operand 3137 states and 15625 transitions. [2020-02-10 20:28:37,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:28:37,234 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:28:37,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:28:37,234 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:28:37,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:28:37,234 INFO L82 PathProgramCache]: Analyzing trace with hash -179789086, now seen corresponding path program 86 times [2020-02-10 20:28:37,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:28:37,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616671286] [2020-02-10 20:28:37,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:28:37,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:28:37,833 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:28:37,963 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:28:37,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:28:37,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616671286] [2020-02-10 20:28:37,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:28:37,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:28:37,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432127244] [2020-02-10 20:28:37,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:28:37,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:28:37,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:28:37,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:28:37,973 INFO L87 Difference]: Start difference. First operand 3137 states and 15625 transitions. Second operand 12 states. [2020-02-10 20:28:38,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:28:38,270 INFO L93 Difference]: Finished difference Result 6075 states and 27001 transitions. [2020-02-10 20:28:38,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:28:38,270 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:28:38,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:28:38,286 INFO L225 Difference]: With dead ends: 6075 [2020-02-10 20:28:38,286 INFO L226 Difference]: Without dead ends: 6050 [2020-02-10 20:28:38,286 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:28:38,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6050 states. [2020-02-10 20:28:38,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6050 to 3130. [2020-02-10 20:28:38,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 20:28:38,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15605 transitions. [2020-02-10 20:28:38,476 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15605 transitions. Word has length 31 [2020-02-10 20:28:38,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:28:38,476 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15605 transitions. [2020-02-10 20:28:38,476 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:28:38,476 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15605 transitions. [2020-02-10 20:28:38,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:28:38,481 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:28:38,481 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:28:38,481 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:28:38,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:28:38,481 INFO L82 PathProgramCache]: Analyzing trace with hash 2141144142, now seen corresponding path program 87 times [2020-02-10 20:28:38,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:28:38,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918400436] [2020-02-10 20:28:38,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:28:38,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:28:39,048 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:28:39,182 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:28:39,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:28:39,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918400436] [2020-02-10 20:28:39,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:28:39,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:28:39,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673920750] [2020-02-10 20:28:39,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:28:39,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:28:39,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:28:39,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:28:39,193 INFO L87 Difference]: Start difference. First operand 3130 states and 15605 transitions. Second operand 12 states. [2020-02-10 20:28:39,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:28:39,480 INFO L93 Difference]: Finished difference Result 6082 states and 27015 transitions. [2020-02-10 20:28:39,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:28:39,481 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:28:39,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:28:39,495 INFO L225 Difference]: With dead ends: 6082 [2020-02-10 20:28:39,495 INFO L226 Difference]: Without dead ends: 6063 [2020-02-10 20:28:39,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:28:39,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6063 states. [2020-02-10 20:28:39,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6063 to 3139. [2020-02-10 20:28:39,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3139 states. [2020-02-10 20:28:39,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3139 states to 3139 states and 15622 transitions. [2020-02-10 20:28:39,680 INFO L78 Accepts]: Start accepts. Automaton has 3139 states and 15622 transitions. Word has length 31 [2020-02-10 20:28:39,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:28:39,680 INFO L479 AbstractCegarLoop]: Abstraction has 3139 states and 15622 transitions. [2020-02-10 20:28:39,680 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:28:39,681 INFO L276 IsEmpty]: Start isEmpty. Operand 3139 states and 15622 transitions. [2020-02-10 20:28:39,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:28:39,685 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:28:39,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:28:39,686 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:28:39,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:28:39,686 INFO L82 PathProgramCache]: Analyzing trace with hash -2083713118, now seen corresponding path program 88 times [2020-02-10 20:28:39,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:28:39,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795282385] [2020-02-10 20:28:39,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:28:39,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:28:40,227 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 31 [2020-02-10 20:28:40,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:28:40,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795282385] [2020-02-10 20:28:40,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:28:40,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:28:40,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046910932] [2020-02-10 20:28:40,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:28:40,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:28:40,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:28:40,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:28:40,482 INFO L87 Difference]: Start difference. First operand 3139 states and 15622 transitions. Second operand 12 states. [2020-02-10 20:28:40,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:28:40,722 INFO L93 Difference]: Finished difference Result 6085 states and 27012 transitions. [2020-02-10 20:28:40,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:28:40,722 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:28:40,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:28:40,736 INFO L225 Difference]: With dead ends: 6085 [2020-02-10 20:28:40,736 INFO L226 Difference]: Without dead ends: 6054 [2020-02-10 20:28:40,736 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:28:40,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6054 states. [2020-02-10 20:28:40,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6054 to 3130. [2020-02-10 20:28:40,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 20:28:40,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15597 transitions. [2020-02-10 20:28:40,921 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15597 transitions. Word has length 31 [2020-02-10 20:28:40,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:28:40,921 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15597 transitions. [2020-02-10 20:28:40,921 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:28:40,921 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15597 transitions. [2020-02-10 20:28:40,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:28:40,926 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:28:40,926 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:28:40,926 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:28:40,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:28:40,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1993622030, now seen corresponding path program 89 times [2020-02-10 20:28:40,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:28:40,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176356398] [2020-02-10 20:28:40,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:28:40,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:28:41,485 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:28:41,614 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:28:41,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:28:41,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176356398] [2020-02-10 20:28:41,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:28:41,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:28:41,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496140978] [2020-02-10 20:28:41,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:28:41,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:28:41,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:28:41,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:28:41,625 INFO L87 Difference]: Start difference. First operand 3130 states and 15597 transitions. Second operand 12 states. [2020-02-10 20:28:41,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:28:41,861 INFO L93 Difference]: Finished difference Result 6079 states and 27000 transitions. [2020-02-10 20:28:41,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:28:41,861 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:28:41,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:28:41,875 INFO L225 Difference]: With dead ends: 6079 [2020-02-10 20:28:41,875 INFO L226 Difference]: Without dead ends: 6061 [2020-02-10 20:28:41,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:28:42,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6061 states. [2020-02-10 20:28:42,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6061 to 3138. [2020-02-10 20:28:42,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3138 states. [2020-02-10 20:28:42,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3138 states to 3138 states and 15612 transitions. [2020-02-10 20:28:42,060 INFO L78 Accepts]: Start accepts. Automaton has 3138 states and 15612 transitions. Word has length 31 [2020-02-10 20:28:42,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:28:42,060 INFO L479 AbstractCegarLoop]: Abstraction has 3138 states and 15612 transitions. [2020-02-10 20:28:42,060 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:28:42,060 INFO L276 IsEmpty]: Start isEmpty. Operand 3138 states and 15612 transitions. [2020-02-10 20:28:42,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:28:42,065 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:28:42,065 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:28:42,065 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:28:42,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:28:42,065 INFO L82 PathProgramCache]: Analyzing trace with hash 726164852, now seen corresponding path program 90 times [2020-02-10 20:28:42,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:28:42,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670631547] [2020-02-10 20:28:42,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:28:42,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:28:42,646 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 35 [2020-02-10 20:28:42,778 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:28:42,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:28:42,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670631547] [2020-02-10 20:28:42,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:28:42,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:28:42,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160794316] [2020-02-10 20:28:42,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:28:42,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:28:42,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:28:42,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:28:42,788 INFO L87 Difference]: Start difference. First operand 3138 states and 15612 transitions. Second operand 12 states. [2020-02-10 20:28:42,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:28:42,986 INFO L93 Difference]: Finished difference Result 6083 states and 27000 transitions. [2020-02-10 20:28:42,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:28:42,986 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:28:42,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:28:43,001 INFO L225 Difference]: With dead ends: 6083 [2020-02-10 20:28:43,001 INFO L226 Difference]: Without dead ends: 6045 [2020-02-10 20:28:43,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:28:43,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6045 states. [2020-02-10 20:28:43,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6045 to 3122. [2020-02-10 20:28:43,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-02-10 20:28:43,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15575 transitions. [2020-02-10 20:28:43,190 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15575 transitions. Word has length 31 [2020-02-10 20:28:43,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:28:43,190 INFO L479 AbstractCegarLoop]: Abstraction has 3122 states and 15575 transitions. [2020-02-10 20:28:43,190 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:28:43,190 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15575 transitions. [2020-02-10 20:28:43,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:28:43,195 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:28:43,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:28:43,195 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:28:43,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:28:43,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1080021854, now seen corresponding path program 91 times [2020-02-10 20:28:43,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:28:43,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282708246] [2020-02-10 20:28:43,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:28:43,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:28:43,761 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:28:43,893 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:28:43,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:28:43,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282708246] [2020-02-10 20:28:43,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:28:43,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:28:43,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652371600] [2020-02-10 20:28:43,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:28:43,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:28:43,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:28:43,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:28:43,903 INFO L87 Difference]: Start difference. First operand 3122 states and 15575 transitions. Second operand 12 states. [2020-02-10 20:28:44,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:28:44,200 INFO L93 Difference]: Finished difference Result 6065 states and 26975 transitions. [2020-02-10 20:28:44,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:28:44,201 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:28:44,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:28:44,216 INFO L225 Difference]: With dead ends: 6065 [2020-02-10 20:28:44,216 INFO L226 Difference]: Without dead ends: 6048 [2020-02-10 20:28:44,216 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:28:44,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6048 states. [2020-02-10 20:28:44,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6048 to 3135. [2020-02-10 20:28:44,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2020-02-10 20:28:44,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 15612 transitions. [2020-02-10 20:28:44,401 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 15612 transitions. Word has length 31 [2020-02-10 20:28:44,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:28:44,401 INFO L479 AbstractCegarLoop]: Abstraction has 3135 states and 15612 transitions. [2020-02-10 20:28:44,401 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:28:44,401 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 15612 transitions. [2020-02-10 20:28:44,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:28:44,406 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:28:44,406 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:28:44,406 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:28:44,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:28:44,407 INFO L82 PathProgramCache]: Analyzing trace with hash 235050402, now seen corresponding path program 92 times [2020-02-10 20:28:44,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:28:44,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940162497] [2020-02-10 20:28:44,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:28:44,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:28:44,976 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:28:45,106 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:28:45,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:28:45,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940162497] [2020-02-10 20:28:45,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:28:45,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:28:45,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914091076] [2020-02-10 20:28:45,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:28:45,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:28:45,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:28:45,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:28:45,116 INFO L87 Difference]: Start difference. First operand 3135 states and 15612 transitions. Second operand 12 states. [2020-02-10 20:28:45,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:28:45,359 INFO L93 Difference]: Finished difference Result 6066 states and 26971 transitions. [2020-02-10 20:28:45,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:28:45,360 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:28:45,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:28:45,374 INFO L225 Difference]: With dead ends: 6066 [2020-02-10 20:28:45,375 INFO L226 Difference]: Without dead ends: 6042 [2020-02-10 20:28:45,375 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:28:45,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6042 states. [2020-02-10 20:28:45,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6042 to 3129. [2020-02-10 20:28:45,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 20:28:45,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15595 transitions. [2020-02-10 20:28:45,560 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15595 transitions. Word has length 31 [2020-02-10 20:28:45,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:28:45,560 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15595 transitions. [2020-02-10 20:28:45,560 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:28:45,560 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15595 transitions. [2020-02-10 20:28:45,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:28:45,565 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:28:45,565 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:28:45,565 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:28:45,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:28:45,565 INFO L82 PathProgramCache]: Analyzing trace with hash 443555000, now seen corresponding path program 93 times [2020-02-10 20:28:45,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:28:45,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465100156] [2020-02-10 20:28:45,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:28:45,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:28:46,180 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:28:46,310 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:28:46,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:28:46,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465100156] [2020-02-10 20:28:46,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:28:46,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:28:46,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049923655] [2020-02-10 20:28:46,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:28:46,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:28:46,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:28:46,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:28:46,321 INFO L87 Difference]: Start difference. First operand 3129 states and 15595 transitions. Second operand 12 states. [2020-02-10 20:28:46,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:28:46,582 INFO L93 Difference]: Finished difference Result 6070 states and 26978 transitions. [2020-02-10 20:28:46,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:28:46,582 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:28:46,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:28:46,598 INFO L225 Difference]: With dead ends: 6070 [2020-02-10 20:28:46,598 INFO L226 Difference]: Without dead ends: 6053 [2020-02-10 20:28:46,598 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:28:46,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6053 states. [2020-02-10 20:28:46,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6053 to 3136. [2020-02-10 20:28:46,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3136 states. [2020-02-10 20:28:46,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3136 states to 3136 states and 15608 transitions. [2020-02-10 20:28:46,787 INFO L78 Accepts]: Start accepts. Automaton has 3136 states and 15608 transitions. Word has length 31 [2020-02-10 20:28:46,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:28:46,788 INFO L479 AbstractCegarLoop]: Abstraction has 3136 states and 15608 transitions. [2020-02-10 20:28:46,788 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:28:46,788 INFO L276 IsEmpty]: Start isEmpty. Operand 3136 states and 15608 transitions. [2020-02-10 20:28:46,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:28:46,793 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:28:46,793 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:28:46,793 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:28:46,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:28:46,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1668873630, now seen corresponding path program 94 times [2020-02-10 20:28:46,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:28:46,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037210372] [2020-02-10 20:28:46,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:28:46,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:28:47,350 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 35 [2020-02-10 20:28:47,486 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:28:47,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:28:47,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037210372] [2020-02-10 20:28:47,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:28:47,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:28:47,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313040202] [2020-02-10 20:28:47,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:28:47,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:28:47,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:28:47,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:28:47,496 INFO L87 Difference]: Start difference. First operand 3136 states and 15608 transitions. Second operand 12 states. [2020-02-10 20:28:47,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:28:47,740 INFO L93 Difference]: Finished difference Result 6075 states and 26981 transitions. [2020-02-10 20:28:47,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:28:47,741 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:28:47,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:28:47,756 INFO L225 Difference]: With dead ends: 6075 [2020-02-10 20:28:47,756 INFO L226 Difference]: Without dead ends: 6046 [2020-02-10 20:28:47,756 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:28:47,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6046 states. [2020-02-10 20:28:47,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6046 to 3129. [2020-02-10 20:28:47,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 20:28:47,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15588 transitions. [2020-02-10 20:28:47,945 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15588 transitions. Word has length 31 [2020-02-10 20:28:47,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:28:47,945 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15588 transitions. [2020-02-10 20:28:47,946 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:28:47,946 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15588 transitions. [2020-02-10 20:28:47,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:28:47,951 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:28:47,951 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:28:47,951 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:28:47,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:28:47,952 INFO L82 PathProgramCache]: Analyzing trace with hash -825727688, now seen corresponding path program 95 times [2020-02-10 20:28:47,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:28:47,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480231929] [2020-02-10 20:28:47,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:28:47,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:28:48,515 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:28:48,645 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:28:48,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:28:48,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480231929] [2020-02-10 20:28:48,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:28:48,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:28:48,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417371421] [2020-02-10 20:28:48,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:28:48,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:28:48,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:28:48,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:28:48,656 INFO L87 Difference]: Start difference. First operand 3129 states and 15588 transitions. Second operand 12 states. [2020-02-10 20:28:48,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:28:48,922 INFO L93 Difference]: Finished difference Result 6073 states and 26978 transitions. [2020-02-10 20:28:48,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:28:48,923 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:28:48,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:28:48,938 INFO L225 Difference]: With dead ends: 6073 [2020-02-10 20:28:48,938 INFO L226 Difference]: Without dead ends: 6055 [2020-02-10 20:28:48,938 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:28:49,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6055 states. [2020-02-10 20:28:49,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6055 to 3137. [2020-02-10 20:28:49,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3137 states. [2020-02-10 20:28:49,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3137 states to 3137 states and 15603 transitions. [2020-02-10 20:28:49,122 INFO L78 Accepts]: Start accepts. Automaton has 3137 states and 15603 transitions. Word has length 31 [2020-02-10 20:28:49,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:28:49,122 INFO L479 AbstractCegarLoop]: Abstraction has 3137 states and 15603 transitions. [2020-02-10 20:28:49,122 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:28:49,122 INFO L276 IsEmpty]: Start isEmpty. Operand 3137 states and 15603 transitions. [2020-02-10 20:28:49,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:28:49,127 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:28:49,127 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:28:49,127 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:28:49,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:28:49,127 INFO L82 PathProgramCache]: Analyzing trace with hash -2093184866, now seen corresponding path program 96 times [2020-02-10 20:28:49,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:28:49,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985178806] [2020-02-10 20:28:49,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:28:49,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:28:49,687 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 35 [2020-02-10 20:28:49,815 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:28:49,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:28:49,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985178806] [2020-02-10 20:28:49,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:28:49,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:28:49,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146748098] [2020-02-10 20:28:49,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:28:49,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:28:49,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:28:49,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:28:49,826 INFO L87 Difference]: Start difference. First operand 3137 states and 15603 transitions. Second operand 12 states. [2020-02-10 20:28:50,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:28:50,150 INFO L93 Difference]: Finished difference Result 6077 states and 26978 transitions. [2020-02-10 20:28:50,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:28:50,151 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:28:50,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:28:50,166 INFO L225 Difference]: With dead ends: 6077 [2020-02-10 20:28:50,166 INFO L226 Difference]: Without dead ends: 6033 [2020-02-10 20:28:50,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:28:50,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6033 states. [2020-02-10 20:28:50,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6033 to 3115. [2020-02-10 20:28:50,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3115 states. [2020-02-10 20:28:50,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3115 states to 3115 states and 15555 transitions. [2020-02-10 20:28:50,355 INFO L78 Accepts]: Start accepts. Automaton has 3115 states and 15555 transitions. Word has length 31 [2020-02-10 20:28:50,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:28:50,355 INFO L479 AbstractCegarLoop]: Abstraction has 3115 states and 15555 transitions. [2020-02-10 20:28:50,355 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:28:50,355 INFO L276 IsEmpty]: Start isEmpty. Operand 3115 states and 15555 transitions. [2020-02-10 20:28:50,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:28:50,361 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:28:50,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:28:50,361 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:28:50,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:28:50,361 INFO L82 PathProgramCache]: Analyzing trace with hash -192546034, now seen corresponding path program 97 times [2020-02-10 20:28:50,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:28:50,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992420029] [2020-02-10 20:28:50,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:28:50,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:28:50,900 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:28:51,036 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:28:51,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:28:51,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992420029] [2020-02-10 20:28:51,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:28:51,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:28:51,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360165319] [2020-02-10 20:28:51,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:28:51,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:28:51,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:28:51,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:28:51,047 INFO L87 Difference]: Start difference. First operand 3115 states and 15555 transitions. Second operand 12 states. [2020-02-10 20:28:51,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:28:51,365 INFO L93 Difference]: Finished difference Result 6071 states and 27001 transitions. [2020-02-10 20:28:51,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:28:51,366 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:28:51,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:28:51,379 INFO L225 Difference]: With dead ends: 6071 [2020-02-10 20:28:51,379 INFO L226 Difference]: Without dead ends: 6051 [2020-02-10 20:28:51,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:28:51,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6051 states. [2020-02-10 20:28:51,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6051 to 3135. [2020-02-10 20:28:51,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2020-02-10 20:28:51,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 15625 transitions. [2020-02-10 20:28:51,564 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 15625 transitions. Word has length 31 [2020-02-10 20:28:51,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:28:51,565 INFO L479 AbstractCegarLoop]: Abstraction has 3135 states and 15625 transitions. [2020-02-10 20:28:51,565 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:28:51,565 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 15625 transitions. [2020-02-10 20:28:51,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:28:51,570 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:28:51,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:28:51,571 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:28:51,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:28:51,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1037517486, now seen corresponding path program 98 times [2020-02-10 20:28:51,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:28:51,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082313257] [2020-02-10 20:28:51,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:28:51,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:28:52,258 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:28:52,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:28:52,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082313257] [2020-02-10 20:28:52,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:28:52,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:28:52,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89332896] [2020-02-10 20:28:52,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:28:52,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:28:52,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:28:52,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:28:52,270 INFO L87 Difference]: Start difference. First operand 3135 states and 15625 transitions. Second operand 12 states. [2020-02-10 20:28:52,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:28:52,530 INFO L93 Difference]: Finished difference Result 6068 states and 26989 transitions. [2020-02-10 20:28:52,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:28:52,530 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:28:52,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:28:52,545 INFO L225 Difference]: With dead ends: 6068 [2020-02-10 20:28:52,546 INFO L226 Difference]: Without dead ends: 6045 [2020-02-10 20:28:52,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:28:52,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6045 states. [2020-02-10 20:28:52,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6045 to 3129. [2020-02-10 20:28:52,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 20:28:52,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15608 transitions. [2020-02-10 20:28:52,771 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15608 transitions. Word has length 31 [2020-02-10 20:28:52,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:28:52,771 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15608 transitions. [2020-02-10 20:28:52,771 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:28:52,771 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15608 transitions. [2020-02-10 20:28:52,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:28:52,776 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:28:52,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:28:52,777 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:28:52,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:28:52,777 INFO L82 PathProgramCache]: Analyzing trace with hash -616857270, now seen corresponding path program 99 times [2020-02-10 20:28:52,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:28:52,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601170949] [2020-02-10 20:28:52,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:28:52,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:28:53,319 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:28:53,449 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:28:53,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:28:53,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601170949] [2020-02-10 20:28:53,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:28:53,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:28:53,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981362151] [2020-02-10 20:28:53,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:28:53,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:28:53,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:28:53,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:28:53,459 INFO L87 Difference]: Start difference. First operand 3129 states and 15608 transitions. Second operand 12 states. [2020-02-10 20:28:53,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:28:53,781 INFO L93 Difference]: Finished difference Result 6073 states and 27000 transitions. [2020-02-10 20:28:53,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:28:53,781 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:28:53,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:28:53,796 INFO L225 Difference]: With dead ends: 6073 [2020-02-10 20:28:53,796 INFO L226 Difference]: Without dead ends: 6053 [2020-02-10 20:28:53,796 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:28:53,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6053 states. [2020-02-10 20:28:53,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6053 to 3136. [2020-02-10 20:28:53,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3136 states. [2020-02-10 20:28:53,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3136 states to 3136 states and 15621 transitions. [2020-02-10 20:28:53,986 INFO L78 Accepts]: Start accepts. Automaton has 3136 states and 15621 transitions. Word has length 31 [2020-02-10 20:28:53,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:28:53,986 INFO L479 AbstractCegarLoop]: Abstraction has 3136 states and 15621 transitions. [2020-02-10 20:28:53,986 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:28:53,986 INFO L276 IsEmpty]: Start isEmpty. Operand 3136 states and 15621 transitions. [2020-02-10 20:28:53,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:28:53,991 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:28:53,991 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:28:53,991 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:28:53,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:28:53,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1988167122, now seen corresponding path program 100 times [2020-02-10 20:28:53,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:28:53,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241964282] [2020-02-10 20:28:53,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:28:53,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:28:54,532 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:28:54,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:28:54,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:28:54,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241964282] [2020-02-10 20:28:54,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:28:54,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:28:54,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823844135] [2020-02-10 20:28:54,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:28:54,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:28:54,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:28:54,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:28:54,674 INFO L87 Difference]: Start difference. First operand 3136 states and 15621 transitions. Second operand 12 states. [2020-02-10 20:28:55,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:28:55,045 INFO L93 Difference]: Finished difference Result 6071 states and 26989 transitions. [2020-02-10 20:28:55,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:28:55,046 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:28:55,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:28:55,060 INFO L225 Difference]: With dead ends: 6071 [2020-02-10 20:28:55,061 INFO L226 Difference]: Without dead ends: 6046 [2020-02-10 20:28:55,061 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:28:55,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6046 states. [2020-02-10 20:28:55,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6046 to 3129. [2020-02-10 20:28:55,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 20:28:55,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15602 transitions. [2020-02-10 20:28:55,248 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15602 transitions. Word has length 31 [2020-02-10 20:28:55,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:28:55,248 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15602 transitions. [2020-02-10 20:28:55,248 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:28:55,248 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15602 transitions. [2020-02-10 20:28:55,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:28:55,253 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:28:55,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:28:55,253 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:28:55,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:28:55,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1886139958, now seen corresponding path program 101 times [2020-02-10 20:28:55,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:28:55,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507542580] [2020-02-10 20:28:55,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:28:55,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:28:55,804 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:28:55,935 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:28:55,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:28:55,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507542580] [2020-02-10 20:28:55,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:28:55,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:28:55,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190183247] [2020-02-10 20:28:55,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:28:55,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:28:55,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:28:55,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:28:55,944 INFO L87 Difference]: Start difference. First operand 3129 states and 15602 transitions. Second operand 12 states. [2020-02-10 20:28:56,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:28:56,166 INFO L93 Difference]: Finished difference Result 6066 states and 26979 transitions. [2020-02-10 20:28:56,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:28:56,167 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:28:56,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:28:56,182 INFO L225 Difference]: With dead ends: 6066 [2020-02-10 20:28:56,182 INFO L226 Difference]: Without dead ends: 6049 [2020-02-10 20:28:56,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:28:56,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6049 states. [2020-02-10 20:28:56,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6049 to 3135. [2020-02-10 20:28:56,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2020-02-10 20:28:56,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 15613 transitions. [2020-02-10 20:28:56,370 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 15613 transitions. Word has length 31 [2020-02-10 20:28:56,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:28:56,370 INFO L479 AbstractCegarLoop]: Abstraction has 3135 states and 15613 transitions. [2020-02-10 20:28:56,370 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:28:56,370 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 15613 transitions. [2020-02-10 20:28:56,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:28:56,376 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:28:56,376 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:28:56,376 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:28:56,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:28:56,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1563855886, now seen corresponding path program 102 times [2020-02-10 20:28:56,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:28:56,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415813670] [2020-02-10 20:28:56,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:28:56,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:28:57,045 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:28:57,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:28:57,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415813670] [2020-02-10 20:28:57,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:28:57,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:28:57,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154396620] [2020-02-10 20:28:57,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:28:57,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:28:57,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:28:57,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:28:57,056 INFO L87 Difference]: Start difference. First operand 3135 states and 15613 transitions. Second operand 12 states. [2020-02-10 20:28:57,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:28:57,294 INFO L93 Difference]: Finished difference Result 6067 states and 26975 transitions. [2020-02-10 20:28:57,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:28:57,294 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:28:57,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:28:57,309 INFO L225 Difference]: With dead ends: 6067 [2020-02-10 20:28:57,309 INFO L226 Difference]: Without dead ends: 6037 [2020-02-10 20:28:57,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:28:57,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6037 states. [2020-02-10 20:28:57,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6037 to 3123. [2020-02-10 20:28:57,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3123 states. [2020-02-10 20:28:57,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 15585 transitions. [2020-02-10 20:28:57,493 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 15585 transitions. Word has length 31 [2020-02-10 20:28:57,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:28:57,493 INFO L479 AbstractCegarLoop]: Abstraction has 3123 states and 15585 transitions. [2020-02-10 20:28:57,493 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:28:57,493 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 15585 transitions. [2020-02-10 20:28:57,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:28:57,498 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:28:57,498 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:28:57,498 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:28:57,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:28:57,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1551817972, now seen corresponding path program 103 times [2020-02-10 20:28:57,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:28:57,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919626847] [2020-02-10 20:28:57,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:28:57,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:28:58,043 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:28:58,178 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:28:58,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:28:58,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919626847] [2020-02-10 20:28:58,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:28:58,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:28:58,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505691860] [2020-02-10 20:28:58,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:28:58,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:28:58,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:28:58,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:28:58,189 INFO L87 Difference]: Start difference. First operand 3123 states and 15585 transitions. Second operand 12 states. [2020-02-10 20:28:58,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:28:58,424 INFO L93 Difference]: Finished difference Result 6082 states and 27018 transitions. [2020-02-10 20:28:58,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:28:58,425 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:28:58,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:28:58,440 INFO L225 Difference]: With dead ends: 6082 [2020-02-10 20:28:58,440 INFO L226 Difference]: Without dead ends: 6062 [2020-02-10 20:28:58,440 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:28:58,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6062 states. [2020-02-10 20:28:58,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6062 to 3137. [2020-02-10 20:28:58,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3137 states. [2020-02-10 20:28:58,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3137 states to 3137 states and 15624 transitions. [2020-02-10 20:28:58,639 INFO L78 Accepts]: Start accepts. Automaton has 3137 states and 15624 transitions. Word has length 31 [2020-02-10 20:28:58,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:28:58,639 INFO L479 AbstractCegarLoop]: Abstraction has 3137 states and 15624 transitions. [2020-02-10 20:28:58,639 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:28:58,640 INFO L276 IsEmpty]: Start isEmpty. Operand 3137 states and 15624 transitions. [2020-02-10 20:28:58,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:28:58,646 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:28:58,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:28:58,646 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:28:58,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:28:58,646 INFO L82 PathProgramCache]: Analyzing trace with hash 706846520, now seen corresponding path program 104 times [2020-02-10 20:28:58,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:28:58,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079896753] [2020-02-10 20:28:58,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:28:58,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:28:59,192 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:28:59,366 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:28:59,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:28:59,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079896753] [2020-02-10 20:28:59,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:28:59,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:28:59,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239787125] [2020-02-10 20:28:59,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:28:59,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:28:59,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:28:59,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:28:59,377 INFO L87 Difference]: Start difference. First operand 3137 states and 15624 transitions. Second operand 12 states. [2020-02-10 20:28:59,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:28:59,601 INFO L93 Difference]: Finished difference Result 6079 states and 27006 transitions. [2020-02-10 20:28:59,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:28:59,601 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:28:59,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:28:59,615 INFO L225 Difference]: With dead ends: 6079 [2020-02-10 20:28:59,615 INFO L226 Difference]: Without dead ends: 6056 [2020-02-10 20:28:59,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:28:59,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6056 states. [2020-02-10 20:28:59,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6056 to 3131. [2020-02-10 20:28:59,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 20:28:59,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15607 transitions. [2020-02-10 20:28:59,801 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15607 transitions. Word has length 31 [2020-02-10 20:28:59,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:28:59,801 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15607 transitions. [2020-02-10 20:28:59,801 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:28:59,801 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15607 transitions. [2020-02-10 20:28:59,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:28:59,806 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:28:59,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:28:59,807 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:28:59,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:28:59,807 INFO L82 PathProgramCache]: Analyzing trace with hash 491039882, now seen corresponding path program 105 times [2020-02-10 20:28:59,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:28:59,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145347639] [2020-02-10 20:28:59,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:28:59,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:29:00,451 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:29:00,583 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:29:00,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:29:00,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145347639] [2020-02-10 20:29:00,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:29:00,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:29:00,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90371904] [2020-02-10 20:29:00,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:29:00,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:29:00,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:29:00,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:29:00,595 INFO L87 Difference]: Start difference. First operand 3131 states and 15607 transitions. Second operand 12 states. [2020-02-10 20:29:00,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:29:00,821 INFO L93 Difference]: Finished difference Result 6092 states and 27033 transitions. [2020-02-10 20:29:00,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:29:00,821 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:29:00,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:29:00,835 INFO L225 Difference]: With dead ends: 6092 [2020-02-10 20:29:00,836 INFO L226 Difference]: Without dead ends: 6072 [2020-02-10 20:29:00,836 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:29:00,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6072 states. [2020-02-10 20:29:01,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6072 to 3142. [2020-02-10 20:29:01,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3142 states. [2020-02-10 20:29:01,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3142 states to 3142 states and 15627 transitions. [2020-02-10 20:29:01,023 INFO L78 Accepts]: Start accepts. Automaton has 3142 states and 15627 transitions. Word has length 31 [2020-02-10 20:29:01,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:29:01,023 INFO L479 AbstractCegarLoop]: Abstraction has 3142 states and 15627 transitions. [2020-02-10 20:29:01,024 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:29:01,024 INFO L276 IsEmpty]: Start isEmpty. Operand 3142 states and 15627 transitions. [2020-02-10 20:29:01,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:29:01,029 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:29:01,030 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:29:01,030 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:29:01,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:29:01,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1828607096, now seen corresponding path program 106 times [2020-02-10 20:29:01,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:29:01,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681449294] [2020-02-10 20:29:01,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:29:01,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:29:01,590 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:29:01,720 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:29:01,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:29:01,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681449294] [2020-02-10 20:29:01,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:29:01,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:29:01,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158826600] [2020-02-10 20:29:01,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:29:01,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:29:01,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:29:01,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:29:01,731 INFO L87 Difference]: Start difference. First operand 3142 states and 15627 transitions. Second operand 12 states. [2020-02-10 20:29:01,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:29:01,920 INFO L93 Difference]: Finished difference Result 6094 states and 27027 transitions. [2020-02-10 20:29:01,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:29:01,920 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:29:01,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:29:01,935 INFO L225 Difference]: With dead ends: 6094 [2020-02-10 20:29:01,935 INFO L226 Difference]: Without dead ends: 6061 [2020-02-10 20:29:01,935 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:29:02,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6061 states. [2020-02-10 20:29:02,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6061 to 3131. [2020-02-10 20:29:02,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 20:29:02,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15599 transitions. [2020-02-10 20:29:02,120 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15599 transitions. Word has length 31 [2020-02-10 20:29:02,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:29:02,120 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15599 transitions. [2020-02-10 20:29:02,120 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:29:02,120 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15599 transitions. [2020-02-10 20:29:02,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:29:02,125 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:29:02,125 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:29:02,126 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:29:02,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:29:02,126 INFO L82 PathProgramCache]: Analyzing trace with hash -778242806, now seen corresponding path program 107 times [2020-02-10 20:29:02,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:29:02,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196569890] [2020-02-10 20:29:02,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:29:02,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:29:02,669 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 20:29:02,801 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:29:02,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:29:02,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196569890] [2020-02-10 20:29:02,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:29:02,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:29:02,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288365639] [2020-02-10 20:29:02,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:29:02,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:29:02,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:29:02,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:29:02,811 INFO L87 Difference]: Start difference. First operand 3131 states and 15599 transitions. Second operand 12 states. [2020-02-10 20:29:03,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:29:03,045 INFO L93 Difference]: Finished difference Result 6082 states and 27003 transitions. [2020-02-10 20:29:03,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:29:03,045 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:29:03,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:29:03,062 INFO L225 Difference]: With dead ends: 6082 [2020-02-10 20:29:03,062 INFO L226 Difference]: Without dead ends: 6065 [2020-02-10 20:29:03,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 20:29:03,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6065 states. [2020-02-10 20:29:03,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6065 to 3138. [2020-02-10 20:29:03,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3138 states. [2020-02-10 20:29:03,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3138 states to 3138 states and 15612 transitions. [2020-02-10 20:29:03,245 INFO L78 Accepts]: Start accepts. Automaton has 3138 states and 15612 transitions. Word has length 31 [2020-02-10 20:29:03,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:29:03,246 INFO L479 AbstractCegarLoop]: Abstraction has 3138 states and 15612 transitions. [2020-02-10 20:29:03,246 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:29:03,246 INFO L276 IsEmpty]: Start isEmpty. Operand 3138 states and 15612 transitions. [2020-02-10 20:29:03,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:29:03,251 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:29:03,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:29:03,251 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:29:03,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:29:03,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1404295860, now seen corresponding path program 108 times [2020-02-10 20:29:03,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:29:03,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59992133] [2020-02-10 20:29:03,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:29:03,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:29:03,806 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:29:03,937 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 20:29:03,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:29:03,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59992133] [2020-02-10 20:29:03,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:29:03,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:29:03,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006174611] [2020-02-10 20:29:03,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:29:03,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:29:03,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:29:03,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:29:03,947 INFO L87 Difference]: Start difference. First operand 3138 states and 15612 transitions. Second operand 12 states. [2020-02-10 20:29:04,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:29:04,133 INFO L93 Difference]: Finished difference Result 6087 states and 27006 transitions. [2020-02-10 20:29:04,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:29:04,134 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:29:04,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:29:04,149 INFO L225 Difference]: With dead ends: 6087 [2020-02-10 20:29:04,149 INFO L226 Difference]: Without dead ends: 6050 [2020-02-10 20:29:04,149 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:29:04,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6050 states. [2020-02-10 20:29:04,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6050 to 3123. [2020-02-10 20:29:04,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3123 states. [2020-02-10 20:29:04,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 15577 transitions. [2020-02-10 20:29:04,337 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 15577 transitions. Word has length 31 [2020-02-10 20:29:04,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:29:04,337 INFO L479 AbstractCegarLoop]: Abstraction has 3123 states and 15577 transitions. [2020-02-10 20:29:04,337 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:29:04,337 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 15577 transitions. [2020-02-10 20:29:04,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:29:04,342 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:29:04,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:29:04,343 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:29:04,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:29:04,343 INFO L82 PathProgramCache]: Analyzing trace with hash 858760308, now seen corresponding path program 109 times [2020-02-10 20:29:04,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:29:04,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739704035] [2020-02-10 20:29:04,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:29:04,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:29:04,902 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:29:05,034 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:29:05,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:29:05,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739704035] [2020-02-10 20:29:05,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:29:05,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:29:05,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44625387] [2020-02-10 20:29:05,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:29:05,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:29:05,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:29:05,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:29:05,045 INFO L87 Difference]: Start difference. First operand 3123 states and 15577 transitions. Second operand 12 states. [2020-02-10 20:29:05,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:29:05,293 INFO L93 Difference]: Finished difference Result 6088 states and 27027 transitions. [2020-02-10 20:29:05,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:29:05,294 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:29:05,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:29:05,308 INFO L225 Difference]: With dead ends: 6088 [2020-02-10 20:29:05,308 INFO L226 Difference]: Without dead ends: 6068 [2020-02-10 20:29:05,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:29:05,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6068 states. [2020-02-10 20:29:05,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6068 to 3139. [2020-02-10 20:29:05,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3139 states. [2020-02-10 20:29:05,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3139 states to 3139 states and 15622 transitions. [2020-02-10 20:29:05,493 INFO L78 Accepts]: Start accepts. Automaton has 3139 states and 15622 transitions. Word has length 31 [2020-02-10 20:29:05,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:29:05,493 INFO L479 AbstractCegarLoop]: Abstraction has 3139 states and 15622 transitions. [2020-02-10 20:29:05,493 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:29:05,493 INFO L276 IsEmpty]: Start isEmpty. Operand 3139 states and 15622 transitions. [2020-02-10 20:29:05,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:29:05,498 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:29:05,498 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:29:05,498 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:29:05,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:29:05,499 INFO L82 PathProgramCache]: Analyzing trace with hash -831182596, now seen corresponding path program 110 times [2020-02-10 20:29:05,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:29:05,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958837342] [2020-02-10 20:29:05,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:29:05,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:29:05,788 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 23 [2020-02-10 20:29:06,095 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:29:06,234 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:29:06,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:29:06,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958837342] [2020-02-10 20:29:06,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:29:06,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:29:06,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361728248] [2020-02-10 20:29:06,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:29:06,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:29:06,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:29:06,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:29:06,244 INFO L87 Difference]: Start difference. First operand 3139 states and 15622 transitions. Second operand 12 states. [2020-02-10 20:29:06,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:29:06,528 INFO L93 Difference]: Finished difference Result 6086 states and 27016 transitions. [2020-02-10 20:29:06,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:29:06,528 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:29:06,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:29:06,544 INFO L225 Difference]: With dead ends: 6086 [2020-02-10 20:29:06,544 INFO L226 Difference]: Without dead ends: 6061 [2020-02-10 20:29:06,544 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:29:06,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6061 states. [2020-02-10 20:29:06,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6061 to 3132. [2020-02-10 20:29:06,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-02-10 20:29:06,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15602 transitions. [2020-02-10 20:29:06,729 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15602 transitions. Word has length 31 [2020-02-10 20:29:06,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:29:06,729 INFO L479 AbstractCegarLoop]: Abstraction has 3132 states and 15602 transitions. [2020-02-10 20:29:06,729 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:29:06,729 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15602 transitions. [2020-02-10 20:29:06,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:29:06,734 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:29:06,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:29:06,734 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:29:06,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:29:06,735 INFO L82 PathProgramCache]: Analyzing trace with hash 222293454, now seen corresponding path program 111 times [2020-02-10 20:29:06,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:29:06,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258125293] [2020-02-10 20:29:06,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:29:06,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:29:07,312 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:29:07,448 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:29:07,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:29:07,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258125293] [2020-02-10 20:29:07,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:29:07,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:29:07,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332423043] [2020-02-10 20:29:07,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:29:07,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:29:07,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:29:07,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:29:07,459 INFO L87 Difference]: Start difference. First operand 3132 states and 15602 transitions. Second operand 12 states. [2020-02-10 20:29:07,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:29:07,682 INFO L93 Difference]: Finished difference Result 6096 states and 27036 transitions. [2020-02-10 20:29:07,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:29:07,683 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:29:07,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:29:07,698 INFO L225 Difference]: With dead ends: 6096 [2020-02-10 20:29:07,698 INFO L226 Difference]: Without dead ends: 6076 [2020-02-10 20:29:07,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:29:07,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6076 states. [2020-02-10 20:29:07,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6076 to 3143. [2020-02-10 20:29:07,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3143 states. [2020-02-10 20:29:07,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3143 states to 3143 states and 15622 transitions. [2020-02-10 20:29:07,889 INFO L78 Accepts]: Start accepts. Automaton has 3143 states and 15622 transitions. Word has length 31 [2020-02-10 20:29:07,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:29:07,889 INFO L479 AbstractCegarLoop]: Abstraction has 3143 states and 15622 transitions. [2020-02-10 20:29:07,889 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:29:07,889 INFO L276 IsEmpty]: Start isEmpty. Operand 3143 states and 15622 transitions. [2020-02-10 20:29:07,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:29:07,894 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:29:07,895 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:29:07,895 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:29:07,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:29:07,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1559860668, now seen corresponding path program 112 times [2020-02-10 20:29:07,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:29:07,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958073150] [2020-02-10 20:29:07,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:29:07,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:29:08,462 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:29:08,594 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:29:08,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:29:08,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958073150] [2020-02-10 20:29:08,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:29:08,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:29:08,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638282502] [2020-02-10 20:29:08,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:29:08,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:29:08,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:29:08,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:29:08,605 INFO L87 Difference]: Start difference. First operand 3143 states and 15622 transitions. Second operand 12 states. [2020-02-10 20:29:08,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:29:08,797 INFO L93 Difference]: Finished difference Result 6098 states and 27030 transitions. [2020-02-10 20:29:08,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:29:08,797 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:29:08,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:29:08,811 INFO L225 Difference]: With dead ends: 6098 [2020-02-10 20:29:08,812 INFO L226 Difference]: Without dead ends: 6065 [2020-02-10 20:29:08,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:29:08,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6065 states. [2020-02-10 20:29:08,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6065 to 3132. [2020-02-10 20:29:08,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-02-10 20:29:08,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15593 transitions. [2020-02-10 20:29:08,997 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15593 transitions. Word has length 31 [2020-02-10 20:29:08,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:29:08,997 INFO L479 AbstractCegarLoop]: Abstraction has 3132 states and 15593 transitions. [2020-02-10 20:29:08,997 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:29:08,997 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15593 transitions. [2020-02-10 20:29:09,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:29:09,002 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:29:09,003 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:29:09,003 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:29:09,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:29:09,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1978695374, now seen corresponding path program 113 times [2020-02-10 20:29:09,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:29:09,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182546117] [2020-02-10 20:29:09,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:29:09,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:29:09,564 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:29:09,697 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:29:09,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:29:09,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182546117] [2020-02-10 20:29:09,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:29:09,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:29:09,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233951441] [2020-02-10 20:29:09,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:29:09,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:29:09,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:29:09,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:29:09,708 INFO L87 Difference]: Start difference. First operand 3132 states and 15593 transitions. Second operand 12 states. [2020-02-10 20:29:09,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:29:09,996 INFO L93 Difference]: Finished difference Result 6089 states and 27012 transitions. [2020-02-10 20:29:09,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:29:09,997 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:29:09,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:29:10,010 INFO L225 Difference]: With dead ends: 6089 [2020-02-10 20:29:10,010 INFO L226 Difference]: Without dead ends: 6071 [2020-02-10 20:29:10,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:29:10,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6071 states. [2020-02-10 20:29:10,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6071 to 3140. [2020-02-10 20:29:10,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3140 states. [2020-02-10 20:29:10,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3140 states to 3140 states and 15608 transitions. [2020-02-10 20:29:10,194 INFO L78 Accepts]: Start accepts. Automaton has 3140 states and 15608 transitions. Word has length 31 [2020-02-10 20:29:10,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:29:10,194 INFO L479 AbstractCegarLoop]: Abstraction has 3140 states and 15608 transitions. [2020-02-10 20:29:10,195 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:29:10,195 INFO L276 IsEmpty]: Start isEmpty. Operand 3140 states and 15608 transitions. [2020-02-10 20:29:10,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:29:10,200 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:29:10,200 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:29:10,200 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:29:10,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:29:10,200 INFO L82 PathProgramCache]: Analyzing trace with hash 711238196, now seen corresponding path program 114 times [2020-02-10 20:29:10,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:29:10,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814248413] [2020-02-10 20:29:10,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:29:10,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:29:10,753 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:29:10,886 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:29:10,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:29:10,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814248413] [2020-02-10 20:29:10,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:29:10,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:29:10,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14996399] [2020-02-10 20:29:10,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:29:10,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:29:10,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:29:10,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:29:10,896 INFO L87 Difference]: Start difference. First operand 3140 states and 15608 transitions. Second operand 12 states. [2020-02-10 20:29:11,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:29:11,117 INFO L93 Difference]: Finished difference Result 6093 states and 27012 transitions. [2020-02-10 20:29:11,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:29:11,117 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:29:11,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:29:11,131 INFO L225 Difference]: With dead ends: 6093 [2020-02-10 20:29:11,132 INFO L226 Difference]: Without dead ends: 6054 [2020-02-10 20:29:11,132 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:29:11,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6054 states. [2020-02-10 20:29:11,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6054 to 3123. [2020-02-10 20:29:11,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3123 states. [2020-02-10 20:29:11,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 15569 transitions. [2020-02-10 20:29:11,316 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 15569 transitions. Word has length 31 [2020-02-10 20:29:11,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:29:11,316 INFO L479 AbstractCegarLoop]: Abstraction has 3123 states and 15569 transitions. [2020-02-10 20:29:11,316 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:29:11,316 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 15569 transitions. [2020-02-10 20:29:11,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:29:11,321 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:29:11,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:29:11,322 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:29:11,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:29:11,322 INFO L82 PathProgramCache]: Analyzing trace with hash -679268808, now seen corresponding path program 115 times [2020-02-10 20:29:11,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:29:11,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910581710] [2020-02-10 20:29:11,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:29:11,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:29:11,875 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:29:12,008 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:29:12,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:29:12,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910581710] [2020-02-10 20:29:12,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:29:12,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:29:12,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985644666] [2020-02-10 20:29:12,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:29:12,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:29:12,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:29:12,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:29:12,018 INFO L87 Difference]: Start difference. First operand 3123 states and 15569 transitions. Second operand 12 states. [2020-02-10 20:29:12,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:29:12,369 INFO L93 Difference]: Finished difference Result 6071 states and 26979 transitions. [2020-02-10 20:29:12,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:29:12,370 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:29:12,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:29:12,385 INFO L225 Difference]: With dead ends: 6071 [2020-02-10 20:29:12,385 INFO L226 Difference]: Without dead ends: 6054 [2020-02-10 20:29:12,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:29:12,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6054 states. [2020-02-10 20:29:12,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6054 to 3136. [2020-02-10 20:29:12,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3136 states. [2020-02-10 20:29:12,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3136 states to 3136 states and 15606 transitions. [2020-02-10 20:29:12,617 INFO L78 Accepts]: Start accepts. Automaton has 3136 states and 15606 transitions. Word has length 31 [2020-02-10 20:29:12,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:29:12,617 INFO L479 AbstractCegarLoop]: Abstraction has 3136 states and 15606 transitions. [2020-02-10 20:29:12,618 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:29:12,618 INFO L276 IsEmpty]: Start isEmpty. Operand 3136 states and 15606 transitions. [2020-02-10 20:29:12,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:29:12,623 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:29:12,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:29:12,623 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:29:12,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:29:12,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1524240260, now seen corresponding path program 116 times [2020-02-10 20:29:12,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:29:12,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723918390] [2020-02-10 20:29:12,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:29:12,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:29:13,179 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:29:13,313 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:29:13,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:29:13,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723918390] [2020-02-10 20:29:13,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:29:13,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:29:13,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429125753] [2020-02-10 20:29:13,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:29:13,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:29:13,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:29:13,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:29:13,323 INFO L87 Difference]: Start difference. First operand 3136 states and 15606 transitions. Second operand 12 states. [2020-02-10 20:29:13,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:29:13,553 INFO L93 Difference]: Finished difference Result 6072 states and 26975 transitions. [2020-02-10 20:29:13,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:29:13,554 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:29:13,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:29:13,569 INFO L225 Difference]: With dead ends: 6072 [2020-02-10 20:29:13,569 INFO L226 Difference]: Without dead ends: 6048 [2020-02-10 20:29:13,569 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:29:13,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6048 states. [2020-02-10 20:29:13,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6048 to 3130. [2020-02-10 20:29:13,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 20:29:13,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15589 transitions. [2020-02-10 20:29:13,752 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15589 transitions. Word has length 31 [2020-02-10 20:29:13,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:29:13,752 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15589 transitions. [2020-02-10 20:29:13,752 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:29:13,752 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15589 transitions. [2020-02-10 20:29:13,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:29:13,757 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:29:13,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:29:13,757 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:29:13,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:29:13,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1315735662, now seen corresponding path program 117 times [2020-02-10 20:29:13,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:29:13,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11241486] [2020-02-10 20:29:13,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:29:13,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:29:14,300 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:29:14,441 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 20:29:14,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:29:14,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11241486] [2020-02-10 20:29:14,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:29:14,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:29:14,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612600138] [2020-02-10 20:29:14,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:29:14,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:29:14,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:29:14,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:29:14,450 INFO L87 Difference]: Start difference. First operand 3130 states and 15589 transitions. Second operand 12 states. [2020-02-10 20:29:14,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:29:14,764 INFO L93 Difference]: Finished difference Result 6076 states and 26982 transitions. [2020-02-10 20:29:14,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:29:14,765 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:29:14,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:29:14,779 INFO L225 Difference]: With dead ends: 6076 [2020-02-10 20:29:14,779 INFO L226 Difference]: Without dead ends: 6059 [2020-02-10 20:29:14,780 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:29:14,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6059 states. [2020-02-10 20:29:14,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6059 to 3137. [2020-02-10 20:29:14,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3137 states. [2020-02-10 20:29:14,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3137 states to 3137 states and 15602 transitions. [2020-02-10 20:29:14,962 INFO L78 Accepts]: Start accepts. Automaton has 3137 states and 15602 transitions. Word has length 31 [2020-02-10 20:29:14,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:29:14,962 INFO L479 AbstractCegarLoop]: Abstraction has 3137 states and 15602 transitions. [2020-02-10 20:29:14,962 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:29:14,962 INFO L276 IsEmpty]: Start isEmpty. Operand 3137 states and 15602 transitions. [2020-02-10 20:29:14,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:29:14,968 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:29:14,968 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:29:14,968 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:29:14,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:29:14,968 INFO L82 PathProgramCache]: Analyzing trace with hash 866803004, now seen corresponding path program 118 times [2020-02-10 20:29:14,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:29:14,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429189809] [2020-02-10 20:29:14,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:29:14,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:29:15,544 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:29:15,678 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:29:15,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:29:15,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429189809] [2020-02-10 20:29:15,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:29:15,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:29:15,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154298463] [2020-02-10 20:29:15,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:29:15,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:29:15,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:29:15,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:29:15,689 INFO L87 Difference]: Start difference. First operand 3137 states and 15602 transitions. Second operand 12 states. [2020-02-10 20:29:15,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:29:15,892 INFO L93 Difference]: Finished difference Result 6081 states and 26985 transitions. [2020-02-10 20:29:15,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:29:15,893 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:29:15,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:29:15,907 INFO L225 Difference]: With dead ends: 6081 [2020-02-10 20:29:15,907 INFO L226 Difference]: Without dead ends: 6052 [2020-02-10 20:29:15,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:29:16,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6052 states. [2020-02-10 20:29:16,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6052 to 3130. [2020-02-10 20:29:16,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 20:29:16,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15582 transitions. [2020-02-10 20:29:16,091 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15582 transitions. Word has length 31 [2020-02-10 20:29:16,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:29:16,091 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15582 transitions. [2020-02-10 20:29:16,091 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:29:16,091 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15582 transitions. [2020-02-10 20:29:16,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:29:16,096 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:29:16,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:29:16,097 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:29:16,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:29:16,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1709948946, now seen corresponding path program 119 times [2020-02-10 20:29:16,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:29:16,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854633998] [2020-02-10 20:29:16,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:29:16,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:29:16,657 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 20:29:16,788 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:29:16,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:29:16,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854633998] [2020-02-10 20:29:16,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:29:16,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:29:16,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983593424] [2020-02-10 20:29:16,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:29:16,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:29:16,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:29:16,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:29:16,799 INFO L87 Difference]: Start difference. First operand 3130 states and 15582 transitions. Second operand 12 states. [2020-02-10 20:29:17,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:29:17,091 INFO L93 Difference]: Finished difference Result 6079 states and 26982 transitions. [2020-02-10 20:29:17,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:29:17,092 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:29:17,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:29:17,107 INFO L225 Difference]: With dead ends: 6079 [2020-02-10 20:29:17,107 INFO L226 Difference]: Without dead ends: 6061 [2020-02-10 20:29:17,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:29:17,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6061 states. [2020-02-10 20:29:17,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6061 to 3138. [2020-02-10 20:29:17,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3138 states. [2020-02-10 20:29:17,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3138 states to 3138 states and 15597 transitions. [2020-02-10 20:29:17,293 INFO L78 Accepts]: Start accepts. Automaton has 3138 states and 15597 transitions. Word has length 31 [2020-02-10 20:29:17,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:29:17,293 INFO L479 AbstractCegarLoop]: Abstraction has 3138 states and 15597 transitions. [2020-02-10 20:29:17,293 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:29:17,293 INFO L276 IsEmpty]: Start isEmpty. Operand 3138 states and 15597 transitions. [2020-02-10 20:29:17,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:29:17,298 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:29:17,298 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:29:17,299 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:29:17,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:29:17,299 INFO L82 PathProgramCache]: Analyzing trace with hash 442491768, now seen corresponding path program 120 times [2020-02-10 20:29:17,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:29:17,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193228265] [2020-02-10 20:29:17,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:29:17,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:29:17,870 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:29:18,000 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:29:18,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:29:18,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193228265] [2020-02-10 20:29:18,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:29:18,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:29:18,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649341074] [2020-02-10 20:29:18,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:29:18,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:29:18,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:29:18,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:29:18,011 INFO L87 Difference]: Start difference. First operand 3138 states and 15597 transitions. Second operand 12 states. [2020-02-10 20:29:18,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:29:18,291 INFO L93 Difference]: Finished difference Result 6083 states and 26982 transitions. [2020-02-10 20:29:18,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:29:18,292 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:29:18,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:29:18,307 INFO L225 Difference]: With dead ends: 6083 [2020-02-10 20:29:18,307 INFO L226 Difference]: Without dead ends: 6027 [2020-02-10 20:29:18,308 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:29:18,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6027 states. [2020-02-10 20:29:18,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6027 to 3104. [2020-02-10 20:29:18,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3104 states. [2020-02-10 20:29:18,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3104 states to 3104 states and 15527 transitions. [2020-02-10 20:29:18,497 INFO L78 Accepts]: Start accepts. Automaton has 3104 states and 15527 transitions. Word has length 31 [2020-02-10 20:29:18,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:29:18,497 INFO L479 AbstractCegarLoop]: Abstraction has 3104 states and 15527 transitions. [2020-02-10 20:29:18,497 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:29:18,497 INFO L276 IsEmpty]: Start isEmpty. Operand 3104 states and 15527 transitions. [2020-02-10 20:29:18,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:29:18,502 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:29:18,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:29:18,503 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:29:18,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:29:18,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1165855998, now seen corresponding path program 121 times [2020-02-10 20:29:18,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:29:18,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027336348] [2020-02-10 20:29:18,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:29:18,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:29:19,063 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:29:19,192 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:29:19,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:29:19,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027336348] [2020-02-10 20:29:19,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:29:19,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:29:19,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983338416] [2020-02-10 20:29:19,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:29:19,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:29:19,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:29:19,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:29:19,202 INFO L87 Difference]: Start difference. First operand 3104 states and 15527 transitions. Second operand 12 states. [2020-02-10 20:29:19,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:29:19,576 INFO L93 Difference]: Finished difference Result 6078 states and 27027 transitions. [2020-02-10 20:29:19,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:29:19,576 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:29:19,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:29:19,592 INFO L225 Difference]: With dead ends: 6078 [2020-02-10 20:29:19,592 INFO L226 Difference]: Without dead ends: 6059 [2020-02-10 20:29:19,593 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:29:19,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6059 states. [2020-02-10 20:29:19,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6059 to 3139. [2020-02-10 20:29:19,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3139 states. [2020-02-10 20:29:19,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3139 states to 3139 states and 15656 transitions. [2020-02-10 20:29:19,776 INFO L78 Accepts]: Start accepts. Automaton has 3139 states and 15656 transitions. Word has length 31 [2020-02-10 20:29:19,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:29:19,776 INFO L479 AbstractCegarLoop]: Abstraction has 3139 states and 15656 transitions. [2020-02-10 20:29:19,776 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:29:19,777 INFO L276 IsEmpty]: Start isEmpty. Operand 3139 states and 15656 transitions. [2020-02-10 20:29:19,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:29:19,782 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:29:19,782 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:29:19,782 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:29:19,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:29:19,782 INFO L82 PathProgramCache]: Analyzing trace with hash -101601180, now seen corresponding path program 122 times [2020-02-10 20:29:19,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:29:19,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253729257] [2020-02-10 20:29:19,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:29:19,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:29:20,337 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:29:20,470 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:29:20,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:29:20,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253729257] [2020-02-10 20:29:20,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:29:20,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:29:20,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769192354] [2020-02-10 20:29:20,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:29:20,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:29:20,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:29:20,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:29:20,481 INFO L87 Difference]: Start difference. First operand 3139 states and 15656 transitions. Second operand 12 states. [2020-02-10 20:29:20,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:29:20,798 INFO L93 Difference]: Finished difference Result 6079 states and 27021 transitions. [2020-02-10 20:29:20,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:29:20,798 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:29:20,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:29:20,813 INFO L225 Difference]: With dead ends: 6079 [2020-02-10 20:29:20,813 INFO L226 Difference]: Without dead ends: 6051 [2020-02-10 20:29:20,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 20:29:20,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6051 states. [2020-02-10 20:29:20,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6051 to 3131. [2020-02-10 20:29:20,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 20:29:20,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15634 transitions. [2020-02-10 20:29:20,997 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15634 transitions. Word has length 31 [2020-02-10 20:29:20,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:29:20,997 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15634 transitions. [2020-02-10 20:29:20,997 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:29:20,997 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15634 transitions. [2020-02-10 20:29:21,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:29:21,002 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:29:21,003 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:29:21,003 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:29:21,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:29:21,003 INFO L82 PathProgramCache]: Analyzing trace with hash 317233526, now seen corresponding path program 123 times [2020-02-10 20:29:21,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:29:21,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747014871] [2020-02-10 20:29:21,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:29:21,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:29:21,562 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:29:21,690 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:29:21,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:29:21,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747014871] [2020-02-10 20:29:21,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:29:21,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:29:21,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423854843] [2020-02-10 20:29:21,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:29:21,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:29:21,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:29:21,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:29:21,701 INFO L87 Difference]: Start difference. First operand 3131 states and 15634 transitions. Second operand 12 states. [2020-02-10 20:29:21,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:29:21,943 INFO L93 Difference]: Finished difference Result 6075 states and 27013 transitions. [2020-02-10 20:29:21,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:29:21,943 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:29:21,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:29:21,959 INFO L225 Difference]: With dead ends: 6075 [2020-02-10 20:29:21,959 INFO L226 Difference]: Without dead ends: 6056 [2020-02-10 20:29:21,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:29:22,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6056 states. [2020-02-10 20:29:22,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6056 to 3138. [2020-02-10 20:29:22,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3138 states. [2020-02-10 20:29:22,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3138 states to 3138 states and 15647 transitions. [2020-02-10 20:29:22,143 INFO L78 Accepts]: Start accepts. Automaton has 3138 states and 15647 transitions. Word has length 31 [2020-02-10 20:29:22,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:29:22,143 INFO L479 AbstractCegarLoop]: Abstraction has 3138 states and 15647 transitions. [2020-02-10 20:29:22,143 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:29:22,144 INFO L276 IsEmpty]: Start isEmpty. Operand 3138 states and 15647 transitions. [2020-02-10 20:29:22,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:29:22,149 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:29:22,149 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:29:22,149 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:29:22,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:29:22,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1654800740, now seen corresponding path program 124 times [2020-02-10 20:29:22,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:29:22,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130689816] [2020-02-10 20:29:22,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:29:22,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:29:22,712 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:29:22,842 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:29:22,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:29:22,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130689816] [2020-02-10 20:29:22,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:29:22,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:29:22,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497592217] [2020-02-10 20:29:22,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:29:22,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:29:22,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:29:22,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:29:22,853 INFO L87 Difference]: Start difference. First operand 3138 states and 15647 transitions. Second operand 12 states. [2020-02-10 20:29:23,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:29:23,133 INFO L93 Difference]: Finished difference Result 6074 states and 27004 transitions. [2020-02-10 20:29:23,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:29:23,134 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:29:23,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:29:23,149 INFO L225 Difference]: With dead ends: 6074 [2020-02-10 20:29:23,149 INFO L226 Difference]: Without dead ends: 6049 [2020-02-10 20:29:23,149 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:29:23,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6049 states. [2020-02-10 20:29:23,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6049 to 3131. [2020-02-10 20:29:23,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 20:29:23,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15627 transitions. [2020-02-10 20:29:23,344 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15627 transitions. Word has length 31 [2020-02-10 20:29:23,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:29:23,344 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15627 transitions. [2020-02-10 20:29:23,344 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:29:23,344 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15627 transitions. [2020-02-10 20:29:23,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:29:23,350 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:29:23,350 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:29:23,350 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:29:23,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:29:23,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1586690506, now seen corresponding path program 125 times [2020-02-10 20:29:23,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:29:23,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640457908] [2020-02-10 20:29:23,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:29:23,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:29:23,901 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:29:24,036 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:29:24,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:29:24,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640457908] [2020-02-10 20:29:24,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:29:24,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:29:24,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725203238] [2020-02-10 20:29:24,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:29:24,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:29:24,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:29:24,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:29:24,048 INFO L87 Difference]: Start difference. First operand 3131 states and 15627 transitions. Second operand 12 states. [2020-02-10 20:29:24,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:29:24,292 INFO L93 Difference]: Finished difference Result 6077 states and 27010 transitions. [2020-02-10 20:29:24,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:29:24,296 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:29:24,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:29:24,309 INFO L225 Difference]: With dead ends: 6077 [2020-02-10 20:29:24,309 INFO L226 Difference]: Without dead ends: 6057 [2020-02-10 20:29:24,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:29:24,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6057 states. [2020-02-10 20:29:24,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6057 to 3138. [2020-02-10 20:29:24,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3138 states. [2020-02-10 20:29:24,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3138 states to 3138 states and 15640 transitions. [2020-02-10 20:29:24,498 INFO L78 Accepts]: Start accepts. Automaton has 3138 states and 15640 transitions. Word has length 31 [2020-02-10 20:29:24,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:29:24,498 INFO L479 AbstractCegarLoop]: Abstraction has 3138 states and 15640 transitions. [2020-02-10 20:29:24,498 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:29:24,498 INFO L276 IsEmpty]: Start isEmpty. Operand 3138 states and 15640 transitions. [2020-02-10 20:29:24,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:29:24,503 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:29:24,503 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:29:24,503 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:29:24,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:29:24,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1018333886, now seen corresponding path program 126 times [2020-02-10 20:29:24,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:29:24,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280501559] [2020-02-10 20:29:24,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:29:24,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:29:25,058 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:29:25,191 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:29:25,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:29:25,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280501559] [2020-02-10 20:29:25,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:29:25,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:29:25,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629130217] [2020-02-10 20:29:25,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:29:25,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:29:25,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:29:25,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:29:25,202 INFO L87 Difference]: Start difference. First operand 3138 states and 15640 transitions. Second operand 12 states. [2020-02-10 20:29:25,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:29:25,461 INFO L93 Difference]: Finished difference Result 6075 states and 26999 transitions. [2020-02-10 20:29:25,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:29:25,462 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:29:25,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:29:25,476 INFO L225 Difference]: With dead ends: 6075 [2020-02-10 20:29:25,476 INFO L226 Difference]: Without dead ends: 6043 [2020-02-10 20:29:25,477 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:29:25,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6043 states. [2020-02-10 20:29:25,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6043 to 3124. [2020-02-10 20:29:25,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:29:25,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15607 transitions. [2020-02-10 20:29:25,660 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15607 transitions. Word has length 31 [2020-02-10 20:29:25,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:29:25,660 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15607 transitions. [2020-02-10 20:29:25,660 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:29:25,661 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15607 transitions. [2020-02-10 20:29:25,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:29:25,666 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:29:25,666 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:29:25,666 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:29:25,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:29:25,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1384747292, now seen corresponding path program 127 times [2020-02-10 20:29:25,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:29:25,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971451221] [2020-02-10 20:29:25,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:29:25,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:29:26,158 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 30 [2020-02-10 20:29:26,286 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:29:26,414 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:29:26,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:29:26,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971451221] [2020-02-10 20:29:26,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:29:26,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:29:26,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336183155] [2020-02-10 20:29:26,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:29:26,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:29:26,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:29:26,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:29:26,424 INFO L87 Difference]: Start difference. First operand 3124 states and 15607 transitions. Second operand 12 states. [2020-02-10 20:29:26,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:29:26,679 INFO L93 Difference]: Finished difference Result 6092 states and 27051 transitions. [2020-02-10 20:29:26,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:29:26,679 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:29:26,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:29:26,693 INFO L225 Difference]: With dead ends: 6092 [2020-02-10 20:29:26,694 INFO L226 Difference]: Without dead ends: 6073 [2020-02-10 20:29:26,694 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:29:26,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6073 states. [2020-02-10 20:29:26,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6073 to 3143. [2020-02-10 20:29:26,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3143 states. [2020-02-10 20:29:26,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3143 states to 3143 states and 15659 transitions. [2020-02-10 20:29:26,886 INFO L78 Accepts]: Start accepts. Automaton has 3143 states and 15659 transitions. Word has length 31 [2020-02-10 20:29:26,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:29:26,886 INFO L479 AbstractCegarLoop]: Abstraction has 3143 states and 15659 transitions. [2020-02-10 20:29:26,886 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:29:26,886 INFO L276 IsEmpty]: Start isEmpty. Operand 3143 states and 15659 transitions. [2020-02-10 20:29:26,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:29:26,891 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:29:26,892 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:29:26,892 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:29:26,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:29:26,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1642762826, now seen corresponding path program 128 times [2020-02-10 20:29:26,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:29:26,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906101174] [2020-02-10 20:29:26,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:29:26,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:29:27,472 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:29:27,603 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:29:27,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:29:27,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906101174] [2020-02-10 20:29:27,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:29:27,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:29:27,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059621216] [2020-02-10 20:29:27,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:29:27,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:29:27,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:29:27,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:29:27,614 INFO L87 Difference]: Start difference. First operand 3143 states and 15659 transitions. Second operand 12 states. [2020-02-10 20:29:27,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:29:27,850 INFO L93 Difference]: Finished difference Result 6093 states and 27045 transitions. [2020-02-10 20:29:27,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:29:27,851 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:29:27,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:29:27,867 INFO L225 Difference]: With dead ends: 6093 [2020-02-10 20:29:27,867 INFO L226 Difference]: Without dead ends: 6065 [2020-02-10 20:29:27,867 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:29:27,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6065 states. [2020-02-10 20:29:28,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6065 to 3135. [2020-02-10 20:29:28,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2020-02-10 20:29:28,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 15636 transitions. [2020-02-10 20:29:28,051 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 15636 transitions. Word has length 31 [2020-02-10 20:29:28,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:29:28,051 INFO L479 AbstractCegarLoop]: Abstraction has 3135 states and 15636 transitions. [2020-02-10 20:29:28,051 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:29:28,051 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 15636 transitions. [2020-02-10 20:29:28,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:29:28,056 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:29:28,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:29:28,056 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:29:28,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:29:28,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1425130678, now seen corresponding path program 129 times [2020-02-10 20:29:28,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:29:28,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895633530] [2020-02-10 20:29:28,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:29:28,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:29:28,611 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:29:28,744 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:29:28,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:29:28,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895633530] [2020-02-10 20:29:28,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:29:28,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:29:28,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045444222] [2020-02-10 20:29:28,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:29:28,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:29:28,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:29:28,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:29:28,755 INFO L87 Difference]: Start difference. First operand 3135 states and 15636 transitions. Second operand 12 states. [2020-02-10 20:29:29,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:29:29,037 INFO L93 Difference]: Finished difference Result 6095 states and 27048 transitions. [2020-02-10 20:29:29,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:29:29,037 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:29:29,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:29:29,052 INFO L225 Difference]: With dead ends: 6095 [2020-02-10 20:29:29,052 INFO L226 Difference]: Without dead ends: 6076 [2020-02-10 20:29:29,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:29:29,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6076 states. [2020-02-10 20:29:29,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6076 to 3144. [2020-02-10 20:29:29,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3144 states. [2020-02-10 20:29:29,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3144 states to 3144 states and 15653 transitions. [2020-02-10 20:29:29,240 INFO L78 Accepts]: Start accepts. Automaton has 3144 states and 15653 transitions. Word has length 31 [2020-02-10 20:29:29,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:29:29,240 INFO L479 AbstractCegarLoop]: Abstraction has 3144 states and 15653 transitions. [2020-02-10 20:29:29,240 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:29:29,240 INFO L276 IsEmpty]: Start isEmpty. Operand 3144 states and 15653 transitions. [2020-02-10 20:29:29,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:29:29,245 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:29:29,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:29:29,245 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:29:29,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:29:29,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1495240714, now seen corresponding path program 130 times [2020-02-10 20:29:29,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:29:29,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813261700] [2020-02-10 20:29:29,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:29:29,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:29:29,815 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:29:29,949 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:29:29,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:29:29,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813261700] [2020-02-10 20:29:29,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:29:29,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:29:29,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986821293] [2020-02-10 20:29:29,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:29:29,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:29:29,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:29:29,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:29:29,959 INFO L87 Difference]: Start difference. First operand 3144 states and 15653 transitions. Second operand 12 states. [2020-02-10 20:29:30,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:29:30,215 INFO L93 Difference]: Finished difference Result 6098 states and 27045 transitions. [2020-02-10 20:29:30,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:29:30,216 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:29:30,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:29:30,231 INFO L225 Difference]: With dead ends: 6098 [2020-02-10 20:29:30,231 INFO L226 Difference]: Without dead ends: 6067 [2020-02-10 20:29:30,232 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:29:30,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6067 states. [2020-02-10 20:29:30,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6067 to 3135. [2020-02-10 20:29:30,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2020-02-10 20:29:30,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 15627 transitions. [2020-02-10 20:29:30,419 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 15627 transitions. Word has length 31 [2020-02-10 20:29:30,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:29:30,419 INFO L479 AbstractCegarLoop]: Abstraction has 3135 states and 15627 transitions. [2020-02-10 20:29:30,419 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:29:30,419 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 15627 transitions. [2020-02-10 20:29:30,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:29:30,424 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:29:30,425 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:29:30,425 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:29:30,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:29:30,425 INFO L82 PathProgramCache]: Analyzing trace with hash -478793354, now seen corresponding path program 131 times [2020-02-10 20:29:30,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:29:30,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734058924] [2020-02-10 20:29:30,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:29:30,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:29:30,995 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:29:31,125 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:29:31,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:29:31,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734058924] [2020-02-10 20:29:31,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:29:31,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:29:31,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633938480] [2020-02-10 20:29:31,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:29:31,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:29:31,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:29:31,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:29:31,136 INFO L87 Difference]: Start difference. First operand 3135 states and 15627 transitions. Second operand 12 states. [2020-02-10 20:29:31,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:29:31,394 INFO L93 Difference]: Finished difference Result 6099 states and 27047 transitions. [2020-02-10 20:29:31,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:29:31,395 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:29:31,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:29:31,409 INFO L225 Difference]: With dead ends: 6099 [2020-02-10 20:29:31,409 INFO L226 Difference]: Without dead ends: 6079 [2020-02-10 20:29:31,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:29:31,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6079 states. [2020-02-10 20:29:31,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6079 to 3146. [2020-02-10 20:29:31,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3146 states. [2020-02-10 20:29:31,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3146 states to 3146 states and 15647 transitions. [2020-02-10 20:29:31,597 INFO L78 Accepts]: Start accepts. Automaton has 3146 states and 15647 transitions. Word has length 31 [2020-02-10 20:29:31,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:29:31,597 INFO L479 AbstractCegarLoop]: Abstraction has 3146 states and 15647 transitions. [2020-02-10 20:29:31,597 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:29:31,598 INFO L276 IsEmpty]: Start isEmpty. Operand 3146 states and 15647 transitions. [2020-02-10 20:29:31,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:29:31,603 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:29:31,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:29:31,603 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:29:31,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:29:31,603 INFO L82 PathProgramCache]: Analyzing trace with hash 858773860, now seen corresponding path program 132 times [2020-02-10 20:29:31,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:29:31,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479858026] [2020-02-10 20:29:31,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:29:31,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:29:32,188 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:29:32,318 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:29:32,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:29:32,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479858026] [2020-02-10 20:29:32,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:29:32,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:29:32,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970819845] [2020-02-10 20:29:32,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:29:32,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:29:32,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:29:32,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:29:32,328 INFO L87 Difference]: Start difference. First operand 3146 states and 15647 transitions. Second operand 12 states. [2020-02-10 20:29:32,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:29:32,562 INFO L93 Difference]: Finished difference Result 6101 states and 27041 transitions. [2020-02-10 20:29:32,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:29:32,563 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:29:32,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:29:32,582 INFO L225 Difference]: With dead ends: 6101 [2020-02-10 20:29:32,582 INFO L226 Difference]: Without dead ends: 6057 [2020-02-10 20:29:32,582 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:29:32,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6057 states. [2020-02-10 20:29:32,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6057 to 3124. [2020-02-10 20:29:32,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:29:32,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15597 transitions. [2020-02-10 20:29:32,790 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15597 transitions. Word has length 31 [2020-02-10 20:29:32,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:29:32,790 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15597 transitions. [2020-02-10 20:29:32,790 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:29:32,790 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15597 transitions. [2020-02-10 20:29:32,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:29:32,795 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:29:32,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:29:32,795 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:29:32,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:29:32,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1524104676, now seen corresponding path program 133 times [2020-02-10 20:29:32,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:29:32,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936485000] [2020-02-10 20:29:32,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:29:32,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:29:33,392 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:29:33,520 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:29:33,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:29:33,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936485000] [2020-02-10 20:29:33,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:29:33,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:29:33,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154031465] [2020-02-10 20:29:33,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:29:33,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:29:33,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:29:33,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:29:33,531 INFO L87 Difference]: Start difference. First operand 3124 states and 15597 transitions. Second operand 12 states. [2020-02-10 20:29:33,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:29:33,788 INFO L93 Difference]: Finished difference Result 6080 states and 27013 transitions. [2020-02-10 20:29:33,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:29:33,789 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:29:33,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:29:33,803 INFO L225 Difference]: With dead ends: 6080 [2020-02-10 20:29:33,804 INFO L226 Difference]: Without dead ends: 6061 [2020-02-10 20:29:33,804 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:29:33,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6061 states. [2020-02-10 20:29:33,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6061 to 3139. [2020-02-10 20:29:33,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3139 states. [2020-02-10 20:29:33,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3139 states to 3139 states and 15640 transitions. [2020-02-10 20:29:33,993 INFO L78 Accepts]: Start accepts. Automaton has 3139 states and 15640 transitions. Word has length 31 [2020-02-10 20:29:33,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:29:33,993 INFO L479 AbstractCegarLoop]: Abstraction has 3139 states and 15640 transitions. [2020-02-10 20:29:33,993 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:29:33,993 INFO L276 IsEmpty]: Start isEmpty. Operand 3139 states and 15640 transitions. [2020-02-10 20:29:33,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:29:33,998 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:29:33,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:29:33,999 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:29:33,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:29:33,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1433295406, now seen corresponding path program 134 times [2020-02-10 20:29:33,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:29:33,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167356397] [2020-02-10 20:29:33,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:29:34,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:29:34,551 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:29:34,679 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:29:34,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:29:34,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167356397] [2020-02-10 20:29:34,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:29:34,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:29:34,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369117464] [2020-02-10 20:29:34,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:29:34,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:29:34,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:29:34,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:29:34,690 INFO L87 Difference]: Start difference. First operand 3139 states and 15640 transitions. Second operand 12 states. [2020-02-10 20:29:34,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:29:34,989 INFO L93 Difference]: Finished difference Result 6079 states and 27004 transitions. [2020-02-10 20:29:34,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:29:34,990 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:29:34,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:29:35,005 INFO L225 Difference]: With dead ends: 6079 [2020-02-10 20:29:35,005 INFO L226 Difference]: Without dead ends: 6054 [2020-02-10 20:29:35,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:29:35,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6054 states. [2020-02-10 20:29:35,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6054 to 3132. [2020-02-10 20:29:35,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-02-10 20:29:35,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15620 transitions. [2020-02-10 20:29:35,191 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15620 transitions. Word has length 31 [2020-02-10 20:29:35,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:29:35,191 INFO L479 AbstractCegarLoop]: Abstraction has 3132 states and 15620 transitions. [2020-02-10 20:29:35,192 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:29:35,192 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15620 transitions. [2020-02-10 20:29:35,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:29:35,197 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:29:35,197 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:29:35,197 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:29:35,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:29:35,197 INFO L82 PathProgramCache]: Analyzing trace with hash 887637822, now seen corresponding path program 135 times [2020-02-10 20:29:35,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:29:35,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673480319] [2020-02-10 20:29:35,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:29:35,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:29:35,752 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:29:35,885 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:29:35,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:29:35,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673480319] [2020-02-10 20:29:35,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:29:35,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:29:35,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306149465] [2020-02-10 20:29:35,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:29:35,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:29:35,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:29:35,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:29:35,896 INFO L87 Difference]: Start difference. First operand 3132 states and 15620 transitions. Second operand 12 states. [2020-02-10 20:29:36,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:29:36,171 INFO L93 Difference]: Finished difference Result 6086 states and 27018 transitions. [2020-02-10 20:29:36,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:29:36,171 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:29:36,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:29:36,186 INFO L225 Difference]: With dead ends: 6086 [2020-02-10 20:29:36,187 INFO L226 Difference]: Without dead ends: 6067 [2020-02-10 20:29:36,187 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:29:36,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6067 states. [2020-02-10 20:29:36,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6067 to 3141. [2020-02-10 20:29:36,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3141 states. [2020-02-10 20:29:36,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3141 states to 3141 states and 15637 transitions. [2020-02-10 20:29:36,371 INFO L78 Accepts]: Start accepts. Automaton has 3141 states and 15637 transitions. Word has length 31 [2020-02-10 20:29:36,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:29:36,371 INFO L479 AbstractCegarLoop]: Abstraction has 3141 states and 15637 transitions. [2020-02-10 20:29:36,371 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:29:36,371 INFO L276 IsEmpty]: Start isEmpty. Operand 3141 states and 15637 transitions. [2020-02-10 20:29:36,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:29:36,376 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:29:36,376 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:29:36,376 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:29:36,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:29:36,377 INFO L82 PathProgramCache]: Analyzing trace with hash 957747858, now seen corresponding path program 136 times [2020-02-10 20:29:36,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:29:36,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589215468] [2020-02-10 20:29:36,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:29:36,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:29:36,926 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:29:37,057 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:29:37,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:29:37,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589215468] [2020-02-10 20:29:37,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:29:37,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:29:37,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899529025] [2020-02-10 20:29:37,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:29:37,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:29:37,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:29:37,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:29:37,067 INFO L87 Difference]: Start difference. First operand 3141 states and 15637 transitions. Second operand 12 states. [2020-02-10 20:29:37,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:29:37,309 INFO L93 Difference]: Finished difference Result 6089 states and 27015 transitions. [2020-02-10 20:29:37,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:29:37,310 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:29:37,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:29:37,323 INFO L225 Difference]: With dead ends: 6089 [2020-02-10 20:29:37,323 INFO L226 Difference]: Without dead ends: 6058 [2020-02-10 20:29:37,324 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:29:37,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6058 states. [2020-02-10 20:29:37,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6058 to 3132. [2020-02-10 20:29:37,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-02-10 20:29:37,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15612 transitions. [2020-02-10 20:29:37,511 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15612 transitions. Word has length 31 [2020-02-10 20:29:37,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:29:37,511 INFO L479 AbstractCegarLoop]: Abstraction has 3132 states and 15612 transitions. [2020-02-10 20:29:37,511 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:29:37,511 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15612 transitions. [2020-02-10 20:29:37,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:29:37,516 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:29:37,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:29:37,517 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:29:37,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:29:37,517 INFO L82 PathProgramCache]: Analyzing trace with hash 740115710, now seen corresponding path program 137 times [2020-02-10 20:29:37,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:29:37,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755676547] [2020-02-10 20:29:37,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:29:37,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:29:38,097 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:29:38,223 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:29:38,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:29:38,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755676547] [2020-02-10 20:29:38,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:29:38,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:29:38,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904138167] [2020-02-10 20:29:38,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:29:38,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:29:38,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:29:38,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:29:38,234 INFO L87 Difference]: Start difference. First operand 3132 states and 15612 transitions. Second operand 12 states. [2020-02-10 20:29:38,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:29:38,534 INFO L93 Difference]: Finished difference Result 6083 states and 27003 transitions. [2020-02-10 20:29:38,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:29:38,535 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:29:38,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:29:38,549 INFO L225 Difference]: With dead ends: 6083 [2020-02-10 20:29:38,549 INFO L226 Difference]: Without dead ends: 6065 [2020-02-10 20:29:38,549 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:29:38,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6065 states. [2020-02-10 20:29:38,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6065 to 3140. [2020-02-10 20:29:38,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3140 states. [2020-02-10 20:29:38,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3140 states to 3140 states and 15627 transitions. [2020-02-10 20:29:38,737 INFO L78 Accepts]: Start accepts. Automaton has 3140 states and 15627 transitions. Word has length 31 [2020-02-10 20:29:38,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:29:38,738 INFO L479 AbstractCegarLoop]: Abstraction has 3140 states and 15627 transitions. [2020-02-10 20:29:38,738 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:29:38,738 INFO L276 IsEmpty]: Start isEmpty. Operand 3140 states and 15627 transitions. [2020-02-10 20:29:38,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:29:38,743 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:29:38,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:29:38,743 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:29:38,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:29:38,743 INFO L82 PathProgramCache]: Analyzing trace with hash -527341468, now seen corresponding path program 138 times [2020-02-10 20:29:38,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:29:38,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491654864] [2020-02-10 20:29:38,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:29:38,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:29:39,317 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 20:29:39,451 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:29:39,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:29:39,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491654864] [2020-02-10 20:29:39,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:29:39,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:29:39,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288075333] [2020-02-10 20:29:39,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:29:39,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:29:39,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:29:39,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:29:39,461 INFO L87 Difference]: Start difference. First operand 3140 states and 15627 transitions. Second operand 12 states. [2020-02-10 20:29:39,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:29:39,690 INFO L93 Difference]: Finished difference Result 6087 states and 27003 transitions. [2020-02-10 20:29:39,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:29:39,691 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:29:39,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:29:39,705 INFO L225 Difference]: With dead ends: 6087 [2020-02-10 20:29:39,706 INFO L226 Difference]: Without dead ends: 6049 [2020-02-10 20:29:39,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:29:39,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6049 states. [2020-02-10 20:29:39,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6049 to 3124. [2020-02-10 20:29:39,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:29:39,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15589 transitions. [2020-02-10 20:29:39,937 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15589 transitions. Word has length 31 [2020-02-10 20:29:39,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:29:39,937 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15589 transitions. [2020-02-10 20:29:39,937 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:29:39,937 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15589 transitions. [2020-02-10 20:29:39,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:29:39,942 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:29:39,942 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:29:39,942 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:29:39,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:29:39,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1364544650, now seen corresponding path program 139 times [2020-02-10 20:29:39,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:29:39,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457505016] [2020-02-10 20:29:39,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:29:39,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:29:40,497 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:29:40,629 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:29:40,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:29:40,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457505016] [2020-02-10 20:29:40,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:29:40,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:29:40,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565336176] [2020-02-10 20:29:40,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:29:40,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:29:40,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:29:40,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:29:40,641 INFO L87 Difference]: Start difference. First operand 3124 states and 15589 transitions. Second operand 12 states. [2020-02-10 20:29:40,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:29:40,904 INFO L93 Difference]: Finished difference Result 6086 states and 27017 transitions. [2020-02-10 20:29:40,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:29:40,905 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:29:40,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:29:40,919 INFO L225 Difference]: With dead ends: 6086 [2020-02-10 20:29:40,920 INFO L226 Difference]: Without dead ends: 6066 [2020-02-10 20:29:40,920 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:29:41,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6066 states. [2020-02-10 20:29:41,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6066 to 3140. [2020-02-10 20:29:41,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3140 states. [2020-02-10 20:29:41,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3140 states to 3140 states and 15634 transitions. [2020-02-10 20:29:41,104 INFO L78 Accepts]: Start accepts. Automaton has 3140 states and 15634 transitions. Word has length 31 [2020-02-10 20:29:41,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:29:41,104 INFO L479 AbstractCegarLoop]: Abstraction has 3140 states and 15634 transitions. [2020-02-10 20:29:41,104 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:29:41,104 INFO L276 IsEmpty]: Start isEmpty. Operand 3140 states and 15634 transitions. [2020-02-10 20:29:41,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:29:41,109 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:29:41,109 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:29:41,109 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:29:41,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:29:41,110 INFO L82 PathProgramCache]: Analyzing trace with hash -325398254, now seen corresponding path program 140 times [2020-02-10 20:29:41,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:29:41,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048326462] [2020-02-10 20:29:41,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:29:41,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:29:41,659 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:29:41,791 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:29:41,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:29:41,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048326462] [2020-02-10 20:29:41,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:29:41,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:29:41,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808455717] [2020-02-10 20:29:41,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:29:41,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:29:41,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:29:41,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:29:41,801 INFO L87 Difference]: Start difference. First operand 3140 states and 15634 transitions. Second operand 12 states. [2020-02-10 20:29:42,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:29:42,156 INFO L93 Difference]: Finished difference Result 6084 states and 27006 transitions. [2020-02-10 20:29:42,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:29:42,157 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:29:42,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:29:42,172 INFO L225 Difference]: With dead ends: 6084 [2020-02-10 20:29:42,172 INFO L226 Difference]: Without dead ends: 6059 [2020-02-10 20:29:42,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:29:42,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6059 states. [2020-02-10 20:29:42,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6059 to 3133. [2020-02-10 20:29:42,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-02-10 20:29:42,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15614 transitions. [2020-02-10 20:29:42,354 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15614 transitions. Word has length 31 [2020-02-10 20:29:42,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:29:42,355 INFO L479 AbstractCegarLoop]: Abstraction has 3133 states and 15614 transitions. [2020-02-10 20:29:42,355 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:29:42,355 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15614 transitions. [2020-02-10 20:29:42,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:29:42,360 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:29:42,360 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:29:42,360 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:29:42,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:29:42,360 INFO L82 PathProgramCache]: Analyzing trace with hash 728077796, now seen corresponding path program 141 times [2020-02-10 20:29:42,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:29:42,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574988318] [2020-02-10 20:29:42,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:29:42,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:29:42,931 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:29:43,062 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:29:43,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:29:43,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574988318] [2020-02-10 20:29:43,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:29:43,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:29:43,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400805713] [2020-02-10 20:29:43,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:29:43,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:29:43,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:29:43,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:29:43,073 INFO L87 Difference]: Start difference. First operand 3133 states and 15614 transitions. Second operand 12 states. [2020-02-10 20:29:43,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:29:43,431 INFO L93 Difference]: Finished difference Result 6094 states and 27026 transitions. [2020-02-10 20:29:43,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:29:43,432 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:29:43,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:29:43,446 INFO L225 Difference]: With dead ends: 6094 [2020-02-10 20:29:43,447 INFO L226 Difference]: Without dead ends: 6074 [2020-02-10 20:29:43,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:29:43,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6074 states. [2020-02-10 20:29:43,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6074 to 3144. [2020-02-10 20:29:43,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3144 states. [2020-02-10 20:29:43,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3144 states to 3144 states and 15634 transitions. [2020-02-10 20:29:43,631 INFO L78 Accepts]: Start accepts. Automaton has 3144 states and 15634 transitions. Word has length 31 [2020-02-10 20:29:43,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:29:43,631 INFO L479 AbstractCegarLoop]: Abstraction has 3144 states and 15634 transitions. [2020-02-10 20:29:43,632 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:29:43,632 INFO L276 IsEmpty]: Start isEmpty. Operand 3144 states and 15634 transitions. [2020-02-10 20:29:43,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:29:43,637 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:29:43,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:29:43,637 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:29:43,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:29:43,637 INFO L82 PathProgramCache]: Analyzing trace with hash 2065645010, now seen corresponding path program 142 times [2020-02-10 20:29:43,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:29:43,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788402655] [2020-02-10 20:29:43,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:29:43,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:29:44,200 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:29:44,328 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:29:44,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:29:44,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788402655] [2020-02-10 20:29:44,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:29:44,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:29:44,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611521914] [2020-02-10 20:29:44,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:29:44,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:29:44,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:29:44,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:29:44,339 INFO L87 Difference]: Start difference. First operand 3144 states and 15634 transitions. Second operand 12 states. [2020-02-10 20:29:44,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:29:44,591 INFO L93 Difference]: Finished difference Result 6096 states and 27020 transitions. [2020-02-10 20:29:44,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:29:44,592 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:29:44,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:29:44,607 INFO L225 Difference]: With dead ends: 6096 [2020-02-10 20:29:44,607 INFO L226 Difference]: Without dead ends: 6063 [2020-02-10 20:29:44,607 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:29:44,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6063 states. [2020-02-10 20:29:44,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6063 to 3133. [2020-02-10 20:29:44,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-02-10 20:29:44,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15605 transitions. [2020-02-10 20:29:44,798 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15605 transitions. Word has length 31 [2020-02-10 20:29:44,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:29:44,798 INFO L479 AbstractCegarLoop]: Abstraction has 3133 states and 15605 transitions. [2020-02-10 20:29:44,798 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:29:44,798 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15605 transitions. [2020-02-10 20:29:44,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:29:44,803 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:29:44,803 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:29:44,804 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:29:44,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:29:44,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1810487580, now seen corresponding path program 143 times [2020-02-10 20:29:44,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:29:44,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199562666] [2020-02-10 20:29:44,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:29:44,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:29:45,347 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:29:45,477 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:29:45,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:29:45,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199562666] [2020-02-10 20:29:45,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:29:45,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:29:45,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055849451] [2020-02-10 20:29:45,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:29:45,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:29:45,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:29:45,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:29:45,487 INFO L87 Difference]: Start difference. First operand 3133 states and 15605 transitions. Second operand 12 states. [2020-02-10 20:29:45,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:29:45,838 INFO L93 Difference]: Finished difference Result 6087 states and 27002 transitions. [2020-02-10 20:29:45,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:29:45,838 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:29:45,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:29:45,854 INFO L225 Difference]: With dead ends: 6087 [2020-02-10 20:29:45,854 INFO L226 Difference]: Without dead ends: 6069 [2020-02-10 20:29:45,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:29:45,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6069 states. [2020-02-10 20:29:46,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6069 to 3141. [2020-02-10 20:29:46,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3141 states. [2020-02-10 20:29:46,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3141 states to 3141 states and 15620 transitions. [2020-02-10 20:29:46,043 INFO L78 Accepts]: Start accepts. Automaton has 3141 states and 15620 transitions. Word has length 31 [2020-02-10 20:29:46,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:29:46,044 INFO L479 AbstractCegarLoop]: Abstraction has 3141 states and 15620 transitions. [2020-02-10 20:29:46,044 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:29:46,044 INFO L276 IsEmpty]: Start isEmpty. Operand 3141 states and 15620 transitions. [2020-02-10 20:29:46,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:29:46,049 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:29:46,049 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:29:46,049 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:29:46,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:29:46,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1217022538, now seen corresponding path program 144 times [2020-02-10 20:29:46,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:29:46,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012356348] [2020-02-10 20:29:46,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:29:46,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:29:46,616 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:29:46,796 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 33 [2020-02-10 20:29:46,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:29:46,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012356348] [2020-02-10 20:29:46,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:29:46,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:29:46,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268469217] [2020-02-10 20:29:46,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:29:46,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:29:46,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:29:46,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:29:46,806 INFO L87 Difference]: Start difference. First operand 3141 states and 15620 transitions. Second operand 12 states. [2020-02-10 20:29:46,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:29:46,991 INFO L93 Difference]: Finished difference Result 6091 states and 27002 transitions. [2020-02-10 20:29:46,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:29:46,992 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:29:46,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:29:47,007 INFO L225 Difference]: With dead ends: 6091 [2020-02-10 20:29:47,007 INFO L226 Difference]: Without dead ends: 6041 [2020-02-10 20:29:47,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:29:47,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6041 states. [2020-02-10 20:29:47,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6041 to 3113. [2020-02-10 20:29:47,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3113 states. [2020-02-10 20:29:47,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3113 states to 3113 states and 15561 transitions. [2020-02-10 20:29:47,197 INFO L78 Accepts]: Start accepts. Automaton has 3113 states and 15561 transitions. Word has length 31 [2020-02-10 20:29:47,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:29:47,197 INFO L479 AbstractCegarLoop]: Abstraction has 3113 states and 15561 transitions. [2020-02-10 20:29:47,197 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:29:47,197 INFO L276 IsEmpty]: Start isEmpty. Operand 3113 states and 15561 transitions. [2020-02-10 20:29:47,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:29:47,203 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:29:47,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 20:29:47,203 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:29:47,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:29:47,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1443947760, now seen corresponding path program 145 times [2020-02-10 20:29:47,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:29:47,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488046263] [2020-02-10 20:29:47,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:29:47,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:29:47,745 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:29:47,878 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:29:47,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:29:47,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488046263] [2020-02-10 20:29:47,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:29:47,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:29:47,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405462890] [2020-02-10 20:29:47,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:29:47,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:29:47,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:29:47,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:29:47,889 INFO L87 Difference]: Start difference. First operand 3113 states and 15561 transitions. Second operand 12 states. [2020-02-10 20:29:48,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:29:48,114 INFO L93 Difference]: Finished difference Result 6025 states and 26870 transitions. [2020-02-10 20:29:48,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:29:48,115 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:29:48,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:29:48,129 INFO L225 Difference]: With dead ends: 6025 [2020-02-10 20:29:48,129 INFO L226 Difference]: Without dead ends: 6006 [2020-02-10 20:29:48,130 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:29:48,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6006 states. [2020-02-10 20:29:48,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6006 to 3128. [2020-02-10 20:29:48,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 20:29:48,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15613 transitions. [2020-02-10 20:29:48,314 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15613 transitions. Word has length 31 [2020-02-10 20:29:48,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:29:48,314 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15613 transitions. [2020-02-10 20:29:48,314 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:29:48,314 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15613 transitions. [2020-02-10 20:29:48,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:29:48,319 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:29:48,319 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:29:48,319 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:29:48,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:29:48,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1021462034, now seen corresponding path program 146 times [2020-02-10 20:29:48,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:29:48,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58144276] [2020-02-10 20:29:48,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:29:48,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:29:48,864 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 36 [2020-02-10 20:29:48,996 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:29:49,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:29:49,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58144276] [2020-02-10 20:29:49,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:29:49,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:29:49,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100665347] [2020-02-10 20:29:49,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:29:49,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:29:49,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:29:49,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:29:49,007 INFO L87 Difference]: Start difference. First operand 3128 states and 15613 transitions. Second operand 12 states. [2020-02-10 20:29:49,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:29:49,232 INFO L93 Difference]: Finished difference Result 6022 states and 26859 transitions. [2020-02-10 20:29:49,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:29:49,233 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:29:49,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:29:49,248 INFO L225 Difference]: With dead ends: 6022 [2020-02-10 20:29:49,248 INFO L226 Difference]: Without dead ends: 6001 [2020-02-10 20:29:49,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:29:49,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6001 states. [2020-02-10 20:29:49,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6001 to 3123. [2020-02-10 20:29:49,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3123 states. [2020-02-10 20:29:49,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 15599 transitions. [2020-02-10 20:29:49,432 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 15599 transitions. Word has length 31 [2020-02-10 20:29:49,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:29:49,432 INFO L479 AbstractCegarLoop]: Abstraction has 3123 states and 15599 transitions. [2020-02-10 20:29:49,432 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:29:49,432 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 15599 transitions. [2020-02-10 20:29:49,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:29:49,437 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:29:49,437 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:29:49,437 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:29:49,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:29:49,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1019636524, now seen corresponding path program 147 times [2020-02-10 20:29:49,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:29:49,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739896933] [2020-02-10 20:29:49,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:29:49,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:29:49,984 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:29:50,127 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 20:29: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:29:50,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739896933] [2020-02-10 20:29:50,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:29:50,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:29:50,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282113942] [2020-02-10 20:29:50,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:29:50,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:29:50,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:29:50,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:29:50,137 INFO L87 Difference]: Start difference. First operand 3123 states and 15599 transitions. Second operand 12 states. [2020-02-10 20:29:50,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:29:50,360 INFO L93 Difference]: Finished difference Result 6032 states and 26882 transitions. [2020-02-10 20:29:50,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:29:50,360 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:29:50,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:29:50,375 INFO L225 Difference]: With dead ends: 6032 [2020-02-10 20:29:50,375 INFO L226 Difference]: Without dead ends: 6013 [2020-02-10 20:29:50,375 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:29:50,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6013 states. [2020-02-10 20:29:50,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6013 to 3131. [2020-02-10 20:29:50,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 20:29:50,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15614 transitions. [2020-02-10 20:29:50,564 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15614 transitions. Word has length 31 [2020-02-10 20:29:50,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:29:50,564 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15614 transitions. [2020-02-10 20:29:50,564 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:29:50,564 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15614 transitions. [2020-02-10 20:29:50,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:29:50,569 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:29:50,569 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:29:50,569 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:29:50,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:29:50,569 INFO L82 PathProgramCache]: Analyzing trace with hash -247820654, now seen corresponding path program 148 times [2020-02-10 20:29:50,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:29:50,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638034980] [2020-02-10 20:29:50,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:29:50,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:29:51,114 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:29:51,244 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:29:51,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:29:51,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638034980] [2020-02-10 20:29:51,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:29:51,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:29:51,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853024917] [2020-02-10 20:29:51,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:29:51,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:29:51,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:29:51,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:29:51,253 INFO L87 Difference]: Start difference. First operand 3131 states and 15614 transitions. Second operand 12 states. [2020-02-10 20:29:51,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:29:51,485 INFO L93 Difference]: Finished difference Result 6033 states and 26876 transitions. [2020-02-10 20:29:51,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:29:51,485 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:29:51,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:29:51,500 INFO L225 Difference]: With dead ends: 6033 [2020-02-10 20:29:51,500 INFO L226 Difference]: Without dead ends: 6005 [2020-02-10 20:29:51,500 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:29:51,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6005 states. [2020-02-10 20:29:51,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6005 to 3123. [2020-02-10 20:29:51,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3123 states. [2020-02-10 20:29:51,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 15594 transitions. [2020-02-10 20:29:51,688 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 15594 transitions. Word has length 31 [2020-02-10 20:29:51,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:29:51,688 INFO L479 AbstractCegarLoop]: Abstraction has 3123 states and 15594 transitions. [2020-02-10 20:29:51,688 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:29:51,688 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 15594 transitions. [2020-02-10 20:29:51,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:29:51,693 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:29: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:29:51,693 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:29:51,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:29:51,694 INFO L82 PathProgramCache]: Analyzing trace with hash 384995180, now seen corresponding path program 149 times [2020-02-10 20:29:51,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:29:51,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115809356] [2020-02-10 20:29:51,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:29:51,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:29:52,236 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:29:52,367 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:29: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 20:29:52,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115809356] [2020-02-10 20:29:52,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:29:52,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:29:52,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851190626] [2020-02-10 20:29:52,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:29:52,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:29:52,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:29:52,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:29:52,378 INFO L87 Difference]: Start difference. First operand 3123 states and 15594 transitions. Second operand 12 states. [2020-02-10 20:29:52,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:29:52,664 INFO L93 Difference]: Finished difference Result 6023 states and 26856 transitions. [2020-02-10 20:29:52,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:29:52,664 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:29:52,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:29:52,678 INFO L225 Difference]: With dead ends: 6023 [2020-02-10 20:29:52,678 INFO L226 Difference]: Without dead ends: 6007 [2020-02-10 20:29:52,678 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:29:52,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6007 states. [2020-02-10 20:29:52,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6007 to 3128. [2020-02-10 20:29:52,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 20:29:52,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15603 transitions. [2020-02-10 20:29:52,863 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15603 transitions. Word has length 31 [2020-02-10 20:29:52,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:29:52,863 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15603 transitions. [2020-02-10 20:29:52,864 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:29:52,864 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15603 transitions. [2020-02-10 20:29:52,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:29:52,869 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:29:52,869 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:29:52,869 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:29:52,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:29:52,869 INFO L82 PathProgramCache]: Analyzing trace with hash -459976272, now seen corresponding path program 150 times [2020-02-10 20:29:52,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:29:52,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883342310] [2020-02-10 20:29:52,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:29:52,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:29:53,444 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:29:53,574 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:29:53,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:29:53,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883342310] [2020-02-10 20:29:53,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:29:53,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:29:53,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190739245] [2020-02-10 20:29:53,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:29:53,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:29:53,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:29:53,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:29:53,585 INFO L87 Difference]: Start difference. First operand 3128 states and 15603 transitions. Second operand 12 states. [2020-02-10 20:29:53,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:29:53,818 INFO L93 Difference]: Finished difference Result 6027 states and 26859 transitions. [2020-02-10 20:29:53,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:29:53,818 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:29:53,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:29:53,833 INFO L225 Difference]: With dead ends: 6027 [2020-02-10 20:29:53,834 INFO L226 Difference]: Without dead ends: 5997 [2020-02-10 20:29:53,834 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:29:53,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5997 states. [2020-02-10 20:29:54,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5997 to 3118. [2020-02-10 20:29:54,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3118 states. [2020-02-10 20:29:54,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3118 states to 3118 states and 15580 transitions. [2020-02-10 20:29:54,018 INFO L78 Accepts]: Start accepts. Automaton has 3118 states and 15580 transitions. Word has length 31 [2020-02-10 20:29:54,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:29:54,018 INFO L479 AbstractCegarLoop]: Abstraction has 3118 states and 15580 transitions. [2020-02-10 20:29:54,018 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:29:54,018 INFO L276 IsEmpty]: Start isEmpty. Operand 3118 states and 15580 transitions. [2020-02-10 20:29:54,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:29:54,023 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:29:54,023 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:29:54,023 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:29:54,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:29:54,023 INFO L82 PathProgramCache]: Analyzing trace with hash 906454904, now seen corresponding path program 151 times [2020-02-10 20:29:54,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:29:54,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613660478] [2020-02-10 20:29:54,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:29:54,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:29:54,563 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:29:54,693 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:29:54,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:29:54,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613660478] [2020-02-10 20:29:54,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:29:54,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:29:54,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648917097] [2020-02-10 20:29:54,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:29:54,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:29:54,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:29:54,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:29:54,704 INFO L87 Difference]: Start difference. First operand 3118 states and 15580 transitions. Second operand 12 states. [2020-02-10 20:29:54,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:29:54,933 INFO L93 Difference]: Finished difference Result 6022 states and 26858 transitions. [2020-02-10 20:29:54,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:29:54,934 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:29:54,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:29:54,949 INFO L225 Difference]: With dead ends: 6022 [2020-02-10 20:29:54,949 INFO L226 Difference]: Without dead ends: 6003 [2020-02-10 20:29:54,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:29:55,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6003 states. [2020-02-10 20:29:55,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6003 to 3128. [2020-02-10 20:29:55,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 20:29:55,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15608 transitions. [2020-02-10 20:29:55,134 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15608 transitions. Word has length 31 [2020-02-10 20:29:55,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:29:55,135 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15608 transitions. [2020-02-10 20:29:55,135 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:29:55,135 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15608 transitions. [2020-02-10 20:29:55,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:29:55,141 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:29:55,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:29:55,141 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:29:55,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:29:55,141 INFO L82 PathProgramCache]: Analyzing trace with hash 483969178, now seen corresponding path program 152 times [2020-02-10 20:29:55,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:29:55,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135800417] [2020-02-10 20:29:55,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:29:55,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:29:55,695 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:29:55,829 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:29:55,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:29:55,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135800417] [2020-02-10 20:29:55,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:29:55,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:29:55,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160553947] [2020-02-10 20:29:55,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:29:55,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:29:55,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:29:55,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:29:55,840 INFO L87 Difference]: Start difference. First operand 3128 states and 15608 transitions. Second operand 12 states. [2020-02-10 20:29:56,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:29:56,114 INFO L93 Difference]: Finished difference Result 6019 states and 26847 transitions. [2020-02-10 20:29:56,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:29:56,115 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:29:56,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:29:56,130 INFO L225 Difference]: With dead ends: 6019 [2020-02-10 20:29:56,130 INFO L226 Difference]: Without dead ends: 5998 [2020-02-10 20:29:56,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:29:56,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5998 states. [2020-02-10 20:29:56,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5998 to 3123. [2020-02-10 20:29:56,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3123 states. [2020-02-10 20:29:56,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 15594 transitions. [2020-02-10 20:29:56,318 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 15594 transitions. Word has length 31 [2020-02-10 20:29:56,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:29:56,318 INFO L479 AbstractCegarLoop]: Abstraction has 3123 states and 15594 transitions. [2020-02-10 20:29:56,319 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:29:56,319 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 15594 transitions. [2020-02-10 20:29:56,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:29:56,324 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:29:56,324 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:29:56,324 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:29:56,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:29:56,324 INFO L82 PathProgramCache]: Analyzing trace with hash -366478804, now seen corresponding path program 153 times [2020-02-10 20:29:56,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:29:56,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360841748] [2020-02-10 20:29:56,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:29:56,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:29:56,861 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:29:56,996 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:29: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:29:57,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360841748] [2020-02-10 20:29:57,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:29:57,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:29:57,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236956010] [2020-02-10 20:29:57,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:29:57,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:29:57,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:29:57,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:29:57,007 INFO L87 Difference]: Start difference. First operand 3123 states and 15594 transitions. Second operand 12 states. [2020-02-10 20:29:57,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:29:57,244 INFO L93 Difference]: Finished difference Result 6026 states and 26863 transitions. [2020-02-10 20:29:57,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:29:57,245 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:29:57,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:29:57,260 INFO L225 Difference]: With dead ends: 6026 [2020-02-10 20:29:57,260 INFO L226 Difference]: Without dead ends: 6007 [2020-02-10 20:29:57,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:29:57,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6007 states. [2020-02-10 20:29:57,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6007 to 3130. [2020-02-10 20:29:57,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 20:29:57,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15607 transitions. [2020-02-10 20:29:57,450 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15607 transitions. Word has length 31 [2020-02-10 20:29:57,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:29:57,450 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15607 transitions. [2020-02-10 20:29:57,450 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:29:57,450 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15607 transitions. [2020-02-10 20:29:57,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:29:57,455 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:29:57,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:29:57,455 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:29:57,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:29:57,455 INFO L82 PathProgramCache]: Analyzing trace with hash 971088410, now seen corresponding path program 154 times [2020-02-10 20:29:57,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:29:57,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619767216] [2020-02-10 20:29:57,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:29:57,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:29:58,001 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:29:58,135 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:29:58,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:29:58,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619767216] [2020-02-10 20:29:58,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:29:58,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:29:58,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574375155] [2020-02-10 20:29:58,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:29:58,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:29:58,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:29:58,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:29:58,145 INFO L87 Difference]: Start difference. First operand 3130 states and 15607 transitions. Second operand 12 states. [2020-02-10 20:29:58,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:29:58,425 INFO L93 Difference]: Finished difference Result 6025 states and 26854 transitions. [2020-02-10 20:29:58,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:29:58,425 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:29:58,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:29:58,440 INFO L225 Difference]: With dead ends: 6025 [2020-02-10 20:29:58,440 INFO L226 Difference]: Without dead ends: 6000 [2020-02-10 20:29:58,440 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:29:58,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6000 states. [2020-02-10 20:29:58,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6000 to 3123. [2020-02-10 20:29:58,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3123 states. [2020-02-10 20:29:58,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 15589 transitions. [2020-02-10 20:29:58,627 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 15589 transitions. Word has length 31 [2020-02-10 20:29:58,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:29:58,628 INFO L479 AbstractCegarLoop]: Abstraction has 3123 states and 15589 transitions. [2020-02-10 20:29:58,628 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:29:58,628 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 15589 transitions. [2020-02-10 20:29:58,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:29:58,633 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:29:58,633 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:29:58,633 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:29:58,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:29:58,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1001120148, now seen corresponding path program 155 times [2020-02-10 20:29:58,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:29:58,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976880284] [2020-02-10 20:29:58,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:29:58,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:29:59,184 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:29:59,320 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:29:59,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:29:59,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976880284] [2020-02-10 20:29:59,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:29:59,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:29:59,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059514312] [2020-02-10 20:29:59,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:29:59,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:29:59,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:29:59,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:29:59,334 INFO L87 Difference]: Start difference. First operand 3123 states and 15589 transitions. Second operand 12 states. [2020-02-10 20:29:59,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:29:59,605 INFO L93 Difference]: Finished difference Result 6018 states and 26840 transitions. [2020-02-10 20:29:59,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:29:59,606 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:29:59,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:29:59,624 INFO L225 Difference]: With dead ends: 6018 [2020-02-10 20:29:59,624 INFO L226 Difference]: Without dead ends: 6002 [2020-02-10 20:29:59,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 20:29:59,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6002 states. [2020-02-10 20:29:59,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6002 to 3128. [2020-02-10 20:29:59,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 20:29:59,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15598 transitions. [2020-02-10 20:29:59,809 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15598 transitions. Word has length 31 [2020-02-10 20:29:59,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:29:59,810 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15598 transitions. [2020-02-10 20:29:59,810 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:29:59,810 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15598 transitions. [2020-02-10 20:29:59,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:29:59,815 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:29:59,815 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:29:59,815 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:29:59,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:29:59,816 INFO L82 PathProgramCache]: Analyzing trace with hash 758932792, now seen corresponding path program 156 times [2020-02-10 20:29:59,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:29:59,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643063076] [2020-02-10 20:29:59,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:29:59,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:00,267 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 31 [2020-02-10 20:30:00,392 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:30:00,526 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:30:00,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:30:00,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643063076] [2020-02-10 20:30:00,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:00,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:30:00,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530412395] [2020-02-10 20:30:00,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:30:00,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:00,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:30:00,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:30:00,537 INFO L87 Difference]: Start difference. First operand 3128 states and 15598 transitions. Second operand 12 states. [2020-02-10 20:30:00,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:00,809 INFO L93 Difference]: Finished difference Result 6020 states and 26839 transitions. [2020-02-10 20:30:00,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:30:00,810 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:30:00,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:00,824 INFO L225 Difference]: With dead ends: 6020 [2020-02-10 20:30:00,825 INFO L226 Difference]: Without dead ends: 5992 [2020-02-10 20:30:00,825 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:30:00,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5992 states. [2020-02-10 20:30:01,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5992 to 3118. [2020-02-10 20:30:01,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3118 states. [2020-02-10 20:30:01,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3118 states to 3118 states and 15575 transitions. [2020-02-10 20:30:01,013 INFO L78 Accepts]: Start accepts. Automaton has 3118 states and 15575 transitions. Word has length 31 [2020-02-10 20:30:01,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:01,014 INFO L479 AbstractCegarLoop]: Abstraction has 3118 states and 15575 transitions. [2020-02-10 20:30:01,014 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:30:01,014 INFO L276 IsEmpty]: Start isEmpty. Operand 3118 states and 15575 transitions. [2020-02-10 20:30:01,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:30:01,019 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:01,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:30:01,019 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:30:01,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:01,019 INFO L82 PathProgramCache]: Analyzing trace with hash 213397240, now seen corresponding path program 157 times [2020-02-10 20:30:01,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:01,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386567835] [2020-02-10 20:30:01,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:01,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:01,584 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:30:01,716 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:30:01,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:30:01,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386567835] [2020-02-10 20:30:01,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:01,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:30:01,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075665166] [2020-02-10 20:30:01,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:30:01,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:01,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:30:01,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:30:01,727 INFO L87 Difference]: Start difference. First operand 3118 states and 15575 transitions. Second operand 12 states. [2020-02-10 20:30:01,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:01,958 INFO L93 Difference]: Finished difference Result 6040 states and 26901 transitions. [2020-02-10 20:30:01,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:30:01,959 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:30:01,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:01,973 INFO L225 Difference]: With dead ends: 6040 [2020-02-10 20:30:01,973 INFO L226 Difference]: Without dead ends: 6021 [2020-02-10 20:30:01,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 20:30:02,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6021 states. [2020-02-10 20:30:02,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6021 to 3133. [2020-02-10 20:30:02,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-02-10 20:30:02,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15617 transitions. [2020-02-10 20:30:02,178 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15617 transitions. Word has length 31 [2020-02-10 20:30:02,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:02,178 INFO L479 AbstractCegarLoop]: Abstraction has 3133 states and 15617 transitions. [2020-02-10 20:30:02,178 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:30:02,178 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15617 transitions. [2020-02-10 20:30:02,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:30:02,184 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:02,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:30:02,185 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:30:02,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:02,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1054059938, now seen corresponding path program 158 times [2020-02-10 20:30:02,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:02,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398173610] [2020-02-10 20:30:02,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:02,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:02,747 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:30:02,881 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:30:02,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:30:02,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398173610] [2020-02-10 20:30:02,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:02,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:30:02,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862120338] [2020-02-10 20:30:02,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:30:02,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:02,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:30:02,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:30:02,891 INFO L87 Difference]: Start difference. First operand 3133 states and 15617 transitions. Second operand 12 states. [2020-02-10 20:30:03,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:03,123 INFO L93 Difference]: Finished difference Result 6041 states and 26895 transitions. [2020-02-10 20:30:03,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:30:03,123 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:30:03,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:03,139 INFO L225 Difference]: With dead ends: 6041 [2020-02-10 20:30:03,139 INFO L226 Difference]: Without dead ends: 6013 [2020-02-10 20:30:03,139 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:30:03,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6013 states. [2020-02-10 20:30:03,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6013 to 3125. [2020-02-10 20:30:03,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 20:30:03,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15595 transitions. [2020-02-10 20:30:03,328 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15595 transitions. Word has length 31 [2020-02-10 20:30:03,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:03,328 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15595 transitions. [2020-02-10 20:30:03,328 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:30:03,329 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15595 transitions. [2020-02-10 20:30:03,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:30:03,334 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:03,334 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:30:03,335 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:30:03,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:03,335 INFO L82 PathProgramCache]: Analyzing trace with hash -635225232, now seen corresponding path program 159 times [2020-02-10 20:30:03,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:03,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920665260] [2020-02-10 20:30:03,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:03,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:03,877 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:30:04,011 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:30:04,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:30:04,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920665260] [2020-02-10 20:30:04,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:04,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:30:04,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612123165] [2020-02-10 20:30:04,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:30:04,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:04,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:30:04,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:30:04,022 INFO L87 Difference]: Start difference. First operand 3125 states and 15595 transitions. Second operand 12 states. [2020-02-10 20:30:04,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:04,265 INFO L93 Difference]: Finished difference Result 6037 states and 26887 transitions. [2020-02-10 20:30:04,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:30:04,266 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:30:04,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:04,281 INFO L225 Difference]: With dead ends: 6037 [2020-02-10 20:30:04,281 INFO L226 Difference]: Without dead ends: 6018 [2020-02-10 20:30:04,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:30:04,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6018 states. [2020-02-10 20:30:04,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6018 to 3132. [2020-02-10 20:30:04,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-02-10 20:30:04,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15608 transitions. [2020-02-10 20:30:04,473 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15608 transitions. Word has length 31 [2020-02-10 20:30:04,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:04,473 INFO L479 AbstractCegarLoop]: Abstraction has 3132 states and 15608 transitions. [2020-02-10 20:30:04,473 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:30:04,473 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15608 transitions. [2020-02-10 20:30:04,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:30:04,478 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:04,478 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:30:04,478 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:30:04,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:04,479 INFO L82 PathProgramCache]: Analyzing trace with hash 702341982, now seen corresponding path program 160 times [2020-02-10 20:30:04,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:04,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966107895] [2020-02-10 20:30:04,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:04,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:05,024 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:30:05,157 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:30:05,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:30:05,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966107895] [2020-02-10 20:30:05,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:05,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:30:05,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94618844] [2020-02-10 20:30:05,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:30:05,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:05,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:30:05,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:30:05,168 INFO L87 Difference]: Start difference. First operand 3132 states and 15608 transitions. Second operand 12 states. [2020-02-10 20:30:05,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:05,410 INFO L93 Difference]: Finished difference Result 6036 states and 26878 transitions. [2020-02-10 20:30:05,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:30:05,410 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:30:05,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:05,425 INFO L225 Difference]: With dead ends: 6036 [2020-02-10 20:30:05,426 INFO L226 Difference]: Without dead ends: 6011 [2020-02-10 20:30:05,426 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:30:05,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6011 states. [2020-02-10 20:30:05,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6011 to 3125. [2020-02-10 20:30:05,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 20:30:05,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15588 transitions. [2020-02-10 20:30:05,615 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15588 transitions. Word has length 31 [2020-02-10 20:30:05,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:05,615 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15588 transitions. [2020-02-10 20:30:05,615 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:30:05,615 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15588 transitions. [2020-02-10 20:30:05,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:30:05,620 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:05,620 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:30:05,620 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:30:05,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:05,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1755818032, now seen corresponding path program 161 times [2020-02-10 20:30:05,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:05,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520132115] [2020-02-10 20:30:05,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:05,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:06,166 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:30:06,300 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:30:06,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:30:06,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520132115] [2020-02-10 20:30:06,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:06,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:30:06,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779206004] [2020-02-10 20:30:06,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:30:06,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:06,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:30:06,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:30:06,310 INFO L87 Difference]: Start difference. First operand 3125 states and 15588 transitions. Second operand 12 states. [2020-02-10 20:30:06,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:06,571 INFO L93 Difference]: Finished difference Result 6039 states and 26884 transitions. [2020-02-10 20:30:06,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:30:06,571 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:30:06,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:06,586 INFO L225 Difference]: With dead ends: 6039 [2020-02-10 20:30:06,586 INFO L226 Difference]: Without dead ends: 6019 [2020-02-10 20:30:06,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:30:06,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6019 states. [2020-02-10 20:30:06,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6019 to 3132. [2020-02-10 20:30:06,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-02-10 20:30:06,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15601 transitions. [2020-02-10 20:30:06,772 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15601 transitions. Word has length 31 [2020-02-10 20:30:06,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:06,772 INFO L479 AbstractCegarLoop]: Abstraction has 3132 states and 15601 transitions. [2020-02-10 20:30:06,772 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:30:06,772 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15601 transitions. [2020-02-10 20:30:06,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:30:06,777 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:06,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:30:06,777 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:30:06,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:06,777 INFO L82 PathProgramCache]: Analyzing trace with hash 65875128, now seen corresponding path program 162 times [2020-02-10 20:30:06,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:06,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521098938] [2020-02-10 20:30:06,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:06,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:07,148 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 26 [2020-02-10 20:30:07,369 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:30:07,501 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:30:07,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 20:30:07,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521098938] [2020-02-10 20:30:07,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:07,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:30:07,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879346686] [2020-02-10 20:30:07,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:30:07,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:07,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:30:07,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:30:07,512 INFO L87 Difference]: Start difference. First operand 3132 states and 15601 transitions. Second operand 12 states. [2020-02-10 20:30:07,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:07,871 INFO L93 Difference]: Finished difference Result 6037 states and 26873 transitions. [2020-02-10 20:30:07,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:30:07,871 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:30:07,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:07,887 INFO L225 Difference]: With dead ends: 6037 [2020-02-10 20:30:07,887 INFO L226 Difference]: Without dead ends: 6005 [2020-02-10 20:30:07,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:30:08,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6005 states. [2020-02-10 20:30:08,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6005 to 3118. [2020-02-10 20:30:08,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3118 states. [2020-02-10 20:30:08,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3118 states to 3118 states and 15570 transitions. [2020-02-10 20:30:08,071 INFO L78 Accepts]: Start accepts. Automaton has 3118 states and 15570 transitions. Word has length 31 [2020-02-10 20:30:08,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:08,071 INFO L479 AbstractCegarLoop]: Abstraction has 3118 states and 15570 transitions. [2020-02-10 20:30:08,071 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:30:08,071 INFO L276 IsEmpty]: Start isEmpty. Operand 3118 states and 15570 transitions. [2020-02-10 20:30:08,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:30:08,076 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:08,076 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:30:08,076 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:30:08,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:08,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1591866330, now seen corresponding path program 163 times [2020-02-10 20:30:08,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:08,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395793725] [2020-02-10 20:30:08,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:08,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:08,595 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:30:08,726 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:30:08,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:30:08,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395793725] [2020-02-10 20:30:08,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:08,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:30:08,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333484402] [2020-02-10 20:30:08,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:30:08,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:08,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:30:08,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:30:08,736 INFO L87 Difference]: Start difference. First operand 3118 states and 15570 transitions. Second operand 12 states. [2020-02-10 20:30:09,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:09,062 INFO L93 Difference]: Finished difference Result 6021 states and 26846 transitions. [2020-02-10 20:30:09,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:30:09,062 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:30:09,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:09,080 INFO L225 Difference]: With dead ends: 6021 [2020-02-10 20:30:09,081 INFO L226 Difference]: Without dead ends: 6005 [2020-02-10 20:30:09,081 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:30:09,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6005 states. [2020-02-10 20:30:09,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6005 to 3128. [2020-02-10 20:30:09,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 20:30:09,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15598 transitions. [2020-02-10 20:30:09,274 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15598 transitions. Word has length 31 [2020-02-10 20:30:09,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:09,274 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15598 transitions. [2020-02-10 20:30:09,274 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:30:09,274 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15598 transitions. [2020-02-10 20:30:09,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:30:09,279 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:09,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:30:09,279 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:30:09,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:09,280 INFO L82 PathProgramCache]: Analyzing trace with hash 746894878, now seen corresponding path program 164 times [2020-02-10 20:30:09,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:09,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675105280] [2020-02-10 20:30:09,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:09,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:09,801 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:30:09,932 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:30:09,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:30:09,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675105280] [2020-02-10 20:30:09,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:09,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:30:09,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704597833] [2020-02-10 20:30:09,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:30:09,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:09,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:30:09,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:30:09,943 INFO L87 Difference]: Start difference. First operand 3128 states and 15598 transitions. Second operand 12 states. [2020-02-10 20:30:10,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:10,225 INFO L93 Difference]: Finished difference Result 6025 states and 26849 transitions. [2020-02-10 20:30:10,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:30:10,226 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:30:10,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:10,241 INFO L225 Difference]: With dead ends: 6025 [2020-02-10 20:30:10,241 INFO L226 Difference]: Without dead ends: 6000 [2020-02-10 20:30:10,241 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:30:10,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6000 states. [2020-02-10 20:30:10,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6000 to 3123. [2020-02-10 20:30:10,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3123 states. [2020-02-10 20:30:10,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 15584 transitions. [2020-02-10 20:30:10,426 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 15584 transitions. Word has length 31 [2020-02-10 20:30:10,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:10,426 INFO L479 AbstractCegarLoop]: Abstraction has 3123 states and 15584 transitions. [2020-02-10 20:30:10,426 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:30:10,426 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 15584 transitions. [2020-02-10 20:30:10,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:30:10,431 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:10,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:30:10,431 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:30:10,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:10,431 INFO L82 PathProgramCache]: Analyzing trace with hash 743243858, now seen corresponding path program 165 times [2020-02-10 20:30:10,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:10,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980153910] [2020-02-10 20:30:10,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:10,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:10,956 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:30:11,087 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:30:11,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:30:11,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980153910] [2020-02-10 20:30:11,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:11,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:30:11,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610892983] [2020-02-10 20:30:11,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:30:11,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:11,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:30:11,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:30:11,098 INFO L87 Difference]: Start difference. First operand 3123 states and 15584 transitions. Second operand 12 states. [2020-02-10 20:30:11,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:11,345 INFO L93 Difference]: Finished difference Result 6019 states and 26837 transitions. [2020-02-10 20:30:11,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:30:11,346 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:30:11,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:11,361 INFO L225 Difference]: With dead ends: 6019 [2020-02-10 20:30:11,361 INFO L226 Difference]: Without dead ends: 6003 [2020-02-10 20:30:11,361 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:30:11,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6003 states. [2020-02-10 20:30:11,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6003 to 3128. [2020-02-10 20:30:11,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 20:30:11,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15593 transitions. [2020-02-10 20:30:11,545 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15593 transitions. Word has length 31 [2020-02-10 20:30:11,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:11,545 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15593 transitions. [2020-02-10 20:30:11,545 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:30:11,545 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15593 transitions. [2020-02-10 20:30:11,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:30:11,550 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:11,550 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:30:11,550 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:30:11,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:11,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1791670498, now seen corresponding path program 166 times [2020-02-10 20:30:11,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:11,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167254905] [2020-02-10 20:30:11,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:11,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:12,086 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:30:12,219 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:30:12,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:30:12,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167254905] [2020-02-10 20:30:12,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:12,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:30:12,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936831835] [2020-02-10 20:30:12,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:30:12,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:12,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:30:12,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:30:12,230 INFO L87 Difference]: Start difference. First operand 3128 states and 15593 transitions. Second operand 12 states. [2020-02-10 20:30:12,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:12,487 INFO L93 Difference]: Finished difference Result 6021 states and 26836 transitions. [2020-02-10 20:30:12,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:30:12,488 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:30:12,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:12,501 INFO L225 Difference]: With dead ends: 6021 [2020-02-10 20:30:12,501 INFO L226 Difference]: Without dead ends: 5998 [2020-02-10 20:30:12,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:30:12,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5998 states. [2020-02-10 20:30:12,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5998 to 3123. [2020-02-10 20:30:12,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3123 states. [2020-02-10 20:30:12,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 15579 transitions. [2020-02-10 20:30:12,685 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 15579 transitions. Word has length 31 [2020-02-10 20:30:12,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:12,685 INFO L479 AbstractCegarLoop]: Abstraction has 3123 states and 15579 transitions. [2020-02-10 20:30:12,685 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:30:12,686 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 15579 transitions. [2020-02-10 20:30:12,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:30:12,691 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:12,691 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:30:12,691 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:30:12,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:12,691 INFO L82 PathProgramCache]: Analyzing trace with hash -526038830, now seen corresponding path program 167 times [2020-02-10 20:30:12,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:12,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648439462] [2020-02-10 20:30:12,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:12,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:13,231 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:30:13,363 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:30:13,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:30:13,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648439462] [2020-02-10 20:30:13,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:13,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:30:13,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129359729] [2020-02-10 20:30:13,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:30:13,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:13,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:30:13,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:30:13,373 INFO L87 Difference]: Start difference. First operand 3123 states and 15579 transitions. Second operand 12 states. [2020-02-10 20:30:13,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:13,610 INFO L93 Difference]: Finished difference Result 6029 states and 26854 transitions. [2020-02-10 20:30:13,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:30:13,610 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:30:13,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:13,625 INFO L225 Difference]: With dead ends: 6029 [2020-02-10 20:30:13,625 INFO L226 Difference]: Without dead ends: 6009 [2020-02-10 20:30:13,625 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:30:13,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6009 states. [2020-02-10 20:30:13,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6009 to 3130. [2020-02-10 20:30:13,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 20:30:13,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15592 transitions. [2020-02-10 20:30:13,815 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15592 transitions. Word has length 31 [2020-02-10 20:30:13,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:13,815 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15592 transitions. [2020-02-10 20:30:13,815 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:30:13,815 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15592 transitions. [2020-02-10 20:30:13,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:30:13,820 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:13,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 20:30:13,821 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:30:13,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:13,821 INFO L82 PathProgramCache]: Analyzing trace with hash 2078985562, now seen corresponding path program 168 times [2020-02-10 20:30:13,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:13,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872513092] [2020-02-10 20:30:13,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:13,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:14,396 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:30:14,530 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:30:14,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:30:14,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872513092] [2020-02-10 20:30:14,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:14,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:30:14,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365602723] [2020-02-10 20:30:14,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:30:14,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:14,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:30:14,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:30:14,540 INFO L87 Difference]: Start difference. First operand 3130 states and 15592 transitions. Second operand 12 states. [2020-02-10 20:30:14,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:14,759 INFO L93 Difference]: Finished difference Result 6027 states and 26843 transitions. [2020-02-10 20:30:14,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:30:14,760 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:30:14,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:14,775 INFO L225 Difference]: With dead ends: 6027 [2020-02-10 20:30:14,775 INFO L226 Difference]: Without dead ends: 5992 [2020-02-10 20:30:14,775 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:30:14,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5992 states. [2020-02-10 20:30:14,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5992 to 3113. [2020-02-10 20:30:14,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3113 states. [2020-02-10 20:30:14,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3113 states to 3113 states and 15556 transitions. [2020-02-10 20:30:14,963 INFO L78 Accepts]: Start accepts. Automaton has 3113 states and 15556 transitions. Word has length 31 [2020-02-10 20:30:14,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:14,963 INFO L479 AbstractCegarLoop]: Abstraction has 3113 states and 15556 transitions. [2020-02-10 20:30:14,963 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:30:14,964 INFO L276 IsEmpty]: Start isEmpty. Operand 3113 states and 15556 transitions. [2020-02-10 20:30:14,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:30:14,969 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:14,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:30:14,969 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:30:14,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:14,969 INFO L82 PathProgramCache]: Analyzing trace with hash -315342902, now seen corresponding path program 169 times [2020-02-10 20:30:14,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:14,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390624445] [2020-02-10 20:30:14,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:14,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:15,509 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:30:15,638 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:30:15,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:30:15,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390624445] [2020-02-10 20:30:15,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:15,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:30:15,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084875996] [2020-02-10 20:30:15,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:30:15,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:15,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:30:15,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:30:15,649 INFO L87 Difference]: Start difference. First operand 3113 states and 15556 transitions. Second operand 12 states. [2020-02-10 20:30:15,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:15,898 INFO L93 Difference]: Finished difference Result 6046 states and 26915 transitions. [2020-02-10 20:30:15,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:30:15,899 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:30:15,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:15,912 INFO L225 Difference]: With dead ends: 6046 [2020-02-10 20:30:15,912 INFO L226 Difference]: Without dead ends: 6027 [2020-02-10 20:30:15,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:30:16,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6027 states. [2020-02-10 20:30:16,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6027 to 3131. [2020-02-10 20:30:16,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 20:30:16,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15617 transitions. [2020-02-10 20:30:16,097 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15617 transitions. Word has length 31 [2020-02-10 20:30:16,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:16,097 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15617 transitions. [2020-02-10 20:30:16,097 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:30:16,097 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15617 transitions. [2020-02-10 20:30:16,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:30:16,102 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:16,102 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:30:16,103 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:30:16,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:16,103 INFO L82 PathProgramCache]: Analyzing trace with hash -737828628, now seen corresponding path program 170 times [2020-02-10 20:30:16,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:16,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996468213] [2020-02-10 20:30:16,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:16,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:16,653 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:30:16,783 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:30:16,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:30:16,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996468213] [2020-02-10 20:30:16,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:16,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:30:16,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515508584] [2020-02-10 20:30:16,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:30:16,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:16,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:30:16,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:30:16,794 INFO L87 Difference]: Start difference. First operand 3131 states and 15617 transitions. Second operand 12 states. [2020-02-10 20:30:17,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:17,046 INFO L93 Difference]: Finished difference Result 6043 states and 26904 transitions. [2020-02-10 20:30:17,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:30:17,047 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:30:17,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:17,061 INFO L225 Difference]: With dead ends: 6043 [2020-02-10 20:30:17,061 INFO L226 Difference]: Without dead ends: 6022 [2020-02-10 20:30:17,061 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:30:17,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6022 states. [2020-02-10 20:30:17,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6022 to 3126. [2020-02-10 20:30:17,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 20:30:17,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15603 transitions. [2020-02-10 20:30:17,251 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15603 transitions. Word has length 31 [2020-02-10 20:30:17,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:17,251 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15603 transitions. [2020-02-10 20:30:17,251 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:30:17,251 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15603 transitions. [2020-02-10 20:30:17,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:30:17,256 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:17,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 20:30:17,256 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:30:17,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:17,257 INFO L82 PathProgramCache]: Analyzing trace with hash -739654138, now seen corresponding path program 171 times [2020-02-10 20:30:17,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:17,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966103853] [2020-02-10 20:30:17,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:17,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:17,806 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:30:17,938 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:30:17,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:30:17,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966103853] [2020-02-10 20:30:17,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:17,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:30:17,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297978055] [2020-02-10 20:30:17,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:30:17,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:17,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:30:17,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:30:17,948 INFO L87 Difference]: Start difference. First operand 3126 states and 15603 transitions. Second operand 12 states. [2020-02-10 20:30:18,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:18,207 INFO L93 Difference]: Finished difference Result 6053 states and 26927 transitions. [2020-02-10 20:30:18,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:30:18,207 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:30:18,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:18,222 INFO L225 Difference]: With dead ends: 6053 [2020-02-10 20:30:18,222 INFO L226 Difference]: Without dead ends: 6034 [2020-02-10 20:30:18,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:30:18,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6034 states. [2020-02-10 20:30:18,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6034 to 3134. [2020-02-10 20:30:18,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3134 states. [2020-02-10 20:30:18,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3134 states to 3134 states and 15618 transitions. [2020-02-10 20:30:18,408 INFO L78 Accepts]: Start accepts. Automaton has 3134 states and 15618 transitions. Word has length 31 [2020-02-10 20:30:18,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:18,408 INFO L479 AbstractCegarLoop]: Abstraction has 3134 states and 15618 transitions. [2020-02-10 20:30:18,408 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:30:18,408 INFO L276 IsEmpty]: Start isEmpty. Operand 3134 states and 15618 transitions. [2020-02-10 20:30:18,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:30:18,413 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:18,413 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:30:18,413 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:30:18,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:18,413 INFO L82 PathProgramCache]: Analyzing trace with hash -2007111316, now seen corresponding path program 172 times [2020-02-10 20:30:18,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:18,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211935198] [2020-02-10 20:30:18,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:18,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:18,965 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:30:19,100 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:30:19,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:30:19,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211935198] [2020-02-10 20:30:19,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:19,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:30:19,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849412629] [2020-02-10 20:30:19,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:30:19,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:19,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:30:19,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:30:19,110 INFO L87 Difference]: Start difference. First operand 3134 states and 15618 transitions. Second operand 12 states. [2020-02-10 20:30:19,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:19,352 INFO L93 Difference]: Finished difference Result 6054 states and 26921 transitions. [2020-02-10 20:30:19,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:30:19,353 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:30:19,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:19,368 INFO L225 Difference]: With dead ends: 6054 [2020-02-10 20:30:19,368 INFO L226 Difference]: Without dead ends: 6026 [2020-02-10 20:30:19,368 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:30:19,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6026 states. [2020-02-10 20:30:19,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6026 to 3126. [2020-02-10 20:30:19,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 20:30:19,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15598 transitions. [2020-02-10 20:30:19,558 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15598 transitions. Word has length 31 [2020-02-10 20:30:19,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:19,558 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15598 transitions. [2020-02-10 20:30:19,558 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:30:19,558 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15598 transitions. [2020-02-10 20:30:19,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:30:19,563 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:19,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 20:30:19,563 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:30:19,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:19,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1374295482, now seen corresponding path program 173 times [2020-02-10 20:30:19,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:19,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382729557] [2020-02-10 20:30:19,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:19,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:20,117 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:30:20,250 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:30:20,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:30:20,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382729557] [2020-02-10 20:30:20,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:20,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:30:20,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362475758] [2020-02-10 20:30:20,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:30:20,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:20,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:30:20,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:30:20,260 INFO L87 Difference]: Start difference. First operand 3126 states and 15598 transitions. Second operand 12 states. [2020-02-10 20:30:20,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:20,498 INFO L93 Difference]: Finished difference Result 6044 states and 26901 transitions. [2020-02-10 20:30:20,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:30:20,498 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:30:20,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:20,513 INFO L225 Difference]: With dead ends: 6044 [2020-02-10 20:30:20,513 INFO L226 Difference]: Without dead ends: 6028 [2020-02-10 20:30:20,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:30:20,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6028 states. [2020-02-10 20:30:20,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6028 to 3131. [2020-02-10 20:30:20,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 20:30:20,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15607 transitions. [2020-02-10 20:30:20,702 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15607 transitions. Word has length 31 [2020-02-10 20:30:20,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:20,702 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15607 transitions. [2020-02-10 20:30:20,702 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:30:20,702 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15607 transitions. [2020-02-10 20:30:20,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:30:20,707 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:20,707 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:30:20,707 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:30:20,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:20,708 INFO L82 PathProgramCache]: Analyzing trace with hash 2075700362, now seen corresponding path program 174 times [2020-02-10 20:30:20,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:20,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279758949] [2020-02-10 20:30:20,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:20,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:21,288 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:30:21,422 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:30:21,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:30:21,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279758949] [2020-02-10 20:30:21,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:21,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:30:21,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428727456] [2020-02-10 20:30:21,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:30:21,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:21,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:30:21,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:30:21,432 INFO L87 Difference]: Start difference. First operand 3131 states and 15607 transitions. Second operand 12 states. [2020-02-10 20:30:21,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:21,670 INFO L93 Difference]: Finished difference Result 6048 states and 26904 transitions. [2020-02-10 20:30:21,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:30:21,671 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:30:21,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:21,686 INFO L225 Difference]: With dead ends: 6048 [2020-02-10 20:30:21,686 INFO L226 Difference]: Without dead ends: 6018 [2020-02-10 20:30:21,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:30:21,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6018 states. [2020-02-10 20:30:21,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6018 to 3121. [2020-02-10 20:30:21,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 20:30:21,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15584 transitions. [2020-02-10 20:30:21,871 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15584 transitions. Word has length 31 [2020-02-10 20:30:21,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:21,871 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15584 transitions. [2020-02-10 20:30:21,871 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:30:21,871 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15584 transitions. [2020-02-10 20:30:21,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:30:21,876 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:21,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 20:30:21,876 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:30:21,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:21,877 INFO L82 PathProgramCache]: Analyzing trace with hash 891528248, now seen corresponding path program 175 times [2020-02-10 20:30:21,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:21,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405942892] [2020-02-10 20:30:21,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:21,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:22,406 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:30:22,548 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:30:22,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 20:30:22,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405942892] [2020-02-10 20:30:22,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:22,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:30:22,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173455336] [2020-02-10 20:30:22,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:30:22,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:22,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:30:22,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:30:22,559 INFO L87 Difference]: Start difference. First operand 3121 states and 15584 transitions. Second operand 12 states. [2020-02-10 20:30:22,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:22,796 INFO L93 Difference]: Finished difference Result 6051 states and 26920 transitions. [2020-02-10 20:30:22,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:30:22,797 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:30:22,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:22,812 INFO L225 Difference]: With dead ends: 6051 [2020-02-10 20:30:22,812 INFO L226 Difference]: Without dead ends: 6032 [2020-02-10 20:30:22,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:30:22,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6032 states. [2020-02-10 20:30:22,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6032 to 3132. [2020-02-10 20:30:22,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-02-10 20:30:22,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15615 transitions. [2020-02-10 20:30:22,997 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15615 transitions. Word has length 31 [2020-02-10 20:30:22,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:22,998 INFO L479 AbstractCegarLoop]: Abstraction has 3132 states and 15615 transitions. [2020-02-10 20:30:22,998 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:30:22,998 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15615 transitions. [2020-02-10 20:30:23,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:30:23,003 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:23,003 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:30:23,003 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:30:23,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:23,003 INFO L82 PathProgramCache]: Analyzing trace with hash 469042522, now seen corresponding path program 176 times [2020-02-10 20:30:23,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:23,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416990562] [2020-02-10 20:30:23,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:23,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:23,559 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:30:23,690 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:30:23,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:30:23,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416990562] [2020-02-10 20:30:23,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:23,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:30:23,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612669295] [2020-02-10 20:30:23,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:30:23,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:23,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:30:23,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:30:23,701 INFO L87 Difference]: Start difference. First operand 3132 states and 15615 transitions. Second operand 12 states. [2020-02-10 20:30:23,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:23,977 INFO L93 Difference]: Finished difference Result 6048 states and 26909 transitions. [2020-02-10 20:30:23,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:30:23,978 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:30:23,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:23,993 INFO L225 Difference]: With dead ends: 6048 [2020-02-10 20:30:23,993 INFO L226 Difference]: Without dead ends: 6027 [2020-02-10 20:30:23,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:30:24,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6027 states. [2020-02-10 20:30:24,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6027 to 3127. [2020-02-10 20:30:24,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:30:24,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15601 transitions. [2020-02-10 20:30:24,177 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15601 transitions. Word has length 31 [2020-02-10 20:30:24,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:24,178 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15601 transitions. [2020-02-10 20:30:24,178 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:30:24,178 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15601 transitions. [2020-02-10 20:30:24,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:30:24,183 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:24,183 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:30:24,183 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:30:24,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:24,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1017872314, now seen corresponding path program 177 times [2020-02-10 20:30:24,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:24,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338147571] [2020-02-10 20:30:24,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:24,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:24,742 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:30:24,873 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:30:24,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:30:24,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338147571] [2020-02-10 20:30:24,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:24,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:30:24,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69031039] [2020-02-10 20:30:24,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:30:24,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:24,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:30:24,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:30:24,883 INFO L87 Difference]: Start difference. First operand 3127 states and 15601 transitions. Second operand 12 states. [2020-02-10 20:30:25,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:25,157 INFO L93 Difference]: Finished difference Result 6061 states and 26937 transitions. [2020-02-10 20:30:25,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:30:25,157 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:30:25,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:25,172 INFO L225 Difference]: With dead ends: 6061 [2020-02-10 20:30:25,172 INFO L226 Difference]: Without dead ends: 6042 [2020-02-10 20:30:25,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:30:25,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6042 states. [2020-02-10 20:30:25,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6042 to 3136. [2020-02-10 20:30:25,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3136 states. [2020-02-10 20:30:25,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3136 states to 3136 states and 15618 transitions. [2020-02-10 20:30:25,358 INFO L78 Accepts]: Start accepts. Automaton has 3136 states and 15618 transitions. Word has length 31 [2020-02-10 20:30:25,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:25,358 INFO L479 AbstractCegarLoop]: Abstraction has 3136 states and 15618 transitions. [2020-02-10 20:30:25,358 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:30:25,358 INFO L276 IsEmpty]: Start isEmpty. Operand 3136 states and 15618 transitions. [2020-02-10 20:30:25,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:30:25,363 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:25,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 20:30:25,363 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:30:25,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:25,363 INFO L82 PathProgramCache]: Analyzing trace with hash -947762278, now seen corresponding path program 178 times [2020-02-10 20:30:25,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:25,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437784032] [2020-02-10 20:30:25,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:25,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:25,932 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:30:26,065 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:30:26,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 20:30:26,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437784032] [2020-02-10 20:30:26,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:26,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:30:26,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391873141] [2020-02-10 20:30:26,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:30:26,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:26,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:30:26,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:30:26,074 INFO L87 Difference]: Start difference. First operand 3136 states and 15618 transitions. Second operand 12 states. [2020-02-10 20:30:26,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:26,276 INFO L93 Difference]: Finished difference Result 6064 states and 26934 transitions. [2020-02-10 20:30:26,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:30:26,282 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:30:26,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:26,296 INFO L225 Difference]: With dead ends: 6064 [2020-02-10 20:30:26,297 INFO L226 Difference]: Without dead ends: 6033 [2020-02-10 20:30:26,297 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:30:26,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6033 states. [2020-02-10 20:30:26,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6033 to 3127. [2020-02-10 20:30:26,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:30:26,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15595 transitions. [2020-02-10 20:30:26,485 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15595 transitions. Word has length 31 [2020-02-10 20:30:26,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:26,485 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15595 transitions. [2020-02-10 20:30:26,485 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:30:26,485 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15595 transitions. [2020-02-10 20:30:26,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:30:26,490 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:26,490 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:30:26,490 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:30:26,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:26,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1652513658, now seen corresponding path program 179 times [2020-02-10 20:30:26,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:26,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265106090] [2020-02-10 20:30:26,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:26,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:27,028 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:30:27,160 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:30:27,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:30:27,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265106090] [2020-02-10 20:30:27,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:27,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:30:27,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106457987] [2020-02-10 20:30:27,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:30:27,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:27,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:30:27,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:30:27,170 INFO L87 Difference]: Start difference. First operand 3127 states and 15595 transitions. Second operand 12 states. [2020-02-10 20:30:27,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:27,425 INFO L93 Difference]: Finished difference Result 6052 states and 26910 transitions. [2020-02-10 20:30:27,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:30:27,425 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:30:27,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:27,440 INFO L225 Difference]: With dead ends: 6052 [2020-02-10 20:30:27,441 INFO L226 Difference]: Without dead ends: 6036 [2020-02-10 20:30:27,441 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:30:27,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6036 states. [2020-02-10 20:30:27,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6036 to 3133. [2020-02-10 20:30:27,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-02-10 20:30:27,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15606 transitions. [2020-02-10 20:30:27,626 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15606 transitions. Word has length 31 [2020-02-10 20:30:27,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:27,626 INFO L479 AbstractCegarLoop]: Abstraction has 3133 states and 15606 transitions. [2020-02-10 20:30:27,626 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:30:27,626 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15606 transitions. [2020-02-10 20:30:27,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:30:27,631 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:27,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:30:27,631 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:30:27,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:27,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1159917896, now seen corresponding path program 180 times [2020-02-10 20:30:27,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:27,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69120359] [2020-02-10 20:30:27,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:27,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:28,218 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:30:28,350 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:30:28,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:30:28,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69120359] [2020-02-10 20:30:28,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:28,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:30:28,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743797220] [2020-02-10 20:30:28,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:30:28,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:28,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:30:28,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:30:28,360 INFO L87 Difference]: Start difference. First operand 3133 states and 15606 transitions. Second operand 12 states. [2020-02-10 20:30:28,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:28,625 INFO L93 Difference]: Finished difference Result 6058 states and 26916 transitions. [2020-02-10 20:30:28,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:30:28,626 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:30:28,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:28,639 INFO L225 Difference]: With dead ends: 6058 [2020-02-10 20:30:28,640 INFO L226 Difference]: Without dead ends: 6024 [2020-02-10 20:30:28,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 20:30:28,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6024 states. [2020-02-10 20:30:28,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6024 to 3121. [2020-02-10 20:30:28,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 20:30:28,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15578 transitions. [2020-02-10 20:30:28,824 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15578 transitions. Word has length 31 [2020-02-10 20:30:28,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:28,825 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15578 transitions. [2020-02-10 20:30:28,825 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:30:28,825 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15578 transitions. [2020-02-10 20:30:28,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:30:28,830 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:28,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:30:28,830 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:30:28,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:28,830 INFO L82 PathProgramCache]: Analyzing trace with hash 198470584, now seen corresponding path program 181 times [2020-02-10 20:30:28,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:28,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523625591] [2020-02-10 20:30:28,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:28,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:29,396 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:30:29,530 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:30:29,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:30:29,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523625591] [2020-02-10 20:30:29,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:29,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:30:29,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780367173] [2020-02-10 20:30:29,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:30:29,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:29,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:30:29,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:30:29,541 INFO L87 Difference]: Start difference. First operand 3121 states and 15578 transitions. Second operand 12 states. [2020-02-10 20:30:29,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:29,833 INFO L93 Difference]: Finished difference Result 6075 states and 26976 transitions. [2020-02-10 20:30:29,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:30:29,834 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:30:29,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:29,848 INFO L225 Difference]: With dead ends: 6075 [2020-02-10 20:30:29,849 INFO L226 Difference]: Without dead ends: 6056 [2020-02-10 20:30:29,849 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:30:29,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6056 states. [2020-02-10 20:30:30,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6056 to 3140. [2020-02-10 20:30:30,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3140 states. [2020-02-10 20:30:30,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3140 states to 3140 states and 15630 transitions. [2020-02-10 20:30:30,038 INFO L78 Accepts]: Start accepts. Automaton has 3140 states and 15630 transitions. Word has length 31 [2020-02-10 20:30:30,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:30,038 INFO L479 AbstractCegarLoop]: Abstraction has 3140 states and 15630 transitions. [2020-02-10 20:30:30,038 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:30:30,038 INFO L276 IsEmpty]: Start isEmpty. Operand 3140 states and 15630 transitions. [2020-02-10 20:30:30,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:30:30,043 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:30,043 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:30:30,043 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:30:30,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:30,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1068986594, now seen corresponding path program 182 times [2020-02-10 20:30:30,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:30,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74862335] [2020-02-10 20:30:30,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:30,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:30,600 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:30:30,735 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:30:30,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 20:30:30,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74862335] [2020-02-10 20:30:30,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:30,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:30:30,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853111511] [2020-02-10 20:30:30,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:30:30,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:30,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:30:30,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:30:30,746 INFO L87 Difference]: Start difference. First operand 3140 states and 15630 transitions. Second operand 12 states. [2020-02-10 20:30:31,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:31,072 INFO L93 Difference]: Finished difference Result 6076 states and 26970 transitions. [2020-02-10 20:30:31,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:30:31,072 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:30:31,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:31,087 INFO L225 Difference]: With dead ends: 6076 [2020-02-10 20:30:31,087 INFO L226 Difference]: Without dead ends: 6048 [2020-02-10 20:30:31,087 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:30:31,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6048 states. [2020-02-10 20:30:31,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6048 to 3132. [2020-02-10 20:30:31,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-02-10 20:30:31,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15607 transitions. [2020-02-10 20:30:31,276 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15607 transitions. Word has length 31 [2020-02-10 20:30:31,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:31,276 INFO L479 AbstractCegarLoop]: Abstraction has 3132 states and 15607 transitions. [2020-02-10 20:30:31,276 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:30:31,276 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15607 transitions. [2020-02-10 20:30:31,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:30:31,281 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:31,281 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:30:31,282 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:30:31,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:31,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1286618742, now seen corresponding path program 183 times [2020-02-10 20:30:31,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:31,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402738835] [2020-02-10 20:30:31,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:31,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:31,870 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:30:32,001 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:30:32,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:30:32,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402738835] [2020-02-10 20:30:32,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:32,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:30:32,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896601085] [2020-02-10 20:30:32,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:30:32,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:32,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:30:32,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:30:32,011 INFO L87 Difference]: Start difference. First operand 3132 states and 15607 transitions. Second operand 12 states. [2020-02-10 20:30:32,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:32,367 INFO L93 Difference]: Finished difference Result 6078 states and 26973 transitions. [2020-02-10 20:30:32,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:30:32,368 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:30:32,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:32,382 INFO L225 Difference]: With dead ends: 6078 [2020-02-10 20:30:32,382 INFO L226 Difference]: Without dead ends: 6059 [2020-02-10 20:30:32,382 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:30:32,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6059 states. [2020-02-10 20:30:32,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6059 to 3141. [2020-02-10 20:30:32,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3141 states. [2020-02-10 20:30:32,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3141 states to 3141 states and 15624 transitions. [2020-02-10 20:30:32,570 INFO L78 Accepts]: Start accepts. Automaton has 3141 states and 15624 transitions. Word has length 31 [2020-02-10 20:30:32,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:32,570 INFO L479 AbstractCegarLoop]: Abstraction has 3141 states and 15624 transitions. [2020-02-10 20:30:32,570 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:30:32,571 INFO L276 IsEmpty]: Start isEmpty. Operand 3141 states and 15624 transitions. [2020-02-10 20:30:32,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:30:32,577 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:32,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 20:30:32,577 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:30:32,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:32,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1216508706, now seen corresponding path program 184 times [2020-02-10 20:30:32,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:32,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392335939] [2020-02-10 20:30:32,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:32,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:33,144 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:30:33,278 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:30:33,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:30:33,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392335939] [2020-02-10 20:30:33,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:33,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:30:33,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898896185] [2020-02-10 20:30:33,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:30:33,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:33,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:30:33,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:30:33,288 INFO L87 Difference]: Start difference. First operand 3141 states and 15624 transitions. Second operand 12 states. [2020-02-10 20:30:33,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:33,618 INFO L93 Difference]: Finished difference Result 6081 states and 26970 transitions. [2020-02-10 20:30:33,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:30:33,619 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:30:33,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:33,633 INFO L225 Difference]: With dead ends: 6081 [2020-02-10 20:30:33,633 INFO L226 Difference]: Without dead ends: 6050 [2020-02-10 20:30:33,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:30:33,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6050 states. [2020-02-10 20:30:33,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6050 to 3132. [2020-02-10 20:30:33,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-02-10 20:30:33,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15598 transitions. [2020-02-10 20:30:33,828 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15598 transitions. Word has length 31 [2020-02-10 20:30:33,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:33,828 INFO L479 AbstractCegarLoop]: Abstraction has 3132 states and 15598 transitions. [2020-02-10 20:30:33,828 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:30:33,828 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15598 transitions. [2020-02-10 20:30:33,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:30:33,833 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:33,833 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:30:33,833 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:30:33,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:33,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1104424522, now seen corresponding path program 185 times [2020-02-10 20:30:33,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:33,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467610437] [2020-02-10 20:30:33,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:33,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:34,406 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:30:34,538 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:30:34,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:30:34,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467610437] [2020-02-10 20:30:34,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:34,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:30:34,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841117392] [2020-02-10 20:30:34,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:30:34,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:34,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:30:34,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:30:34,549 INFO L87 Difference]: Start difference. First operand 3132 states and 15598 transitions. Second operand 12 states. [2020-02-10 20:30:34,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:34,841 INFO L93 Difference]: Finished difference Result 6082 states and 26972 transitions. [2020-02-10 20:30:34,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:30:34,842 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:30:34,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:34,857 INFO L225 Difference]: With dead ends: 6082 [2020-02-10 20:30:34,857 INFO L226 Difference]: Without dead ends: 6062 [2020-02-10 20:30:34,857 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:30:34,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6062 states. [2020-02-10 20:30:35,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6062 to 3143. [2020-02-10 20:30:35,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3143 states. [2020-02-10 20:30:35,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3143 states to 3143 states and 15618 transitions. [2020-02-10 20:30:35,096 INFO L78 Accepts]: Start accepts. Automaton has 3143 states and 15618 transitions. Word has length 31 [2020-02-10 20:30:35,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:35,096 INFO L479 AbstractCegarLoop]: Abstraction has 3143 states and 15618 transitions. [2020-02-10 20:30:35,096 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:30:35,096 INFO L276 IsEmpty]: Start isEmpty. Operand 3143 states and 15618 transitions. [2020-02-10 20:30:35,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:30:35,101 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:35,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:30:35,101 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:30:35,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:35,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1852975560, now seen corresponding path program 186 times [2020-02-10 20:30:35,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:35,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083980100] [2020-02-10 20:30:35,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:35,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:35,684 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:30:35,816 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:30:35,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:30:35,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083980100] [2020-02-10 20:30:35,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:35,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:30:35,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118899795] [2020-02-10 20:30:35,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:30:35,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:35,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:30:35,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:30:35,826 INFO L87 Difference]: Start difference. First operand 3143 states and 15618 transitions. Second operand 12 states. [2020-02-10 20:30:36,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:36,026 INFO L93 Difference]: Finished difference Result 6084 states and 26966 transitions. [2020-02-10 20:30:36,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:30:36,026 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:30:36,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:36,041 INFO L225 Difference]: With dead ends: 6084 [2020-02-10 20:30:36,041 INFO L226 Difference]: Without dead ends: 6040 [2020-02-10 20:30:36,041 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:30:36,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6040 states. [2020-02-10 20:30:36,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6040 to 3121. [2020-02-10 20:30:36,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 20:30:36,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15570 transitions. [2020-02-10 20:30:36,229 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15570 transitions. Word has length 31 [2020-02-10 20:30:36,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:36,229 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15570 transitions. [2020-02-10 20:30:36,229 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:30:36,229 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15570 transitions. [2020-02-10 20:30:36,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:30:36,234 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:36,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:30:36,235 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:30:36,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:36,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1576939674, now seen corresponding path program 187 times [2020-02-10 20:30:36,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:36,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826992375] [2020-02-10 20:30:36,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:36,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:36,780 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:30:36,908 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:30:36,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:30:36,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826992375] [2020-02-10 20:30:36,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:36,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:30:36,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610304026] [2020-02-10 20:30:36,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:30:36,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:36,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:30:36,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:30:36,919 INFO L87 Difference]: Start difference. First operand 3121 states and 15570 transitions. Second operand 12 states. [2020-02-10 20:30:37,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:37,128 INFO L93 Difference]: Finished difference Result 6053 states and 26910 transitions. [2020-02-10 20:30:37,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:30:37,129 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:30:37,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:37,144 INFO L225 Difference]: With dead ends: 6053 [2020-02-10 20:30:37,144 INFO L226 Difference]: Without dead ends: 6037 [2020-02-10 20:30:37,144 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:30:37,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6037 states. [2020-02-10 20:30:37,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6037 to 3133. [2020-02-10 20:30:37,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-02-10 20:30:37,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15603 transitions. [2020-02-10 20:30:37,332 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15603 transitions. Word has length 31 [2020-02-10 20:30:37,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:37,332 INFO L479 AbstractCegarLoop]: Abstraction has 3133 states and 15603 transitions. [2020-02-10 20:30:37,332 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:30:37,332 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15603 transitions. [2020-02-10 20:30:37,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:30:37,337 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:37,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:30:37,338 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:30:37,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:37,338 INFO L82 PathProgramCache]: Analyzing trace with hash 731968222, now seen corresponding path program 188 times [2020-02-10 20:30:37,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:37,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006381672] [2020-02-10 20:30:37,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:37,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:37,877 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:30:38,011 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:30:38,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:30:38,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006381672] [2020-02-10 20:30:38,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:38,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:30:38,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062773417] [2020-02-10 20:30:38,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:30:38,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:38,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:30:38,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:30:38,022 INFO L87 Difference]: Start difference. First operand 3133 states and 15603 transitions. Second operand 12 states. [2020-02-10 20:30:38,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:38,245 INFO L93 Difference]: Finished difference Result 6057 states and 26913 transitions. [2020-02-10 20:30:38,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:30:38,245 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:30:38,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:38,262 INFO L225 Difference]: With dead ends: 6057 [2020-02-10 20:30:38,262 INFO L226 Difference]: Without dead ends: 6032 [2020-02-10 20:30:38,263 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:30:38,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6032 states. [2020-02-10 20:30:38,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6032 to 3128. [2020-02-10 20:30:38,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 20:30:38,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15589 transitions. [2020-02-10 20:30:38,448 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15589 transitions. Word has length 31 [2020-02-10 20:30:38,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:38,448 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15589 transitions. [2020-02-10 20:30:38,448 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:30:38,448 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15589 transitions. [2020-02-10 20:30:38,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:30:38,453 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:38,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:30:38,454 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:30:38,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:38,454 INFO L82 PathProgramCache]: Analyzing trace with hash 91850348, now seen corresponding path program 189 times [2020-02-10 20:30:38,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:38,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254403495] [2020-02-10 20:30:38,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:38,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:39,001 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:30:39,136 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:30:39,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:30:39,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254403495] [2020-02-10 20:30:39,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:39,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:30:39,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962290258] [2020-02-10 20:30:39,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:30:39,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:39,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:30:39,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:30:39,146 INFO L87 Difference]: Start difference. First operand 3128 states and 15589 transitions. Second operand 12 states. [2020-02-10 20:30:39,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:39,364 INFO L93 Difference]: Finished difference Result 6056 states and 26910 transitions. [2020-02-10 20:30:39,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:30:39,365 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:30:39,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:39,380 INFO L225 Difference]: With dead ends: 6056 [2020-02-10 20:30:39,380 INFO L226 Difference]: Without dead ends: 6040 [2020-02-10 20:30:39,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:30:39,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6040 states. [2020-02-10 20:30:39,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6040 to 3134. [2020-02-10 20:30:39,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3134 states. [2020-02-10 20:30:39,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3134 states to 3134 states and 15600 transitions. [2020-02-10 20:30:39,564 INFO L78 Accepts]: Start accepts. Automaton has 3134 states and 15600 transitions. Word has length 31 [2020-02-10 20:30:39,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:39,565 INFO L479 AbstractCegarLoop]: Abstraction has 3134 states and 15600 transitions. [2020-02-10 20:30:39,565 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:30:39,565 INFO L276 IsEmpty]: Start isEmpty. Operand 3134 states and 15600 transitions. [2020-02-10 20:30:39,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:30:39,570 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:39,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:30:39,570 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:30:39,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:39,570 INFO L82 PathProgramCache]: Analyzing trace with hash 584446110, now seen corresponding path program 190 times [2020-02-10 20:30:39,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:39,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66549756] [2020-02-10 20:30:39,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:39,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:40,125 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:30:40,259 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:30:40,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:30:40,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66549756] [2020-02-10 20:30:40,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:40,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:30:40,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915740437] [2020-02-10 20:30:40,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:30:40,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:40,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:30:40,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:30:40,269 INFO L87 Difference]: Start difference. First operand 3134 states and 15600 transitions. Second operand 12 states. [2020-02-10 20:30:40,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:40,450 INFO L93 Difference]: Finished difference Result 6062 states and 26916 transitions. [2020-02-10 20:30:40,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:30:40,451 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:30:40,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:40,466 INFO L225 Difference]: With dead ends: 6062 [2020-02-10 20:30:40,466 INFO L226 Difference]: Without dead ends: 6034 [2020-02-10 20:30:40,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 20:30:40,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6034 states. [2020-02-10 20:30:40,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6034 to 3128. [2020-02-10 20:30:40,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 20:30:40,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15583 transitions. [2020-02-10 20:30:40,654 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15583 transitions. Word has length 31 [2020-02-10 20:30:40,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:40,654 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15583 transitions. [2020-02-10 20:30:40,654 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:30:40,655 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15583 transitions. [2020-02-10 20:30:40,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:30:40,660 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:40,660 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:30:40,660 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:30:40,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:40,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1177432340, now seen corresponding path program 191 times [2020-02-10 20:30:40,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:40,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422139764] [2020-02-10 20:30:40,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:40,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:41,223 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:30:41,353 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:30:41,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:30:41,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422139764] [2020-02-10 20:30:41,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:41,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:30:41,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79777458] [2020-02-10 20:30:41,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:30:41,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:41,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:30:41,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:30:41,363 INFO L87 Difference]: Start difference. First operand 3128 states and 15583 transitions. Second operand 12 states. [2020-02-10 20:30:41,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:41,582 INFO L93 Difference]: Finished difference Result 6069 states and 26933 transitions. [2020-02-10 20:30:41,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:30:41,583 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:30:41,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:41,598 INFO L225 Difference]: With dead ends: 6069 [2020-02-10 20:30:41,598 INFO L226 Difference]: Without dead ends: 6049 [2020-02-10 20:30:41,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 20:30:41,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6049 states. [2020-02-10 20:30:41,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6049 to 3139. [2020-02-10 20:30:41,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3139 states. [2020-02-10 20:30:41,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3139 states to 3139 states and 15603 transitions. [2020-02-10 20:30:41,782 INFO L78 Accepts]: Start accepts. Automaton has 3139 states and 15603 transitions. Word has length 31 [2020-02-10 20:30:41,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:41,783 INFO L479 AbstractCegarLoop]: Abstraction has 3139 states and 15603 transitions. [2020-02-10 20:30:41,783 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:30:41,783 INFO L276 IsEmpty]: Start isEmpty. Operand 3139 states and 15603 transitions. [2020-02-10 20:30:41,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:30:41,788 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:41,788 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:30:41,788 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:30:41,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:41,788 INFO L82 PathProgramCache]: Analyzing trace with hash 160134874, now seen corresponding path program 192 times [2020-02-10 20:30:41,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:41,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146822682] [2020-02-10 20:30:41,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:41,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:42,390 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:30:42,525 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:30:42,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:30:42,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146822682] [2020-02-10 20:30:42,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:42,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:30:42,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561523913] [2020-02-10 20:30:42,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:30:42,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:42,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:30:42,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:30:42,536 INFO L87 Difference]: Start difference. First operand 3139 states and 15603 transitions. Second operand 12 states. [2020-02-10 20:30:42,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:42,785 INFO L93 Difference]: Finished difference Result 6071 states and 26927 transitions. [2020-02-10 20:30:42,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:30:42,786 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:30:42,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:42,801 INFO L225 Difference]: With dead ends: 6071 [2020-02-10 20:30:42,801 INFO L226 Difference]: Without dead ends: 6023 [2020-02-10 20:30:42,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:30:42,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6023 states. [2020-02-10 20:30:42,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6023 to 3113. [2020-02-10 20:30:42,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3113 states. [2020-02-10 20:30:42,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3113 states to 3113 states and 15548 transitions. [2020-02-10 20:30:42,989 INFO L78 Accepts]: Start accepts. Automaton has 3113 states and 15548 transitions. Word has length 31 [2020-02-10 20:30:42,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:42,989 INFO L479 AbstractCegarLoop]: Abstraction has 3113 states and 15548 transitions. [2020-02-10 20:30:42,989 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:30:42,989 INFO L276 IsEmpty]: Start isEmpty. Operand 3113 states and 15548 transitions. [2020-02-10 20:30:42,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:30:42,994 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:42,994 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:30:42,995 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:30:42,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:42,995 INFO L82 PathProgramCache]: Analyzing trace with hash -335245110, now seen corresponding path program 193 times [2020-02-10 20:30:42,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:42,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950723151] [2020-02-10 20:30:42,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:42,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:43,535 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:30:43,666 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:30:43,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:30:43,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950723151] [2020-02-10 20:30:43,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:43,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:30:43,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907319887] [2020-02-10 20:30:43,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:30:43,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:43,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:30:43,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:30:43,676 INFO L87 Difference]: Start difference. First operand 3113 states and 15548 transitions. Second operand 12 states. [2020-02-10 20:30:43,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:43,900 INFO L93 Difference]: Finished difference Result 6031 states and 26872 transitions. [2020-02-10 20:30:43,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:30:43,901 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:30:43,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:43,916 INFO L225 Difference]: With dead ends: 6031 [2020-02-10 20:30:43,916 INFO L226 Difference]: Without dead ends: 6012 [2020-02-10 20:30:43,916 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:30:44,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6012 states. [2020-02-10 20:30:44,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6012 to 3129. [2020-02-10 20:30:44,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 20:30:44,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15604 transitions. [2020-02-10 20:30:44,101 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15604 transitions. Word has length 31 [2020-02-10 20:30:44,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:44,101 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15604 transitions. [2020-02-10 20:30:44,101 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:30:44,101 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15604 transitions. [2020-02-10 20:30:44,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:30:44,106 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:44,106 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:30:44,106 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:30:44,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:44,107 INFO L82 PathProgramCache]: Analyzing trace with hash -757730836, now seen corresponding path program 194 times [2020-02-10 20:30:44,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:44,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090619278] [2020-02-10 20:30:44,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:44,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:44,644 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2020-02-10 20:30:44,773 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:30:44,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:30:44,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090619278] [2020-02-10 20:30:44,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:44,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:30:44,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955218578] [2020-02-10 20:30:44,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:30:44,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:44,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:30:44,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:30:44,783 INFO L87 Difference]: Start difference. First operand 3129 states and 15604 transitions. Second operand 12 states. [2020-02-10 20:30:45,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:45,012 INFO L93 Difference]: Finished difference Result 6028 states and 26861 transitions. [2020-02-10 20:30:45,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:30:45,012 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:30:45,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:45,027 INFO L225 Difference]: With dead ends: 6028 [2020-02-10 20:30:45,027 INFO L226 Difference]: Without dead ends: 6007 [2020-02-10 20:30:45,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 20:30:45,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6007 states. [2020-02-10 20:30:45,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6007 to 3124. [2020-02-10 20:30:45,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:30:45,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15590 transitions. [2020-02-10 20:30:45,212 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15590 transitions. Word has length 31 [2020-02-10 20:30:45,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:45,212 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15590 transitions. [2020-02-10 20:30:45,212 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:30:45,212 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15590 transitions. [2020-02-10 20:30:45,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:30:45,217 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:45,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 20:30:45,217 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:30:45,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:45,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1608178818, now seen corresponding path program 195 times [2020-02-10 20:30:45,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:45,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778683684] [2020-02-10 20:30:45,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:45,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:45,953 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:30:45,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:30:45,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778683684] [2020-02-10 20:30:45,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:45,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:30:45,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155151367] [2020-02-10 20:30:45,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:30:45,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:45,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:30:45,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:30:45,963 INFO L87 Difference]: Start difference. First operand 3124 states and 15590 transitions. Second operand 12 states. [2020-02-10 20:30:46,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:46,188 INFO L93 Difference]: Finished difference Result 6035 states and 26877 transitions. [2020-02-10 20:30:46,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:30:46,188 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:30:46,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:46,203 INFO L225 Difference]: With dead ends: 6035 [2020-02-10 20:30:46,203 INFO L226 Difference]: Without dead ends: 6016 [2020-02-10 20:30:46,203 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:30:46,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6016 states. [2020-02-10 20:30:46,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6016 to 3131. [2020-02-10 20:30:46,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 20:30:46,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15603 transitions. [2020-02-10 20:30:46,386 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15603 transitions. Word has length 31 [2020-02-10 20:30:46,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:46,387 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15603 transitions. [2020-02-10 20:30:46,387 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:30:46,387 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15603 transitions. [2020-02-10 20:30:46,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:30:46,392 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:46,392 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:30:46,392 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:30:46,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:46,392 INFO L82 PathProgramCache]: Analyzing trace with hash -270611604, now seen corresponding path program 196 times [2020-02-10 20:30:46,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:46,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991173412] [2020-02-10 20:30:46,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:46,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:46,937 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:30:47,070 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:30:47,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:30:47,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991173412] [2020-02-10 20:30:47,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:47,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:30:47,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24992590] [2020-02-10 20:30:47,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:30:47,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:47,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:30:47,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:30:47,080 INFO L87 Difference]: Start difference. First operand 3131 states and 15603 transitions. Second operand 12 states. [2020-02-10 20:30:47,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:47,360 INFO L93 Difference]: Finished difference Result 6034 states and 26868 transitions. [2020-02-10 20:30:47,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:30:47,360 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:30:47,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:47,376 INFO L225 Difference]: With dead ends: 6034 [2020-02-10 20:30:47,376 INFO L226 Difference]: Without dead ends: 6009 [2020-02-10 20:30:47,376 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:30:47,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6009 states. [2020-02-10 20:30:47,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6009 to 3124. [2020-02-10 20:30:47,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:30:47,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15585 transitions. [2020-02-10 20:30:47,562 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15585 transitions. Word has length 31 [2020-02-10 20:30:47,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:47,562 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15585 transitions. [2020-02-10 20:30:47,562 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:30:47,562 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15585 transitions. [2020-02-10 20:30:47,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:30:47,567 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:47,567 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:30:47,567 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:30:47,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:47,568 INFO L82 PathProgramCache]: Analyzing trace with hash 2052147134, now seen corresponding path program 197 times [2020-02-10 20:30:47,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:47,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816494624] [2020-02-10 20:30:47,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:47,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:48,091 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:30:48,225 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:30:48,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 20:30:48,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816494624] [2020-02-10 20:30:48,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:48,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:30:48,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642465214] [2020-02-10 20:30:48,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:30:48,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:48,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:30:48,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:30:48,239 INFO L87 Difference]: Start difference. First operand 3124 states and 15585 transitions. Second operand 12 states. [2020-02-10 20:30:48,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:48,468 INFO L93 Difference]: Finished difference Result 6027 states and 26854 transitions. [2020-02-10 20:30:48,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:30:48,469 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:30:48,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:48,484 INFO L225 Difference]: With dead ends: 6027 [2020-02-10 20:30:48,484 INFO L226 Difference]: Without dead ends: 6011 [2020-02-10 20:30:48,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:30:48,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6011 states. [2020-02-10 20:30:48,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6011 to 3129. [2020-02-10 20:30:48,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 20:30:48,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15594 transitions. [2020-02-10 20:30:48,674 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15594 transitions. Word has length 31 [2020-02-10 20:30:48,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:48,674 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15594 transitions. [2020-02-10 20:30:48,674 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:30:48,674 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15594 transitions. [2020-02-10 20:30:48,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:30:48,679 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:48,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:30:48,680 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:30:48,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:48,680 INFO L82 PathProgramCache]: Analyzing trace with hash -482767222, now seen corresponding path program 198 times [2020-02-10 20:30:48,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:48,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135226500] [2020-02-10 20:30:48,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:48,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:48,962 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 23 [2020-02-10 20:30:49,263 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:30:49,391 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:30:49,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:30:49,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135226500] [2020-02-10 20:30:49,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:49,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:30:49,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728687072] [2020-02-10 20:30:49,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:30:49,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:49,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:30:49,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:30:49,401 INFO L87 Difference]: Start difference. First operand 3129 states and 15594 transitions. Second operand 12 states. [2020-02-10 20:30:49,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:49,639 INFO L93 Difference]: Finished difference Result 6029 states and 26853 transitions. [2020-02-10 20:30:49,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:30:49,640 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:30:49,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:49,654 INFO L225 Difference]: With dead ends: 6029 [2020-02-10 20:30:49,654 INFO L226 Difference]: Without dead ends: 6001 [2020-02-10 20:30:49,654 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:30:49,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6001 states. [2020-02-10 20:30:49,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6001 to 3119. [2020-02-10 20:30:49,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 20:30:49,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15571 transitions. [2020-02-10 20:30:49,842 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15571 transitions. Word has length 31 [2020-02-10 20:30:49,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:49,842 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15571 transitions. [2020-02-10 20:30:49,843 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:30:49,843 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15571 transitions. [2020-02-10 20:30:49,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:30:49,848 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:49,848 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:30:49,848 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:30:49,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:49,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1409118896, now seen corresponding path program 199 times [2020-02-10 20:30:49,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:49,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341830831] [2020-02-10 20:30:49,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:49,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:50,373 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:30:50,504 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:30:50,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:30:50,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341830831] [2020-02-10 20:30:50,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:50,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:30:50,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128945876] [2020-02-10 20:30:50,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:30:50,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:50,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:30:50,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:30:50,515 INFO L87 Difference]: Start difference. First operand 3119 states and 15571 transitions. Second operand 12 states. [2020-02-10 20:30:50,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:50,750 INFO L93 Difference]: Finished difference Result 6039 states and 26884 transitions. [2020-02-10 20:30:50,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:30:50,751 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:30:50,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:50,766 INFO L225 Difference]: With dead ends: 6039 [2020-02-10 20:30:50,766 INFO L226 Difference]: Without dead ends: 6020 [2020-02-10 20:30:50,766 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:30:50,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6020 states. [2020-02-10 20:30:50,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6020 to 3130. [2020-02-10 20:30:50,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 20:30:50,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15602 transitions. [2020-02-10 20:30:50,950 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15602 transitions. Word has length 31 [2020-02-10 20:30:50,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:50,950 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15602 transitions. [2020-02-10 20:30:50,950 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:30:50,950 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15602 transitions. [2020-02-10 20:30:50,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:30:50,955 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:50,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:30:50,956 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:30:50,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:50,956 INFO L82 PathProgramCache]: Analyzing trace with hash 986633170, now seen corresponding path program 200 times [2020-02-10 20:30:50,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:50,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923764166] [2020-02-10 20:30:50,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:50,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:51,499 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:30:51,631 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:30:51,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:30:51,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923764166] [2020-02-10 20:30:51,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:51,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:30:51,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709586288] [2020-02-10 20:30:51,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:30:51,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:51,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:30:51,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:30:51,642 INFO L87 Difference]: Start difference. First operand 3130 states and 15602 transitions. Second operand 12 states. [2020-02-10 20:30:51,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:51,880 INFO L93 Difference]: Finished difference Result 6036 states and 26873 transitions. [2020-02-10 20:30:51,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:30:51,880 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:30:51,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:51,895 INFO L225 Difference]: With dead ends: 6036 [2020-02-10 20:30:51,895 INFO L226 Difference]: Without dead ends: 6015 [2020-02-10 20:30:51,895 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:30:52,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6015 states. [2020-02-10 20:30:52,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6015 to 3125. [2020-02-10 20:30:52,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 20:30:52,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15588 transitions. [2020-02-10 20:30:52,079 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15588 transitions. Word has length 31 [2020-02-10 20:30:52,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:52,079 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15588 transitions. [2020-02-10 20:30:52,079 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:30:52,079 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15588 transitions. [2020-02-10 20:30:52,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:30:52,084 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:52,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:30:52,084 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:30:52,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:52,084 INFO L82 PathProgramCache]: Analyzing trace with hash -500281666, now seen corresponding path program 201 times [2020-02-10 20:30:52,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:52,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890895791] [2020-02-10 20:30:52,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:52,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:52,632 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:30:52,765 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:30:52,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:30:52,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890895791] [2020-02-10 20:30:52,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:52,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:30:52,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844573755] [2020-02-10 20:30:52,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:30:52,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:52,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:30:52,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:30:52,776 INFO L87 Difference]: Start difference. First operand 3125 states and 15588 transitions. Second operand 12 states. [2020-02-10 20:30:53,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:53,058 INFO L93 Difference]: Finished difference Result 6049 states and 26901 transitions. [2020-02-10 20:30:53,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:30:53,058 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:30:53,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:53,074 INFO L225 Difference]: With dead ends: 6049 [2020-02-10 20:30:53,074 INFO L226 Difference]: Without dead ends: 6030 [2020-02-10 20:30:53,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:30:53,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6030 states. [2020-02-10 20:30:53,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6030 to 3134. [2020-02-10 20:30:53,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3134 states. [2020-02-10 20:30:53,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3134 states to 3134 states and 15605 transitions. [2020-02-10 20:30:53,264 INFO L78 Accepts]: Start accepts. Automaton has 3134 states and 15605 transitions. Word has length 31 [2020-02-10 20:30:53,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:53,264 INFO L479 AbstractCegarLoop]: Abstraction has 3134 states and 15605 transitions. [2020-02-10 20:30:53,264 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:30:53,264 INFO L276 IsEmpty]: Start isEmpty. Operand 3134 states and 15605 transitions. [2020-02-10 20:30:53,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:30:53,269 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:53,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 20:30:53,270 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:30:53,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:53,270 INFO L82 PathProgramCache]: Analyzing trace with hash -430171630, now seen corresponding path program 202 times [2020-02-10 20:30:53,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:53,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355110077] [2020-02-10 20:30:53,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:53,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:53,821 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-02-10 20:30:53,950 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:30:53,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:30:53,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355110077] [2020-02-10 20:30:53,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:53,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:30:53,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423020845] [2020-02-10 20:30:53,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:30:53,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:53,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:30:53,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:30:53,960 INFO L87 Difference]: Start difference. First operand 3134 states and 15605 transitions. Second operand 12 states. [2020-02-10 20:30:54,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:54,163 INFO L93 Difference]: Finished difference Result 6052 states and 26898 transitions. [2020-02-10 20:30:54,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:30:54,163 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:30:54,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:54,178 INFO L225 Difference]: With dead ends: 6052 [2020-02-10 20:30:54,178 INFO L226 Difference]: Without dead ends: 6021 [2020-02-10 20:30:54,178 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:30:54,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6021 states. [2020-02-10 20:30:54,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6021 to 3125. [2020-02-10 20:30:54,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 20:30:54,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15582 transitions. [2020-02-10 20:30:54,362 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15582 transitions. Word has length 31 [2020-02-10 20:30:54,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:54,362 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15582 transitions. [2020-02-10 20:30:54,362 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:30:54,362 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15582 transitions. [2020-02-10 20:30:54,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:30:54,367 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:54,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:30:54,367 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:30:54,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:54,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1134923010, now seen corresponding path program 203 times [2020-02-10 20:30:54,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:54,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147463777] [2020-02-10 20:30:54,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:54,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:54,914 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:30:55,049 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:30:55,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:30:55,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147463777] [2020-02-10 20:30:55,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:55,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:30:55,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208879932] [2020-02-10 20:30:55,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:30:55,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:55,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:30:55,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:30:55,059 INFO L87 Difference]: Start difference. First operand 3125 states and 15582 transitions. Second operand 12 states. [2020-02-10 20:30:55,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:55,308 INFO L93 Difference]: Finished difference Result 6040 states and 26874 transitions. [2020-02-10 20:30:55,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:30:55,308 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:30:55,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:55,323 INFO L225 Difference]: With dead ends: 6040 [2020-02-10 20:30:55,323 INFO L226 Difference]: Without dead ends: 6024 [2020-02-10 20:30:55,324 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:30:55,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6024 states. [2020-02-10 20:30:55,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6024 to 3131. [2020-02-10 20:30:55,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 20:30:55,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15593 transitions. [2020-02-10 20:30:55,506 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15593 transitions. Word has length 31 [2020-02-10 20:30:55,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:55,506 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15593 transitions. [2020-02-10 20:30:55,506 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:30:55,506 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15593 transitions. [2020-02-10 20:30:55,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:30:55,511 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:55,511 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:30:55,511 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:30:55,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:55,512 INFO L82 PathProgramCache]: Analyzing trace with hash -642327248, now seen corresponding path program 204 times [2020-02-10 20:30:55,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:55,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983281291] [2020-02-10 20:30:55,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:55,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:55,984 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 28 [2020-02-10 20:30:56,113 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:30:56,244 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:30:56,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:30:56,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983281291] [2020-02-10 20:30:56,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:56,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:30:56,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646992793] [2020-02-10 20:30:56,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:30:56,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:56,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:30:56,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:30:56,255 INFO L87 Difference]: Start difference. First operand 3131 states and 15593 transitions. Second operand 12 states. [2020-02-10 20:30:56,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:56,484 INFO L93 Difference]: Finished difference Result 6046 states and 26880 transitions. [2020-02-10 20:30:56,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:30:56,484 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:30:56,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:56,500 INFO L225 Difference]: With dead ends: 6046 [2020-02-10 20:30:56,500 INFO L226 Difference]: Without dead ends: 6012 [2020-02-10 20:30:56,500 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:30:56,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6012 states. [2020-02-10 20:30:56,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6012 to 3119. [2020-02-10 20:30:56,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 20:30:56,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15565 transitions. [2020-02-10 20:30:56,682 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15565 transitions. Word has length 31 [2020-02-10 20:30:56,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:56,682 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15565 transitions. [2020-02-10 20:30:56,682 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:30:56,682 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15565 transitions. [2020-02-10 20:30:56,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:30:56,687 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:56,687 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:30:56,688 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:30:56,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:56,688 INFO L82 PathProgramCache]: Analyzing trace with hash -670054096, now seen corresponding path program 205 times [2020-02-10 20:30:56,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:56,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86922780] [2020-02-10 20:30:56,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:56,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:57,240 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:30:57,372 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:30:57,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:30:57,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86922780] [2020-02-10 20:30:57,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:57,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:30:57,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135461389] [2020-02-10 20:30:57,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:30:57,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:57,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:30:57,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:30:57,383 INFO L87 Difference]: Start difference. First operand 3119 states and 15565 transitions. Second operand 12 states. [2020-02-10 20:30:57,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:57,676 INFO L93 Difference]: Finished difference Result 6051 states and 26912 transitions. [2020-02-10 20:30:57,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:30:57,676 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:30:57,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:57,691 INFO L225 Difference]: With dead ends: 6051 [2020-02-10 20:30:57,691 INFO L226 Difference]: Without dead ends: 6032 [2020-02-10 20:30:57,692 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:30:57,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6032 states. [2020-02-10 20:30:57,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6032 to 3134. [2020-02-10 20:30:57,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3134 states. [2020-02-10 20:30:57,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3134 states to 3134 states and 15608 transitions. [2020-02-10 20:30:57,878 INFO L78 Accepts]: Start accepts. Automaton has 3134 states and 15608 transitions. Word has length 31 [2020-02-10 20:30:57,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:57,879 INFO L479 AbstractCegarLoop]: Abstraction has 3134 states and 15608 transitions. [2020-02-10 20:30:57,879 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:30:57,879 INFO L276 IsEmpty]: Start isEmpty. Operand 3134 states and 15608 transitions. [2020-02-10 20:30:57,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:30:57,884 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:57,884 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:30:57,884 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:30:57,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:57,884 INFO L82 PathProgramCache]: Analyzing trace with hash 667513118, now seen corresponding path program 206 times [2020-02-10 20:30:57,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:57,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378432347] [2020-02-10 20:30:57,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:57,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:58,433 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:30:58,562 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:30:58,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:30:58,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378432347] [2020-02-10 20:30:58,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:58,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:30:58,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619617022] [2020-02-10 20:30:58,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:30:58,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:58,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:30:58,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:30:58,573 INFO L87 Difference]: Start difference. First operand 3134 states and 15608 transitions. Second operand 12 states. [2020-02-10 20:30:58,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:58,811 INFO L93 Difference]: Finished difference Result 6050 states and 26903 transitions. [2020-02-10 20:30:58,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:30:58,812 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:30:58,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:58,827 INFO L225 Difference]: With dead ends: 6050 [2020-02-10 20:30:58,827 INFO L226 Difference]: Without dead ends: 6025 [2020-02-10 20:30:58,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:30:58,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6025 states. [2020-02-10 20:30:59,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6025 to 3127. [2020-02-10 20:30:59,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:30:59,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15588 transitions. [2020-02-10 20:30:59,019 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15588 transitions. Word has length 31 [2020-02-10 20:30:59,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:30:59,019 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15588 transitions. [2020-02-10 20:30:59,019 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:30:59,020 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15588 transitions. [2020-02-10 20:30:59,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:30:59,025 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:30:59,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:30:59,025 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:30:59,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:30:59,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1306520950, now seen corresponding path program 207 times [2020-02-10 20:30:59,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:30:59,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127358627] [2020-02-10 20:30:59,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:30:59,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:30:59,699 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:30:59,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:30:59,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127358627] [2020-02-10 20:30:59,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:30:59,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:30:59,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084465853] [2020-02-10 20:30:59,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:30:59,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:30:59,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:30:59,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:30:59,709 INFO L87 Difference]: Start difference. First operand 3127 states and 15588 transitions. Second operand 12 states. [2020-02-10 20:30:59,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:30:59,954 INFO L93 Difference]: Finished difference Result 6057 states and 26917 transitions. [2020-02-10 20:30:59,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:30:59,955 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:30:59,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:30:59,969 INFO L225 Difference]: With dead ends: 6057 [2020-02-10 20:30:59,969 INFO L226 Difference]: Without dead ends: 6038 [2020-02-10 20:30:59,970 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:31:00,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6038 states. [2020-02-10 20:31:00,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6038 to 3136. [2020-02-10 20:31:00,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3136 states. [2020-02-10 20:31:00,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3136 states to 3136 states and 15605 transitions. [2020-02-10 20:31:00,159 INFO L78 Accepts]: Start accepts. Automaton has 3136 states and 15605 transitions. Word has length 31 [2020-02-10 20:31:00,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:00,159 INFO L479 AbstractCegarLoop]: Abstraction has 3136 states and 15605 transitions. [2020-02-10 20:31:00,159 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:31:00,159 INFO L276 IsEmpty]: Start isEmpty. Operand 3136 states and 15605 transitions. [2020-02-10 20:31:00,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:31:00,164 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:00,165 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:31:00,165 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:31:00,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:00,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1236410914, now seen corresponding path program 208 times [2020-02-10 20:31:00,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:00,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653513417] [2020-02-10 20:31:00,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:00,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:00,717 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-02-10 20:31:00,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 20:31:00,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:31:00,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653513417] [2020-02-10 20:31:00,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:00,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:31:00,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39447890] [2020-02-10 20:31:00,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:31:00,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:00,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:31:00,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:31:00,861 INFO L87 Difference]: Start difference. First operand 3136 states and 15605 transitions. Second operand 12 states. [2020-02-10 20:31:01,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:01,075 INFO L93 Difference]: Finished difference Result 6060 states and 26914 transitions. [2020-02-10 20:31:01,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:31:01,075 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:31:01,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:01,090 INFO L225 Difference]: With dead ends: 6060 [2020-02-10 20:31:01,090 INFO L226 Difference]: Without dead ends: 6029 [2020-02-10 20:31:01,090 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:31:01,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6029 states. [2020-02-10 20:31:01,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6029 to 3127. [2020-02-10 20:31:01,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:31:01,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15580 transitions. [2020-02-10 20:31:01,279 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15580 transitions. Word has length 31 [2020-02-10 20:31:01,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:01,279 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15580 transitions. [2020-02-10 20:31:01,279 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:31:01,279 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15580 transitions. [2020-02-10 20:31:01,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:31:01,284 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:01,284 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:31:01,284 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:31:01,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:01,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1454043062, now seen corresponding path program 209 times [2020-02-10 20:31:01,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:01,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21802499] [2020-02-10 20:31:01,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:01,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:01,849 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:31:01,979 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:31:01,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:31:01,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21802499] [2020-02-10 20:31:01,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:01,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:31:01,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053207922] [2020-02-10 20:31:01,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:31:01,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:01,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:31:01,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:31:01,989 INFO L87 Difference]: Start difference. First operand 3127 states and 15580 transitions. Second operand 12 states. [2020-02-10 20:31:02,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:02,213 INFO L93 Difference]: Finished difference Result 6054 states and 26902 transitions. [2020-02-10 20:31:02,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:31:02,213 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:31:02,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:02,229 INFO L225 Difference]: With dead ends: 6054 [2020-02-10 20:31:02,229 INFO L226 Difference]: Without dead ends: 6036 [2020-02-10 20:31:02,229 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:31:02,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6036 states. [2020-02-10 20:31:02,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6036 to 3135. [2020-02-10 20:31:02,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2020-02-10 20:31:02,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 15595 transitions. [2020-02-10 20:31:02,417 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 15595 transitions. Word has length 31 [2020-02-10 20:31:02,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:02,418 INFO L479 AbstractCegarLoop]: Abstraction has 3135 states and 15595 transitions. [2020-02-10 20:31:02,418 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:31:02,418 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 15595 transitions. [2020-02-10 20:31:02,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:31:02,423 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:02,423 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:31:02,423 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:31:02,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:02,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1573467056, now seen corresponding path program 210 times [2020-02-10 20:31:02,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:02,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518500177] [2020-02-10 20:31:02,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:02,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:02,981 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:31:03,161 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:31:03,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:31:03,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518500177] [2020-02-10 20:31:03,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:03,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:31:03,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072855710] [2020-02-10 20:31:03,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:31:03,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:03,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:31:03,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:31:03,170 INFO L87 Difference]: Start difference. First operand 3135 states and 15595 transitions. Second operand 12 states. [2020-02-10 20:31:03,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:03,365 INFO L93 Difference]: Finished difference Result 6058 states and 26902 transitions. [2020-02-10 20:31:03,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:31:03,365 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:31:03,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:03,379 INFO L225 Difference]: With dead ends: 6058 [2020-02-10 20:31:03,379 INFO L226 Difference]: Without dead ends: 6020 [2020-02-10 20:31:03,379 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:31:03,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6020 states. [2020-02-10 20:31:03,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6020 to 3119. [2020-02-10 20:31:03,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 20:31:03,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15559 transitions. [2020-02-10 20:31:03,563 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15559 transitions. Word has length 31 [2020-02-10 20:31:03,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:03,563 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15559 transitions. [2020-02-10 20:31:03,563 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:31:03,563 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15559 transitions. [2020-02-10 20:31:03,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:31:03,568 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:03,569 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:31:03,569 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:31:03,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:03,569 INFO L82 PathProgramCache]: Analyzing trace with hash 708414994, now seen corresponding path program 211 times [2020-02-10 20:31:03,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:03,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229126813] [2020-02-10 20:31:03,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:03,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:04,087 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:31:04,222 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:31:04,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:31:04,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229126813] [2020-02-10 20:31:04,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:04,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:31:04,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383135882] [2020-02-10 20:31:04,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:31:04,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:04,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:31:04,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:31:04,233 INFO L87 Difference]: Start difference. First operand 3119 states and 15559 transitions. Second operand 12 states. [2020-02-10 20:31:04,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:04,482 INFO L93 Difference]: Finished difference Result 6033 states and 26859 transitions. [2020-02-10 20:31:04,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:31:04,482 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:31:04,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:04,496 INFO L225 Difference]: With dead ends: 6033 [2020-02-10 20:31:04,497 INFO L226 Difference]: Without dead ends: 6017 [2020-02-10 20:31:04,497 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:31:04,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6017 states. [2020-02-10 20:31:04,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6017 to 3130. [2020-02-10 20:31:04,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 20:31:04,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15590 transitions. [2020-02-10 20:31:04,687 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15590 transitions. Word has length 31 [2020-02-10 20:31:04,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:04,687 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15590 transitions. [2020-02-10 20:31:04,687 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:31:04,687 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15590 transitions. [2020-02-10 20:31:04,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:31:04,692 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:04,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:31:04,693 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:31:04,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:04,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1826499362, now seen corresponding path program 212 times [2020-02-10 20:31:04,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:04,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674616695] [2020-02-10 20:31:04,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:04,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:05,225 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:31:05,356 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:31:05,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:31:05,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674616695] [2020-02-10 20:31:05,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:05,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:31:05,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039796421] [2020-02-10 20:31:05,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:31:05,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:05,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:31:05,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:31:05,365 INFO L87 Difference]: Start difference. First operand 3130 states and 15590 transitions. Second operand 12 states. [2020-02-10 20:31:05,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:05,622 INFO L93 Difference]: Finished difference Result 6035 states and 26858 transitions. [2020-02-10 20:31:05,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:31:05,622 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:31:05,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:05,636 INFO L225 Difference]: With dead ends: 6035 [2020-02-10 20:31:05,637 INFO L226 Difference]: Without dead ends: 6012 [2020-02-10 20:31:05,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:31:05,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6012 states. [2020-02-10 20:31:05,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6012 to 3125. [2020-02-10 20:31:05,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 20:31:05,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15576 transitions. [2020-02-10 20:31:05,833 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15576 transitions. Word has length 31 [2020-02-10 20:31:05,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:05,833 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15576 transitions. [2020-02-10 20:31:05,833 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:31:05,833 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15576 transitions. [2020-02-10 20:31:05,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:31:05,838 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:05,838 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:31:05,839 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:31:05,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:05,839 INFO L82 PathProgramCache]: Analyzing trace with hash 71948140, now seen corresponding path program 213 times [2020-02-10 20:31:05,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:05,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387775908] [2020-02-10 20:31:05,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:05,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:06,353 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:31:06,488 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:31:06,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:31:06,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387775908] [2020-02-10 20:31:06,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:06,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:31:06,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515044833] [2020-02-10 20:31:06,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:31:06,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:06,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:31:06,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:31:06,498 INFO L87 Difference]: Start difference. First operand 3125 states and 15576 transitions. Second operand 12 states. [2020-02-10 20:31:06,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:06,795 INFO L93 Difference]: Finished difference Result 6038 states and 26863 transitions. [2020-02-10 20:31:06,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:31:06,796 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:31:06,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:06,810 INFO L225 Difference]: With dead ends: 6038 [2020-02-10 20:31:06,810 INFO L226 Difference]: Without dead ends: 6022 [2020-02-10 20:31:06,810 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:31:06,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6022 states. [2020-02-10 20:31:06,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6022 to 3131. [2020-02-10 20:31:06,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 20:31:07,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15587 transitions. [2020-02-10 20:31:07,005 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15587 transitions. Word has length 31 [2020-02-10 20:31:07,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:07,005 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15587 transitions. [2020-02-10 20:31:07,005 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:31:07,005 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15587 transitions. [2020-02-10 20:31:07,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:31:07,010 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:07,011 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:31:07,011 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:31:07,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:07,011 INFO L82 PathProgramCache]: Analyzing trace with hash 564543902, now seen corresponding path program 214 times [2020-02-10 20:31:07,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:07,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455812581] [2020-02-10 20:31:07,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:07,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:07,541 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:31:07,677 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:31:07,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:31:07,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455812581] [2020-02-10 20:31:07,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:07,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:31:07,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114130487] [2020-02-10 20:31:07,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:31:07,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:07,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:31:07,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:31:07,688 INFO L87 Difference]: Start difference. First operand 3131 states and 15587 transitions. Second operand 12 states. [2020-02-10 20:31:07,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:07,884 INFO L93 Difference]: Finished difference Result 6044 states and 26869 transitions. [2020-02-10 20:31:07,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:31:07,884 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:31:07,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:07,898 INFO L225 Difference]: With dead ends: 6044 [2020-02-10 20:31:07,898 INFO L226 Difference]: Without dead ends: 6016 [2020-02-10 20:31:07,899 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:31:08,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6016 states. [2020-02-10 20:31:08,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6016 to 3125. [2020-02-10 20:31:08,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 20:31:08,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15570 transitions. [2020-02-10 20:31:08,087 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15570 transitions. Word has length 31 [2020-02-10 20:31:08,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:08,088 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15570 transitions. [2020-02-10 20:31:08,088 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:31:08,088 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15570 transitions. [2020-02-10 20:31:08,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:31:08,093 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:08,093 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:31:08,093 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:31:08,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:08,093 INFO L82 PathProgramCache]: Analyzing trace with hash 559067372, now seen corresponding path program 215 times [2020-02-10 20:31:08,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:08,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451925043] [2020-02-10 20:31:08,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:08,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:08,630 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:31:08,766 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:31:08,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:31:08,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451925043] [2020-02-10 20:31:08,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:08,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:31:08,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187979862] [2020-02-10 20:31:08,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:31:08,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:08,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:31:08,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:31:08,775 INFO L87 Difference]: Start difference. First operand 3125 states and 15570 transitions. Second operand 12 states. [2020-02-10 20:31:09,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:09,033 INFO L93 Difference]: Finished difference Result 6044 states and 26871 transitions. [2020-02-10 20:31:09,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:31:09,034 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:31:09,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:09,048 INFO L225 Difference]: With dead ends: 6044 [2020-02-10 20:31:09,048 INFO L226 Difference]: Without dead ends: 6026 [2020-02-10 20:31:09,049 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:31:09,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6026 states. [2020-02-10 20:31:09,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6026 to 3133. [2020-02-10 20:31:09,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-02-10 20:31:09,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15585 transitions. [2020-02-10 20:31:09,237 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15585 transitions. Word has length 31 [2020-02-10 20:31:09,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:09,237 INFO L479 AbstractCegarLoop]: Abstraction has 3133 states and 15585 transitions. [2020-02-10 20:31:09,237 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:31:09,237 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15585 transitions. [2020-02-10 20:31:09,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:31:09,242 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:09,242 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:31:09,242 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:31:09,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:09,243 INFO L82 PathProgramCache]: Analyzing trace with hash -708389806, now seen corresponding path program 216 times [2020-02-10 20:31:09,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:09,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302911269] [2020-02-10 20:31:09,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:09,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:09,794 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:31:09,925 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:31:09,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:31:09,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302911269] [2020-02-10 20:31:09,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:09,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:31:09,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710366704] [2020-02-10 20:31:09,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:31:09,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:09,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:31:09,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:31:09,936 INFO L87 Difference]: Start difference. First operand 3133 states and 15585 transitions. Second operand 12 states. [2020-02-10 20:31:10,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:10,221 INFO L93 Difference]: Finished difference Result 6048 states and 26871 transitions. [2020-02-10 20:31:10,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:31:10,222 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:31:10,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:10,236 INFO L225 Difference]: With dead ends: 6048 [2020-02-10 20:31:10,236 INFO L226 Difference]: Without dead ends: 6006 [2020-02-10 20:31:10,237 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:31:10,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6006 states. [2020-02-10 20:31:10,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6006 to 3113. [2020-02-10 20:31:10,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3113 states. [2020-02-10 20:31:10,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3113 states to 3113 states and 15542 transitions. [2020-02-10 20:31:10,420 INFO L78 Accepts]: Start accepts. Automaton has 3113 states and 15542 transitions. Word has length 31 [2020-02-10 20:31:10,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:10,421 INFO L479 AbstractCegarLoop]: Abstraction has 3113 states and 15542 transitions. [2020-02-10 20:31:10,421 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:31:10,421 INFO L276 IsEmpty]: Start isEmpty. Operand 3113 states and 15542 transitions. [2020-02-10 20:31:10,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:31:10,426 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31: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:31:10,426 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:31:10,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:10,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1409124346, now seen corresponding path program 217 times [2020-02-10 20:31:10,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:10,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474396851] [2020-02-10 20:31:10,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:10,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:10,950 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:31:11,083 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:31:11,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:31:11,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474396851] [2020-02-10 20:31:11,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:11,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:31:11,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878822707] [2020-02-10 20:31:11,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:31:11,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:11,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:31:11,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:31:11,094 INFO L87 Difference]: Start difference. First operand 3113 states and 15542 transitions. Second operand 12 states. [2020-02-10 20:31:11,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:11,378 INFO L93 Difference]: Finished difference Result 6036 states and 26877 transitions. [2020-02-10 20:31:11,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:31:11,379 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:31:11,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:11,392 INFO L225 Difference]: With dead ends: 6036 [2020-02-10 20:31:11,392 INFO L226 Difference]: Without dead ends: 6020 [2020-02-10 20:31:11,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 20:31:11,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6020 states. [2020-02-10 20:31:11,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6020 to 3130. [2020-02-10 20:31:11,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 20:31:11,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15601 transitions. [2020-02-10 20:31:11,576 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15601 transitions. Word has length 31 [2020-02-10 20:31:11,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:11,577 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15601 transitions. [2020-02-10 20:31:11,577 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:31:11,577 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15601 transitions. [2020-02-10 20:31:11,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:31:11,582 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:11,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:31:11,582 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:31:11,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:11,582 INFO L82 PathProgramCache]: Analyzing trace with hash 2040871498, now seen corresponding path program 218 times [2020-02-10 20:31:11,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:11,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900065814] [2020-02-10 20:31:11,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:11,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:12,108 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:31:12,239 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:31:12,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:31:12,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900065814] [2020-02-10 20:31:12,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:12,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:31:12,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18730043] [2020-02-10 20:31:12,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:31:12,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:12,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:31:12,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:31:12,249 INFO L87 Difference]: Start difference. First operand 3130 states and 15601 transitions. Second operand 12 states. [2020-02-10 20:31:12,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:12,503 INFO L93 Difference]: Finished difference Result 6040 states and 26880 transitions. [2020-02-10 20:31:12,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:31:12,503 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:31:12,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:12,518 INFO L225 Difference]: With dead ends: 6040 [2020-02-10 20:31:12,518 INFO L226 Difference]: Without dead ends: 6015 [2020-02-10 20:31:12,518 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:31:12,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6015 states. [2020-02-10 20:31:12,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6015 to 3125. [2020-02-10 20:31:12,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 20:31:12,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15587 transitions. [2020-02-10 20:31:12,704 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15587 transitions. Word has length 31 [2020-02-10 20:31:12,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:12,705 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15587 transitions. [2020-02-10 20:31:12,705 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:31:12,705 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15587 transitions. [2020-02-10 20:31:12,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:31:12,710 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:12,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:31:12,710 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:31:12,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:12,710 INFO L82 PathProgramCache]: Analyzing trace with hash 2037220478, now seen corresponding path program 219 times [2020-02-10 20:31:12,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:12,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621564855] [2020-02-10 20:31:12,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:12,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:13,241 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:31:13,371 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:31:13,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:31:13,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621564855] [2020-02-10 20:31:13,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:13,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:31:13,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607103598] [2020-02-10 20:31:13,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:31:13,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:13,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:31:13,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:31:13,382 INFO L87 Difference]: Start difference. First operand 3125 states and 15587 transitions. Second operand 12 states. [2020-02-10 20:31:13,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:13,638 INFO L93 Difference]: Finished difference Result 6034 states and 26868 transitions. [2020-02-10 20:31:13,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:31:13,639 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:31:13,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:13,654 INFO L225 Difference]: With dead ends: 6034 [2020-02-10 20:31:13,654 INFO L226 Difference]: Without dead ends: 6018 [2020-02-10 20:31:13,654 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:31:13,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6018 states. [2020-02-10 20:31:13,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6018 to 3130. [2020-02-10 20:31:13,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 20:31:13,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15596 transitions. [2020-02-10 20:31:13,839 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15596 transitions. Word has length 31 [2020-02-10 20:31:13,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:13,839 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15596 transitions. [2020-02-10 20:31:13,839 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:31:13,839 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15596 transitions. [2020-02-10 20:31:13,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:31:13,844 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:13,844 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:31:13,844 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:31:13,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:13,845 INFO L82 PathProgramCache]: Analyzing trace with hash -497693878, now seen corresponding path program 220 times [2020-02-10 20:31:13,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:13,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399180423] [2020-02-10 20:31:13,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:13,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:14,377 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:31:14,513 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:31:14,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:31:14,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399180423] [2020-02-10 20:31:14,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:14,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:31:14,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022302431] [2020-02-10 20:31:14,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:31:14,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:14,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:31:14,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:31:14,522 INFO L87 Difference]: Start difference. First operand 3130 states and 15596 transitions. Second operand 12 states. [2020-02-10 20:31:14,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:14,768 INFO L93 Difference]: Finished difference Result 6036 states and 26867 transitions. [2020-02-10 20:31:14,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:31:14,769 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:31:14,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:14,784 INFO L225 Difference]: With dead ends: 6036 [2020-02-10 20:31:14,784 INFO L226 Difference]: Without dead ends: 6013 [2020-02-10 20:31:14,784 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:31:14,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6013 states. [2020-02-10 20:31:14,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6013 to 3125. [2020-02-10 20:31:14,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 20:31:14,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15582 transitions. [2020-02-10 20:31:14,974 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15582 transitions. Word has length 31 [2020-02-10 20:31:14,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:14,974 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15582 transitions. [2020-02-10 20:31:14,974 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:31:14,974 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15582 transitions. [2020-02-10 20:31:14,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:31:14,979 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:14,979 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:31:14,979 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:31:14,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:14,979 INFO L82 PathProgramCache]: Analyzing trace with hash 767937790, now seen corresponding path program 221 times [2020-02-10 20:31:14,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:14,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392700927] [2020-02-10 20:31:14,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:14,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:15,503 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:31:15,634 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:31:15,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:31:15,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392700927] [2020-02-10 20:31:15,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:15,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:31:15,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148226837] [2020-02-10 20:31:15,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:31:15,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:15,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:31:15,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:31:15,644 INFO L87 Difference]: Start difference. First operand 3125 states and 15582 transitions. Second operand 12 states. [2020-02-10 20:31:15,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:15,895 INFO L93 Difference]: Finished difference Result 6044 states and 26885 transitions. [2020-02-10 20:31:15,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:31:15,895 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:31:15,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:15,910 INFO L225 Difference]: With dead ends: 6044 [2020-02-10 20:31:15,910 INFO L226 Difference]: Without dead ends: 6024 [2020-02-10 20:31:15,911 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:31:16,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6024 states. [2020-02-10 20:31:16,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6024 to 3132. [2020-02-10 20:31:16,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-02-10 20:31:16,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15595 transitions. [2020-02-10 20:31:16,102 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15595 transitions. Word has length 31 [2020-02-10 20:31:16,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:16,102 INFO L479 AbstractCegarLoop]: Abstraction has 3132 states and 15595 transitions. [2020-02-10 20:31:16,102 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:31:16,102 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15595 transitions. [2020-02-10 20:31:16,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:31:16,108 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:16,109 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:31:16,109 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:31:16,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:16,109 INFO L82 PathProgramCache]: Analyzing trace with hash -922005114, now seen corresponding path program 222 times [2020-02-10 20:31:16,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:16,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057696055] [2020-02-10 20:31:16,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:16,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:16,628 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:31:16,759 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:31:16,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:31:16,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057696055] [2020-02-10 20:31:16,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:16,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:31:16,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589842765] [2020-02-10 20:31:16,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:31:16,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:16,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:31:16,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:31:16,769 INFO L87 Difference]: Start difference. First operand 3132 states and 15595 transitions. Second operand 12 states. [2020-02-10 20:31:17,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:17,004 INFO L93 Difference]: Finished difference Result 6042 states and 26874 transitions. [2020-02-10 20:31:17,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:31:17,005 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:31:17,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:17,020 INFO L225 Difference]: With dead ends: 6042 [2020-02-10 20:31:17,020 INFO L226 Difference]: Without dead ends: 6012 [2020-02-10 20:31:17,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:31:17,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6012 states. [2020-02-10 20:31:17,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6012 to 3120. [2020-02-10 20:31:17,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3120 states. [2020-02-10 20:31:17,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 15568 transitions. [2020-02-10 20:31:17,242 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 15568 transitions. Word has length 31 [2020-02-10 20:31:17,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:17,242 INFO L479 AbstractCegarLoop]: Abstraction has 3120 states and 15568 transitions. [2020-02-10 20:31:17,242 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:31:17,243 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 15568 transitions. [2020-02-10 20:31:17,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:31:17,248 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:17,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:31:17,248 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:31:17,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:17,248 INFO L82 PathProgramCache]: Analyzing trace with hash 335239660, now seen corresponding path program 223 times [2020-02-10 20:31:17,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:17,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570985837] [2020-02-10 20:31:17,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:17,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:17,782 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:31:17,911 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:31:17,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:31:17,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570985837] [2020-02-10 20:31:17,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:17,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:31:17,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2294976] [2020-02-10 20:31:17,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:31:17,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:17,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:31:17,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:31:17,920 INFO L87 Difference]: Start difference. First operand 3120 states and 15568 transitions. Second operand 12 states. [2020-02-10 20:31:18,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:18,218 INFO L93 Difference]: Finished difference Result 6047 states and 26895 transitions. [2020-02-10 20:31:18,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:31:18,219 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:31:18,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:18,234 INFO L225 Difference]: With dead ends: 6047 [2020-02-10 20:31:18,234 INFO L226 Difference]: Without dead ends: 6031 [2020-02-10 20:31:18,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 20:31:18,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6031 states. [2020-02-10 20:31:18,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6031 to 3132. [2020-02-10 20:31:18,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-02-10 20:31:18,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15601 transitions. [2020-02-10 20:31:18,416 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15601 transitions. Word has length 31 [2020-02-10 20:31:18,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:18,416 INFO L479 AbstractCegarLoop]: Abstraction has 3132 states and 15601 transitions. [2020-02-10 20:31:18,417 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:31:18,417 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15601 transitions. [2020-02-10 20:31:18,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:31:18,422 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:18,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:31:18,422 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:31:18,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:18,422 INFO L82 PathProgramCache]: Analyzing trace with hash -509731792, now seen corresponding path program 224 times [2020-02-10 20:31:18,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:18,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005256378] [2020-02-10 20:31:18,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:18,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:18,937 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:31:19,065 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:31:19,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 20:31:19,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005256378] [2020-02-10 20:31:19,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:19,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:31:19,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750180696] [2020-02-10 20:31:19,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:31:19,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:19,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:31:19,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:31:19,075 INFO L87 Difference]: Start difference. First operand 3132 states and 15601 transitions. Second operand 12 states. [2020-02-10 20:31:19,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:19,425 INFO L93 Difference]: Finished difference Result 6051 states and 26898 transitions. [2020-02-10 20:31:19,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:31:19,426 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:31:19,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:19,440 INFO L225 Difference]: With dead ends: 6051 [2020-02-10 20:31:19,440 INFO L226 Difference]: Without dead ends: 6026 [2020-02-10 20:31:19,441 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:31:19,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6026 states. [2020-02-10 20:31:19,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6026 to 3127. [2020-02-10 20:31:19,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:31:19,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15587 transitions. [2020-02-10 20:31:19,632 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15587 transitions. Word has length 31 [2020-02-10 20:31:19,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:19,632 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15587 transitions. [2020-02-10 20:31:19,632 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:31:19,632 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15587 transitions. [2020-02-10 20:31:19,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:31:19,638 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:19,638 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:31:19,638 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:31:19,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:19,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1149849666, now seen corresponding path program 225 times [2020-02-10 20:31:19,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:19,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528726029] [2020-02-10 20:31:19,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:19,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:20,166 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:31:20,299 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:31:20,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:31:20,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528726029] [2020-02-10 20:31:20,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:20,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:31:20,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864510363] [2020-02-10 20:31:20,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:31:20,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:20,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:31:20,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:31:20,309 INFO L87 Difference]: Start difference. First operand 3127 states and 15587 transitions. Second operand 12 states. [2020-02-10 20:31:20,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:20,664 INFO L93 Difference]: Finished difference Result 6050 states and 26895 transitions. [2020-02-10 20:31:20,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:31:20,665 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:31:20,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:20,680 INFO L225 Difference]: With dead ends: 6050 [2020-02-10 20:31:20,680 INFO L226 Difference]: Without dead ends: 6034 [2020-02-10 20:31:20,680 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:31:20,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6034 states. [2020-02-10 20:31:20,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6034 to 3133. [2020-02-10 20:31:20,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-02-10 20:31:20,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15598 transitions. [2020-02-10 20:31:20,867 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15598 transitions. Word has length 31 [2020-02-10 20:31:20,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:20,867 INFO L479 AbstractCegarLoop]: Abstraction has 3133 states and 15598 transitions. [2020-02-10 20:31:20,867 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:31:20,867 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15598 transitions. [2020-02-10 20:31:20,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:31:20,872 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:20,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:31:20,873 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:31:20,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:20,873 INFO L82 PathProgramCache]: Analyzing trace with hash -657253904, now seen corresponding path program 226 times [2020-02-10 20:31:20,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:20,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210662484] [2020-02-10 20:31:20,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:20,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:21,409 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-02-10 20:31:21,544 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:31:21,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:31:21,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210662484] [2020-02-10 20:31:21,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:21,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:31:21,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29443644] [2020-02-10 20:31:21,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:31:21,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:21,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:31:21,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:31:21,554 INFO L87 Difference]: Start difference. First operand 3133 states and 15598 transitions. Second operand 12 states. [2020-02-10 20:31:21,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:21,869 INFO L93 Difference]: Finished difference Result 6056 states and 26901 transitions. [2020-02-10 20:31:21,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:31:21,869 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:31:21,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:21,884 INFO L225 Difference]: With dead ends: 6056 [2020-02-10 20:31:21,885 INFO L226 Difference]: Without dead ends: 6028 [2020-02-10 20:31:21,885 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:31:22,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6028 states. [2020-02-10 20:31:22,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6028 to 3127. [2020-02-10 20:31:22,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:31:22,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15581 transitions. [2020-02-10 20:31:22,073 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15581 transitions. Word has length 31 [2020-02-10 20:31:22,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:22,073 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15581 transitions. [2020-02-10 20:31:22,073 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:31:22,073 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15581 transitions. [2020-02-10 20:31:22,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:31:22,078 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:22,078 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:31:22,078 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:31:22,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:22,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1875834942, now seen corresponding path program 227 times [2020-02-10 20:31:22,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:22,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251836571] [2020-02-10 20:31:22,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:22,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:22,627 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:31:22,754 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:31:22,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:31:22,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251836571] [2020-02-10 20:31:22,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:22,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:31:22,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717247929] [2020-02-10 20:31:22,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:31:22,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:22,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:31:22,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:31:22,765 INFO L87 Difference]: Start difference. First operand 3127 states and 15581 transitions. Second operand 12 states. [2020-02-10 20:31:23,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:23,120 INFO L93 Difference]: Finished difference Result 6063 states and 26918 transitions. [2020-02-10 20:31:23,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:31:23,120 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:31:23,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:23,135 INFO L225 Difference]: With dead ends: 6063 [2020-02-10 20:31:23,135 INFO L226 Difference]: Without dead ends: 6043 [2020-02-10 20:31:23,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:31:23,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6043 states. [2020-02-10 20:31:23,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6043 to 3138. [2020-02-10 20:31:23,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3138 states. [2020-02-10 20:31:23,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3138 states to 3138 states and 15601 transitions. [2020-02-10 20:31:23,319 INFO L78 Accepts]: Start accepts. Automaton has 3138 states and 15601 transitions. Word has length 31 [2020-02-10 20:31:23,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:23,319 INFO L479 AbstractCegarLoop]: Abstraction has 3138 states and 15601 transitions. [2020-02-10 20:31:23,320 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:31:23,320 INFO L276 IsEmpty]: Start isEmpty. Operand 3138 states and 15601 transitions. [2020-02-10 20:31:23,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:31:23,325 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:23,325 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:31:23,325 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:31:23,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:23,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1081565140, now seen corresponding path program 228 times [2020-02-10 20:31:23,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:23,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22512381] [2020-02-10 20:31:23,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:23,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:23,873 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-02-10 20:31:23,997 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 33 [2020-02-10 20:31:24,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:31:24,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22512381] [2020-02-10 20:31:24,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:24,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:31:24,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648244942] [2020-02-10 20:31:24,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:31:24,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:24,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:31:24,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:31:24,007 INFO L87 Difference]: Start difference. First operand 3138 states and 15601 transitions. Second operand 12 states. [2020-02-10 20:31:24,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:24,327 INFO L93 Difference]: Finished difference Result 6065 states and 26912 transitions. [2020-02-10 20:31:24,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:31:24,327 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:31:24,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:24,342 INFO L225 Difference]: With dead ends: 6065 [2020-02-10 20:31:24,342 INFO L226 Difference]: Without dead ends: 6025 [2020-02-10 20:31:24,342 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:31:24,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6025 states. [2020-02-10 20:31:24,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6025 to 3120. [2020-02-10 20:31:24,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3120 states. [2020-02-10 20:31:24,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 15561 transitions. [2020-02-10 20:31:24,566 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 15561 transitions. Word has length 31 [2020-02-10 20:31:24,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:24,566 INFO L479 AbstractCegarLoop]: Abstraction has 3120 states and 15561 transitions. [2020-02-10 20:31:24,566 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:31:24,566 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 15561 transitions. [2020-02-10 20:31:24,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:31:24,571 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:24,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 20:31:24,571 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:31:24,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:24,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1050875668, now seen corresponding path program 229 times [2020-02-10 20:31:24,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:24,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406656621] [2020-02-10 20:31:24,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:24,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:25,100 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:31:25,231 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:31:25,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:31:25,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406656621] [2020-02-10 20:31:25,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:25,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:31:25,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176361585] [2020-02-10 20:31:25,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:31:25,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:25,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:31:25,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:31:25,241 INFO L87 Difference]: Start difference. First operand 3120 states and 15561 transitions. Second operand 12 states. [2020-02-10 20:31:25,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:25,463 INFO L93 Difference]: Finished difference Result 6039 states and 26871 transitions. [2020-02-10 20:31:25,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:31:25,464 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:31:25,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:25,478 INFO L225 Difference]: With dead ends: 6039 [2020-02-10 20:31:25,478 INFO L226 Difference]: Without dead ends: 6023 [2020-02-10 20:31:25,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:31:25,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6023 states. [2020-02-10 20:31:25,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6023 to 3131. [2020-02-10 20:31:25,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 20:31:25,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15592 transitions. [2020-02-10 20:31:25,663 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15592 transitions. Word has length 31 [2020-02-10 20:31:25,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:25,663 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15592 transitions. [2020-02-10 20:31:25,663 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:31:25,663 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15592 transitions. [2020-02-10 20:31:25,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:31:25,668 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:25,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 20:31:25,668 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:31:25,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:25,669 INFO L82 PathProgramCache]: Analyzing trace with hash 709177272, now seen corresponding path program 230 times [2020-02-10 20:31:25,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:25,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320531114] [2020-02-10 20:31:25,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:25,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:26,235 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:31:26,365 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:31:26,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:31:26,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320531114] [2020-02-10 20:31:26,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:26,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:31:26,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884693731] [2020-02-10 20:31:26,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:31:26,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:26,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:31:26,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:31:26,375 INFO L87 Difference]: Start difference. First operand 3131 states and 15592 transitions. Second operand 12 states. [2020-02-10 20:31:26,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:26,600 INFO L93 Difference]: Finished difference Result 6041 states and 26870 transitions. [2020-02-10 20:31:26,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:31:26,601 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:31:26,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:26,615 INFO L225 Difference]: With dead ends: 6041 [2020-02-10 20:31:26,615 INFO L226 Difference]: Without dead ends: 6018 [2020-02-10 20:31:26,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:31:26,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6018 states. [2020-02-10 20:31:26,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6018 to 3126. [2020-02-10 20:31:26,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 20:31:26,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15578 transitions. [2020-02-10 20:31:26,797 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15578 transitions. Word has length 31 [2020-02-10 20:31:26,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:26,797 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15578 transitions. [2020-02-10 20:31:26,797 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:31:26,797 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15578 transitions. [2020-02-10 20:31:26,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:31:26,802 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:26,802 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:31:26,802 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:31:26,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:26,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1687342522, now seen corresponding path program 231 times [2020-02-10 20:31:26,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:26,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348797912] [2020-02-10 20:31:26,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:26,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:27,347 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:31:27,480 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:31:27,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:31:27,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348797912] [2020-02-10 20:31:27,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:27,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:31:27,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923106160] [2020-02-10 20:31:27,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:31:27,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:27,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:31:27,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:31:27,490 INFO L87 Difference]: Start difference. First operand 3126 states and 15578 transitions. Second operand 12 states. [2020-02-10 20:31:27,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:27,709 INFO L93 Difference]: Finished difference Result 6044 states and 26875 transitions. [2020-02-10 20:31:27,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:31:27,710 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:31:27,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:27,725 INFO L225 Difference]: With dead ends: 6044 [2020-02-10 20:31:27,725 INFO L226 Difference]: Without dead ends: 6028 [2020-02-10 20:31:27,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:31:27,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6028 states. [2020-02-10 20:31:27,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6028 to 3132. [2020-02-10 20:31:27,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-02-10 20:31:27,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15589 transitions. [2020-02-10 20:31:27,914 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15589 transitions. Word has length 31 [2020-02-10 20:31:27,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:27,914 INFO L479 AbstractCegarLoop]: Abstraction has 3132 states and 15589 transitions. [2020-02-10 20:31:27,914 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:31:27,914 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15589 transitions. [2020-02-10 20:31:27,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:31:27,919 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:27,919 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:31:27,920 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:31:27,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:27,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1194746760, now seen corresponding path program 232 times [2020-02-10 20:31:27,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:27,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684971274] [2020-02-10 20:31:27,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:27,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:28,461 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-02-10 20:31:28,590 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:31:28,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:31:28,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684971274] [2020-02-10 20:31:28,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:28,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:31:28,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057647440] [2020-02-10 20:31:28,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:31:28,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:28,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:31:28,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:31:28,601 INFO L87 Difference]: Start difference. First operand 3132 states and 15589 transitions. Second operand 12 states. [2020-02-10 20:31:28,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:28,781 INFO L93 Difference]: Finished difference Result 6050 states and 26881 transitions. [2020-02-10 20:31:28,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:31:28,782 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:31:28,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:28,796 INFO L225 Difference]: With dead ends: 6050 [2020-02-10 20:31:28,796 INFO L226 Difference]: Without dead ends: 6022 [2020-02-10 20:31:28,796 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:31:28,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6022 states. [2020-02-10 20:31:28,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6022 to 3126. [2020-02-10 20:31:28,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 20:31:28,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15572 transitions. [2020-02-10 20:31:28,980 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15572 transitions. Word has length 31 [2020-02-10 20:31:28,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:28,981 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15572 transitions. [2020-02-10 20:31:28,981 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:31:28,981 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15572 transitions. [2020-02-10 20:31:28,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:31:28,986 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:28,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:31:28,986 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:31:28,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:28,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1200223290, now seen corresponding path program 233 times [2020-02-10 20:31:28,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:28,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519969971] [2020-02-10 20:31:28,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:28,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:29,530 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:31:29,658 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 33 [2020-02-10 20:31:29,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:31:29,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519969971] [2020-02-10 20:31:29,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:29,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:31:29,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774094159] [2020-02-10 20:31:29,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:31:29,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:29,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:31:29,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:31:29,668 INFO L87 Difference]: Start difference. First operand 3126 states and 15572 transitions. Second operand 12 states. [2020-02-10 20:31:29,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:29,888 INFO L93 Difference]: Finished difference Result 6050 states and 26883 transitions. [2020-02-10 20:31:29,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:31:29,889 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:31:29,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:29,903 INFO L225 Difference]: With dead ends: 6050 [2020-02-10 20:31:29,903 INFO L226 Difference]: Without dead ends: 6032 [2020-02-10 20:31:29,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:31:30,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6032 states. [2020-02-10 20:31:30,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6032 to 3134. [2020-02-10 20:31:30,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3134 states. [2020-02-10 20:31:30,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3134 states to 3134 states and 15587 transitions. [2020-02-10 20:31:30,086 INFO L78 Accepts]: Start accepts. Automaton has 3134 states and 15587 transitions. Word has length 31 [2020-02-10 20:31:30,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:30,086 INFO L479 AbstractCegarLoop]: Abstraction has 3134 states and 15587 transitions. [2020-02-10 20:31:30,086 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:31:30,086 INFO L276 IsEmpty]: Start isEmpty. Operand 3134 states and 15587 transitions. [2020-02-10 20:31:30,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:31:30,091 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:30,091 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:31:30,091 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:31:30,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:30,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1827286828, now seen corresponding path program 234 times [2020-02-10 20:31:30,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:30,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841226039] [2020-02-10 20:31:30,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:30,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:30,638 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-02-10 20:31:30,768 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:31:30,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:31:30,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841226039] [2020-02-10 20:31:30,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:30,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:31:30,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502085940] [2020-02-10 20:31:30,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:31:30,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:30,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:31:30,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:31:30,778 INFO L87 Difference]: Start difference. First operand 3134 states and 15587 transitions. Second operand 12 states. [2020-02-10 20:31:30,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:30,989 INFO L93 Difference]: Finished difference Result 6054 states and 26883 transitions. [2020-02-10 20:31:30,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:31:30,989 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:31:30,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:31,003 INFO L225 Difference]: With dead ends: 6054 [2020-02-10 20:31:31,003 INFO L226 Difference]: Without dead ends: 6018 [2020-02-10 20:31:31,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:31:31,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6018 states. [2020-02-10 20:31:31,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6018 to 3120. [2020-02-10 20:31:31,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3120 states. [2020-02-10 20:31:31,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 15555 transitions. [2020-02-10 20:31:31,193 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 15555 transitions. Word has length 31 [2020-02-10 20:31:31,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:31,193 INFO L479 AbstractCegarLoop]: Abstraction has 3120 states and 15555 transitions. [2020-02-10 20:31:31,193 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:31:31,193 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 15555 transitions. [2020-02-10 20:31:31,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:31:31,198 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:31,198 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:31:31,199 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:31:31,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:31,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1706062512, now seen corresponding path program 235 times [2020-02-10 20:31:31,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:31,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578010969] [2020-02-10 20:31:31,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:31,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:31,782 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:31:31,915 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:31:31,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:31:31,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578010969] [2020-02-10 20:31:31,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:31,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:31:31,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283506875] [2020-02-10 20:31:31,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:31:31,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:31,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:31:31,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:31:31,925 INFO L87 Difference]: Start difference. First operand 3120 states and 15555 transitions. Second operand 12 states. [2020-02-10 20:31:32,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:32,156 INFO L93 Difference]: Finished difference Result 6063 states and 26924 transitions. [2020-02-10 20:31:32,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:31:32,156 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:31:32,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:32,170 INFO L225 Difference]: With dead ends: 6063 [2020-02-10 20:31:32,171 INFO L226 Difference]: Without dead ends: 6043 [2020-02-10 20:31:32,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:31:32,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6043 states. [2020-02-10 20:31:32,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6043 to 3136. [2020-02-10 20:31:32,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3136 states. [2020-02-10 20:31:32,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3136 states to 3136 states and 15600 transitions. [2020-02-10 20:31:32,359 INFO L78 Accepts]: Start accepts. Automaton has 3136 states and 15600 transitions. Word has length 31 [2020-02-10 20:31:32,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:32,359 INFO L479 AbstractCegarLoop]: Abstraction has 3136 states and 15600 transitions. [2020-02-10 20:31:32,359 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:31:32,359 INFO L276 IsEmpty]: Start isEmpty. Operand 3136 states and 15600 transitions. [2020-02-10 20:31:32,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:31:32,364 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:32,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:31:32,365 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:31:32,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:32,365 INFO L82 PathProgramCache]: Analyzing trace with hash 16119608, now seen corresponding path program 236 times [2020-02-10 20:31:32,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:32,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323746256] [2020-02-10 20:31:32,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:32,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:32,903 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:31:33,035 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:31:33,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:31:33,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323746256] [2020-02-10 20:31:33,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:33,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:31:33,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430822167] [2020-02-10 20:31:33,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:31:33,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:33,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:31:33,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:31:33,045 INFO L87 Difference]: Start difference. First operand 3136 states and 15600 transitions. Second operand 12 states. [2020-02-10 20:31:33,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:33,282 INFO L93 Difference]: Finished difference Result 6061 states and 26913 transitions. [2020-02-10 20:31:33,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:31:33,283 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:31:33,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:33,297 INFO L225 Difference]: With dead ends: 6061 [2020-02-10 20:31:33,297 INFO L226 Difference]: Without dead ends: 6036 [2020-02-10 20:31:33,297 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:31:33,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6036 states. [2020-02-10 20:31:33,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6036 to 3129. [2020-02-10 20:31:33,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 20:31:33,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15580 transitions. [2020-02-10 20:31:33,480 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15580 transitions. Word has length 31 [2020-02-10 20:31:33,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:33,480 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15580 transitions. [2020-02-10 20:31:33,481 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:31:33,481 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15580 transitions. [2020-02-10 20:31:33,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:31:33,486 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:33,486 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:31:33,486 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:31:33,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:33,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1069595658, now seen corresponding path program 237 times [2020-02-10 20:31:33,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:33,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856715284] [2020-02-10 20:31:33,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:33,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:34,171 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:31:34,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:31:34,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856715284] [2020-02-10 20:31:34,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:34,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:31:34,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889913271] [2020-02-10 20:31:34,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:31:34,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:34,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:31:34,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:31:34,181 INFO L87 Difference]: Start difference. First operand 3129 states and 15580 transitions. Second operand 12 states. [2020-02-10 20:31:34,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:34,472 INFO L93 Difference]: Finished difference Result 6071 states and 26933 transitions. [2020-02-10 20:31:34,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:31:34,472 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:31:34,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:34,486 INFO L225 Difference]: With dead ends: 6071 [2020-02-10 20:31:34,487 INFO L226 Difference]: Without dead ends: 6051 [2020-02-10 20:31:34,487 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:31:34,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6051 states. [2020-02-10 20:31:34,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6051 to 3140. [2020-02-10 20:31:34,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3140 states. [2020-02-10 20:31:34,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3140 states to 3140 states and 15600 transitions. [2020-02-10 20:31:34,675 INFO L78 Accepts]: Start accepts. Automaton has 3140 states and 15600 transitions. Word has length 31 [2020-02-10 20:31:34,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:34,675 INFO L479 AbstractCegarLoop]: Abstraction has 3140 states and 15600 transitions. [2020-02-10 20:31:34,675 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:31:34,675 INFO L276 IsEmpty]: Start isEmpty. Operand 3140 states and 15600 transitions. [2020-02-10 20:31:34,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:31:34,680 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:34,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:31:34,681 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:31:34,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:34,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1887804424, now seen corresponding path program 238 times [2020-02-10 20:31:34,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:34,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875699371] [2020-02-10 20:31:34,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:34,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:35,248 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:31:35,375 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:31:35,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:31:35,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875699371] [2020-02-10 20:31:35,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:35,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:31:35,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490435041] [2020-02-10 20:31:35,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:31:35,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:35,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:31:35,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:31:35,385 INFO L87 Difference]: Start difference. First operand 3140 states and 15600 transitions. Second operand 12 states. [2020-02-10 20:31:35,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:35,581 INFO L93 Difference]: Finished difference Result 6073 states and 26927 transitions. [2020-02-10 20:31:35,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:31:35,581 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:31:35,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:35,595 INFO L225 Difference]: With dead ends: 6073 [2020-02-10 20:31:35,596 INFO L226 Difference]: Without dead ends: 6040 [2020-02-10 20:31:35,596 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:31:35,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6040 states. [2020-02-10 20:31:35,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6040 to 3129. [2020-02-10 20:31:35,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 20:31:35,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15571 transitions. [2020-02-10 20:31:35,784 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15571 transitions. Word has length 31 [2020-02-10 20:31:35,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:35,784 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15571 transitions. [2020-02-10 20:31:35,785 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:31:35,785 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15571 transitions. [2020-02-10 20:31:35,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:31:35,790 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:35,790 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:31:35,790 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:31:35,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:35,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1468969718, now seen corresponding path program 239 times [2020-02-10 20:31:35,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:35,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952551323] [2020-02-10 20:31:35,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:35,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:36,344 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 20:31:36,475 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:31:36,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:31:36,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952551323] [2020-02-10 20:31:36,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:36,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:31:36,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649840132] [2020-02-10 20:31:36,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:31:36,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:36,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:31:36,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:31:36,485 INFO L87 Difference]: Start difference. First operand 3129 states and 15571 transitions. Second operand 12 states. [2020-02-10 20:31:36,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:36,709 INFO L93 Difference]: Finished difference Result 6064 states and 26909 transitions. [2020-02-10 20:31:36,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:31:36,709 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:31:36,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:36,724 INFO L225 Difference]: With dead ends: 6064 [2020-02-10 20:31:36,724 INFO L226 Difference]: Without dead ends: 6046 [2020-02-10 20:31:36,724 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:31:36,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6046 states. [2020-02-10 20:31:36,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6046 to 3137. [2020-02-10 20:31:36,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3137 states. [2020-02-10 20:31:36,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3137 states to 3137 states and 15586 transitions. [2020-02-10 20:31:36,912 INFO L78 Accepts]: Start accepts. Automaton has 3137 states and 15586 transitions. Word has length 31 [2020-02-10 20:31:36,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:36,913 INFO L479 AbstractCegarLoop]: Abstraction has 3137 states and 15586 transitions. [2020-02-10 20:31:36,913 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:31:36,913 INFO L276 IsEmpty]: Start isEmpty. Operand 3137 states and 15586 transitions. [2020-02-10 20:31:36,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:31:36,918 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:36,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:31:36,918 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:31:36,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:36,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1558540400, now seen corresponding path program 240 times [2020-02-10 20:31:36,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:36,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741886672] [2020-02-10 20:31:36,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:36,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:37,471 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 33 [2020-02-10 20:31:37,604 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:31:37,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:31:37,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741886672] [2020-02-10 20:31:37,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:37,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:31:37,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526203172] [2020-02-10 20:31:37,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:31:37,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:37,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:31:37,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:31:37,613 INFO L87 Difference]: Start difference. First operand 3137 states and 15586 transitions. Second operand 12 states. [2020-02-10 20:31:37,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:37,803 INFO L93 Difference]: Finished difference Result 6068 states and 26909 transitions. [2020-02-10 20:31:37,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:31:37,804 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:31:37,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:37,818 INFO L225 Difference]: With dead ends: 6068 [2020-02-10 20:31:37,818 INFO L226 Difference]: Without dead ends: 6013 [2020-02-10 20:31:37,818 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:31:37,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6013 states. [2020-02-10 20:31:37,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6013 to 3104. [2020-02-10 20:31:37,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3104 states. [2020-02-10 20:31:38,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3104 states to 3104 states and 15518 transitions. [2020-02-10 20:31:38,002 INFO L78 Accepts]: Start accepts. Automaton has 3104 states and 15518 transitions. Word has length 31 [2020-02-10 20:31:38,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:38,002 INFO L479 AbstractCegarLoop]: Abstraction has 3104 states and 15518 transitions. [2020-02-10 20:31:38,002 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:31:38,002 INFO L276 IsEmpty]: Start isEmpty. Operand 3104 states and 15518 transitions. [2020-02-10 20:31:38,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:31:38,007 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:38,007 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:31:38,007 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:31:38,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:38,008 INFO L82 PathProgramCache]: Analyzing trace with hash 316275074, now seen corresponding path program 241 times [2020-02-10 20:31:38,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:38,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314193611] [2020-02-10 20:31:38,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:38,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:38,590 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 34 [2020-02-10 20:31:38,721 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:31:38,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:31:38,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314193611] [2020-02-10 20:31:38,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:38,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:31:38,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338758470] [2020-02-10 20:31:38,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:31:38,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:38,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:31:38,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:31:38,732 INFO L87 Difference]: Start difference. First operand 3104 states and 15518 transitions. Second operand 12 states. [2020-02-10 20:31:38,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:38,963 INFO L93 Difference]: Finished difference Result 5976 states and 26732 transitions. [2020-02-10 20:31:38,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:31:38,963 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:31:38,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:38,978 INFO L225 Difference]: With dead ends: 5976 [2020-02-10 20:31:38,978 INFO L226 Difference]: Without dead ends: 5957 [2020-02-10 20:31:38,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:31:39,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5957 states. [2020-02-10 20:31:39,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5957 to 3124. [2020-02-10 20:31:39,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:31:39,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15599 transitions. [2020-02-10 20:31:39,167 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15599 transitions. Word has length 31 [2020-02-10 20:31:39,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:39,167 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15599 transitions. [2020-02-10 20:31:39,167 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:31:39,167 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15599 transitions. [2020-02-10 20:31:39,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:31:39,172 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:39,172 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:31:39,173 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:31:39,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:39,173 INFO L82 PathProgramCache]: Analyzing trace with hash -106210652, now seen corresponding path program 242 times [2020-02-10 20:31:39,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:39,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678834696] [2020-02-10 20:31:39,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:39,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:39,713 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:31:39,845 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:31:39,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:31:39,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678834696] [2020-02-10 20:31:39,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:39,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:31:39,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569863340] [2020-02-10 20:31:39,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:31:39,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:39,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:31:39,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:31:39,855 INFO L87 Difference]: Start difference. First operand 3124 states and 15599 transitions. Second operand 12 states. [2020-02-10 20:31:40,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:40,095 INFO L93 Difference]: Finished difference Result 5973 states and 26721 transitions. [2020-02-10 20:31:40,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:31:40,095 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:31:40,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:40,109 INFO L225 Difference]: With dead ends: 5973 [2020-02-10 20:31:40,109 INFO L226 Difference]: Without dead ends: 5952 [2020-02-10 20:31:40,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:31:40,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5952 states. [2020-02-10 20:31:40,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5952 to 3119. [2020-02-10 20:31:40,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 20:31:40,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15585 transitions. [2020-02-10 20:31:40,292 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15585 transitions. Word has length 31 [2020-02-10 20:31:40,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:40,292 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15585 transitions. [2020-02-10 20:31:40,292 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:31:40,292 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15585 transitions. [2020-02-10 20:31:40,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:31:40,297 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:40,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:31:40,297 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:31:40,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:40,297 INFO L82 PathProgramCache]: Analyzing trace with hash -108036162, now seen corresponding path program 243 times [2020-02-10 20:31:40,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:40,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793250187] [2020-02-10 20:31:40,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:40,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:40,851 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:31:40,981 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:31:40,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:31:40,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793250187] [2020-02-10 20:31:40,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:40,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:31:40,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332911414] [2020-02-10 20:31:40,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:31:40,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:40,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:31:40,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:31:40,991 INFO L87 Difference]: Start difference. First operand 3119 states and 15585 transitions. Second operand 12 states. [2020-02-10 20:31:41,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:41,222 INFO L93 Difference]: Finished difference Result 5983 states and 26744 transitions. [2020-02-10 20:31:41,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:31:41,223 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:31:41,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:41,237 INFO L225 Difference]: With dead ends: 5983 [2020-02-10 20:31:41,238 INFO L226 Difference]: Without dead ends: 5964 [2020-02-10 20:31:41,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:31:41,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5964 states. [2020-02-10 20:31:41,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5964 to 3127. [2020-02-10 20:31:41,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:31:41,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15600 transitions. [2020-02-10 20:31:41,421 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15600 transitions. Word has length 31 [2020-02-10 20:31:41,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:41,421 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15600 transitions. [2020-02-10 20:31:41,421 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:31:41,421 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15600 transitions. [2020-02-10 20:31:41,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:31:41,426 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:41,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:31:41,426 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:31:41,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:41,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1375493340, now seen corresponding path program 244 times [2020-02-10 20:31:41,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:41,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491527151] [2020-02-10 20:31:41,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:41,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:41,985 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:31:42,113 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:31:42,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:31:42,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491527151] [2020-02-10 20:31:42,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:42,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:31:42,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146768361] [2020-02-10 20:31:42,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:31:42,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:42,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:31:42,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:31:42,123 INFO L87 Difference]: Start difference. First operand 3127 states and 15600 transitions. Second operand 12 states. [2020-02-10 20:31:42,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:42,383 INFO L93 Difference]: Finished difference Result 5984 states and 26738 transitions. [2020-02-10 20:31:42,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:31:42,384 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:31:42,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:42,399 INFO L225 Difference]: With dead ends: 5984 [2020-02-10 20:31:42,399 INFO L226 Difference]: Without dead ends: 5956 [2020-02-10 20:31:42,399 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:31:42,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5956 states. [2020-02-10 20:31:42,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5956 to 3119. [2020-02-10 20:31:42,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 20:31:42,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15580 transitions. [2020-02-10 20:31:42,583 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15580 transitions. Word has length 31 [2020-02-10 20:31:42,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:42,583 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15580 transitions. [2020-02-10 20:31:42,583 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:31:42,583 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15580 transitions. [2020-02-10 20:31:42,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:31:42,588 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:42,588 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:31:42,588 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:31:42,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:42,589 INFO L82 PathProgramCache]: Analyzing trace with hash -742677506, now seen corresponding path program 245 times [2020-02-10 20:31:42,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:42,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005833803] [2020-02-10 20:31:42,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:42,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:43,119 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:31:43,250 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:31:43,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:31:43,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005833803] [2020-02-10 20:31:43,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:43,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:31:43,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965817450] [2020-02-10 20:31:43,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:31:43,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:43,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:31:43,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:31:43,259 INFO L87 Difference]: Start difference. First operand 3119 states and 15580 transitions. Second operand 12 states. [2020-02-10 20:31:43,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:43,548 INFO L93 Difference]: Finished difference Result 5974 states and 26718 transitions. [2020-02-10 20:31:43,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:31:43,549 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:31:43,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:43,563 INFO L225 Difference]: With dead ends: 5974 [2020-02-10 20:31:43,563 INFO L226 Difference]: Without dead ends: 5958 [2020-02-10 20:31:43,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:31:43,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5958 states. [2020-02-10 20:31:43,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5958 to 3124. [2020-02-10 20:31:43,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:31:43,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15589 transitions. [2020-02-10 20:31:43,750 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15589 transitions. Word has length 31 [2020-02-10 20:31:43,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:43,750 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15589 transitions. [2020-02-10 20:31:43,750 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:31:43,750 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15589 transitions. [2020-02-10 20:31:43,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:31:43,755 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:43,755 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:31:43,755 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:31:43,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:43,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1587648958, now seen corresponding path program 246 times [2020-02-10 20:31:43,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:43,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225924315] [2020-02-10 20:31:43,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:43,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:44,284 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:31:44,415 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:31:44,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:31:44,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225924315] [2020-02-10 20:31:44,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:44,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:31:44,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025349293] [2020-02-10 20:31:44,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:31:44,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:44,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:31:44,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:31:44,424 INFO L87 Difference]: Start difference. First operand 3124 states and 15589 transitions. Second operand 12 states. [2020-02-10 20:31:44,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:44,666 INFO L93 Difference]: Finished difference Result 5978 states and 26721 transitions. [2020-02-10 20:31:44,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:31:44,666 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:31:44,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:44,681 INFO L225 Difference]: With dead ends: 5978 [2020-02-10 20:31:44,681 INFO L226 Difference]: Without dead ends: 5948 [2020-02-10 20:31:44,681 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:31:44,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5948 states. [2020-02-10 20:31:44,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5948 to 3114. [2020-02-10 20:31:44,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3114 states. [2020-02-10 20:31:44,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 15566 transitions. [2020-02-10 20:31:44,864 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 15566 transitions. Word has length 31 [2020-02-10 20:31:44,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:44,865 INFO L479 AbstractCegarLoop]: Abstraction has 3114 states and 15566 transitions. [2020-02-10 20:31:44,865 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:31:44,865 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 15566 transitions. [2020-02-10 20:31:44,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:31:44,871 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:44,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:31:44,871 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:31:44,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:44,872 INFO L82 PathProgramCache]: Analyzing trace with hash 47528646, now seen corresponding path program 247 times [2020-02-10 20:31:44,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:44,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603911677] [2020-02-10 20:31:44,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:44,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:45,419 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:31:45,550 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:31:45,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:31:45,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603911677] [2020-02-10 20:31:45,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:45,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:31:45,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648369409] [2020-02-10 20:31:45,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:31:45,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:45,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:31:45,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:31:45,562 INFO L87 Difference]: Start difference. First operand 3114 states and 15566 transitions. Second operand 12 states. [2020-02-10 20:31:45,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:45,839 INFO L93 Difference]: Finished difference Result 5971 states and 26715 transitions. [2020-02-10 20:31:45,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:31:45,841 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:31:45,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:45,856 INFO L225 Difference]: With dead ends: 5971 [2020-02-10 20:31:45,856 INFO L226 Difference]: Without dead ends: 5952 [2020-02-10 20:31:45,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:31:45,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5952 states. [2020-02-10 20:31:46,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5952 to 3124. [2020-02-10 20:31:46,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:31:46,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15594 transitions. [2020-02-10 20:31:46,044 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15594 transitions. Word has length 31 [2020-02-10 20:31:46,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:46,045 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15594 transitions. [2020-02-10 20:31:46,045 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:31:46,045 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15594 transitions. [2020-02-10 20:31:46,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:31:46,050 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:46,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 20:31:46,050 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:31:46,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:46,051 INFO L82 PathProgramCache]: Analyzing trace with hash -374957080, now seen corresponding path program 248 times [2020-02-10 20:31:46,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:46,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302152206] [2020-02-10 20:31:46,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:46,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:46,576 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2020-02-10 20:31:46,707 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:31:46,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:31:46,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302152206] [2020-02-10 20:31:46,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:46,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:31:46,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486000524] [2020-02-10 20:31:46,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:31:46,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:46,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:31:46,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:31:46,717 INFO L87 Difference]: Start difference. First operand 3124 states and 15594 transitions. Second operand 12 states. [2020-02-10 20:31:47,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:47,042 INFO L93 Difference]: Finished difference Result 5968 states and 26704 transitions. [2020-02-10 20:31:47,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:31:47,043 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:31:47,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:47,058 INFO L225 Difference]: With dead ends: 5968 [2020-02-10 20:31:47,058 INFO L226 Difference]: Without dead ends: 5947 [2020-02-10 20:31:47,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:31:47,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5947 states. [2020-02-10 20:31:47,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5947 to 3119. [2020-02-10 20:31:47,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 20:31:47,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15580 transitions. [2020-02-10 20:31:47,242 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15580 transitions. Word has length 31 [2020-02-10 20:31:47,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:47,242 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15580 transitions. [2020-02-10 20:31:47,242 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:31:47,243 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15580 transitions. [2020-02-10 20:31:47,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:31:47,248 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:47,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:31:47,248 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:31:47,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:47,248 INFO L82 PathProgramCache]: Analyzing trace with hash -801093826, now seen corresponding path program 249 times [2020-02-10 20:31:47,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:47,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135563481] [2020-02-10 20:31:47,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:47,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:47,776 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:31:47,906 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:31:47,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 20:31:47,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135563481] [2020-02-10 20:31:47,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:47,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:31:47,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423722276] [2020-02-10 20:31:47,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:31:47,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:47,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:31:47,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:31:47,916 INFO L87 Difference]: Start difference. First operand 3119 states and 15580 transitions. Second operand 12 states. [2020-02-10 20:31:48,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:48,162 INFO L93 Difference]: Finished difference Result 5973 states and 26715 transitions. [2020-02-10 20:31:48,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:31:48,162 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:31:48,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:48,177 INFO L225 Difference]: With dead ends: 5973 [2020-02-10 20:31:48,177 INFO L226 Difference]: Without dead ends: 5954 [2020-02-10 20:31:48,177 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:31:48,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5954 states. [2020-02-10 20:31:48,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5954 to 3125. [2020-02-10 20:31:48,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 20:31:48,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15591 transitions. [2020-02-10 20:31:48,367 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15591 transitions. Word has length 31 [2020-02-10 20:31:48,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:48,367 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15591 transitions. [2020-02-10 20:31:48,367 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:31:48,367 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15591 transitions. [2020-02-10 20:31:48,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:31:48,372 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:48,372 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:31:48,372 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:31:48,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:48,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1381444840, now seen corresponding path program 250 times [2020-02-10 20:31:48,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:48,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840048221] [2020-02-10 20:31:48,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:48,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:48,901 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:31:49,030 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:31:49,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:31:49,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840048221] [2020-02-10 20:31:49,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:49,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:31:49,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570140141] [2020-02-10 20:31:49,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:31:49,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:49,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:31:49,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:31:49,040 INFO L87 Difference]: Start difference. First operand 3125 states and 15591 transitions. Second operand 12 states. [2020-02-10 20:31:49,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:49,266 INFO L93 Difference]: Finished difference Result 5971 states and 26705 transitions. [2020-02-10 20:31:49,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:31:49,267 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:31:49,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:49,281 INFO L225 Difference]: With dead ends: 5971 [2020-02-10 20:31:49,281 INFO L226 Difference]: Without dead ends: 5948 [2020-02-10 20:31:49,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:31:49,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5948 states. [2020-02-10 20:31:49,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5948 to 3119. [2020-02-10 20:31:49,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 20:31:49,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15575 transitions. [2020-02-10 20:31:49,468 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15575 transitions. Word has length 31 [2020-02-10 20:31:49,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:49,468 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15575 transitions. [2020-02-10 20:31:49,468 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:31:49,468 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15575 transitions. [2020-02-10 20:31:49,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:31:49,473 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:49,473 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:31:49,473 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:31:49,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:49,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1435735170, now seen corresponding path program 251 times [2020-02-10 20:31:49,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:49,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313559581] [2020-02-10 20:31:49,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:49,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:50,006 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2020-02-10 20:31:50,144 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:31:50,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:31:50,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313559581] [2020-02-10 20:31:50,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:50,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:31:50,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007684175] [2020-02-10 20:31:50,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:31:50,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:50,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:31:50,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:31:50,154 INFO L87 Difference]: Start difference. First operand 3119 states and 15575 transitions. Second operand 12 states. [2020-02-10 20:31:50,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:50,385 INFO L93 Difference]: Finished difference Result 5966 states and 26695 transitions. [2020-02-10 20:31:50,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:31:50,386 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:31:50,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:50,399 INFO L225 Difference]: With dead ends: 5966 [2020-02-10 20:31:50,399 INFO L226 Difference]: Without dead ends: 5950 [2020-02-10 20:31:50,399 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:31:50,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5950 states. [2020-02-10 20:31:50,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5950 to 3124. [2020-02-10 20:31:50,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:31:50,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15584 transitions. [2020-02-10 20:31:50,588 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15584 transitions. Word has length 31 [2020-02-10 20:31:50,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:50,588 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15584 transitions. [2020-02-10 20:31:50,588 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:31:50,588 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15584 transitions. [2020-02-10 20:31:50,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:31:50,594 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:50,594 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:31:50,594 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:31:50,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:50,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1169289222, now seen corresponding path program 252 times [2020-02-10 20:31:50,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:50,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468047422] [2020-02-10 20:31:50,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:50,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:51,138 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:31:51,270 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:31:51,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:31:51,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468047422] [2020-02-10 20:31:51,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:51,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:31:51,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248447609] [2020-02-10 20:31:51,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:31:51,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:51,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:31:51,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:31:51,281 INFO L87 Difference]: Start difference. First operand 3124 states and 15584 transitions. Second operand 12 states. [2020-02-10 20:31:51,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:51,514 INFO L93 Difference]: Finished difference Result 5967 states and 26692 transitions. [2020-02-10 20:31:51,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:31:51,515 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:31:51,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:51,529 INFO L225 Difference]: With dead ends: 5967 [2020-02-10 20:31:51,529 INFO L226 Difference]: Without dead ends: 5940 [2020-02-10 20:31:51,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:31:51,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5940 states. [2020-02-10 20:31:51,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5940 to 3114. [2020-02-10 20:31:51,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3114 states. [2020-02-10 20:31:51,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 15561 transitions. [2020-02-10 20:31:51,713 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 15561 transitions. Word has length 31 [2020-02-10 20:31:51,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:51,713 INFO L479 AbstractCegarLoop]: Abstraction has 3114 states and 15561 transitions. [2020-02-10 20:31:51,713 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:31:51,713 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 15561 transitions. [2020-02-10 20:31:51,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:31:51,718 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:51,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:31:51,718 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:31:51,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:51,719 INFO L82 PathProgramCache]: Analyzing trace with hash -645529018, now seen corresponding path program 253 times [2020-02-10 20:31:51,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:51,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552907267] [2020-02-10 20:31:51,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:51,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:52,277 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:31:52,409 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:31:52,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:31:52,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552907267] [2020-02-10 20:31:52,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:52,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:31:52,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909610582] [2020-02-10 20:31:52,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:31:52,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:52,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:31:52,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:31:52,420 INFO L87 Difference]: Start difference. First operand 3114 states and 15561 transitions. Second operand 12 states. [2020-02-10 20:31:52,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:52,659 INFO L93 Difference]: Finished difference Result 5987 states and 26751 transitions. [2020-02-10 20:31:52,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:31:52,660 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:31:52,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:52,674 INFO L225 Difference]: With dead ends: 5987 [2020-02-10 20:31:52,674 INFO L226 Difference]: Without dead ends: 5968 [2020-02-10 20:31:52,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:31:52,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5968 states. [2020-02-10 20:31:52,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5968 to 3128. [2020-02-10 20:31:52,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 20:31:52,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15599 transitions. [2020-02-10 20:31:52,903 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15599 transitions. Word has length 31 [2020-02-10 20:31:52,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:52,903 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15599 transitions. [2020-02-10 20:31:52,903 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:31:52,904 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15599 transitions. [2020-02-10 20:31:52,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:31:52,909 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:52,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:31:52,909 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:31:52,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:52,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1912986196, now seen corresponding path program 254 times [2020-02-10 20:31:52,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:52,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991677756] [2020-02-10 20:31:52,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:52,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:53,455 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:31:53,587 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:31:53,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:31:53,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991677756] [2020-02-10 20:31:53,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:53,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:31:53,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081216987] [2020-02-10 20:31:53,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:31:53,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:53,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:31:53,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:31:53,597 INFO L87 Difference]: Start difference. First operand 3128 states and 15599 transitions. Second operand 12 states. [2020-02-10 20:31:53,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:53,828 INFO L93 Difference]: Finished difference Result 5988 states and 26745 transitions. [2020-02-10 20:31:53,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:31:53,829 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:31:53,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:53,843 INFO L225 Difference]: With dead ends: 5988 [2020-02-10 20:31:53,843 INFO L226 Difference]: Without dead ends: 5960 [2020-02-10 20:31:53,844 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:31:53,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5960 states. [2020-02-10 20:31:54,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5960 to 3120. [2020-02-10 20:31:54,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3120 states. [2020-02-10 20:31:54,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 15578 transitions. [2020-02-10 20:31:54,030 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 15578 transitions. Word has length 31 [2020-02-10 20:31:54,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:54,030 INFO L479 AbstractCegarLoop]: Abstraction has 3120 states and 15578 transitions. [2020-02-10 20:31:54,030 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:31:54,030 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 15578 transitions. [2020-02-10 20:31:54,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:31:54,035 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:54,035 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:31:54,035 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:31:54,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:54,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1069840254, now seen corresponding path program 255 times [2020-02-10 20:31:54,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:54,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359585188] [2020-02-10 20:31:54,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:54,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:54,572 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:31:54,703 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:31:54,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:31:54,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359585188] [2020-02-10 20:31:54,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:54,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:31:54,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42747072] [2020-02-10 20:31:54,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:31:54,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:54,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:31:54,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:31:54,713 INFO L87 Difference]: Start difference. First operand 3120 states and 15578 transitions. Second operand 12 states. [2020-02-10 20:31:54,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:54,971 INFO L93 Difference]: Finished difference Result 5982 states and 26733 transitions. [2020-02-10 20:31:54,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:31:54,972 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:31:54,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:54,986 INFO L225 Difference]: With dead ends: 5982 [2020-02-10 20:31:54,987 INFO L226 Difference]: Without dead ends: 5963 [2020-02-10 20:31:54,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:31:55,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5963 states. [2020-02-10 20:31:55,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5963 to 3126. [2020-02-10 20:31:55,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 20:31:55,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15589 transitions. [2020-02-10 20:31:55,169 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15589 transitions. Word has length 31 [2020-02-10 20:31:55,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:55,169 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15589 transitions. [2020-02-10 20:31:55,169 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:31:55,169 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15589 transitions. [2020-02-10 20:31:55,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:31:55,174 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:55,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:31:55,174 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:31:55,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:55,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1112698412, now seen corresponding path program 256 times [2020-02-10 20:31:55,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:55,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787847636] [2020-02-10 20:31:55,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:55,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:55,704 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:31:55,835 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:31:55,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:31:55,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787847636] [2020-02-10 20:31:55,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:55,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:31:55,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965745267] [2020-02-10 20:31:55,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:31:55,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:55,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:31:55,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:31:55,845 INFO L87 Difference]: Start difference. First operand 3126 states and 15589 transitions. Second operand 12 states. [2020-02-10 20:31:56,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:56,089 INFO L93 Difference]: Finished difference Result 5980 states and 26723 transitions. [2020-02-10 20:31:56,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:31:56,089 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:31:56,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:56,103 INFO L225 Difference]: With dead ends: 5980 [2020-02-10 20:31:56,104 INFO L226 Difference]: Without dead ends: 5957 [2020-02-10 20:31:56,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:31:56,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5957 states. [2020-02-10 20:31:56,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5957 to 3120. [2020-02-10 20:31:56,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3120 states. [2020-02-10 20:31:56,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 15572 transitions. [2020-02-10 20:31:56,291 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 15572 transitions. Word has length 31 [2020-02-10 20:31:56,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:56,291 INFO L479 AbstractCegarLoop]: Abstraction has 3120 states and 15572 transitions. [2020-02-10 20:31:56,291 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:31:56,291 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 15572 transitions. [2020-02-10 20:31:56,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:31:56,296 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:56,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 20:31:56,296 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:31:56,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:56,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1321203010, now seen corresponding path program 257 times [2020-02-10 20:31:56,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:56,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589481790] [2020-02-10 20:31:56,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:56,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:56,841 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:31:56,975 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:31:56,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:31:56,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589481790] [2020-02-10 20:31:56,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:56,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:31:56,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445825283] [2020-02-10 20:31:56,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:31:56,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:56,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:31:56,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:31:56,985 INFO L87 Difference]: Start difference. First operand 3120 states and 15572 transitions. Second operand 12 states. [2020-02-10 20:31:57,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:57,259 INFO L93 Difference]: Finished difference Result 5984 states and 26731 transitions. [2020-02-10 20:31:57,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:31:57,260 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:31:57,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:57,274 INFO L225 Difference]: With dead ends: 5984 [2020-02-10 20:31:57,274 INFO L226 Difference]: Without dead ends: 5964 [2020-02-10 20:31:57,274 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:31:57,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5964 states. [2020-02-10 20:31:57,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5964 to 3126. [2020-02-10 20:31:57,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 20:31:57,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15583 transitions. [2020-02-10 20:31:57,461 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15583 transitions. Word has length 31 [2020-02-10 20:31:57,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:57,461 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15583 transitions. [2020-02-10 20:31:57,461 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:31:57,461 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15583 transitions. [2020-02-10 20:31:57,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:31:57,466 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:57,466 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:31:57,467 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:31:57,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:57,467 INFO L82 PathProgramCache]: Analyzing trace with hash 476231558, now seen corresponding path program 258 times [2020-02-10 20:31:57,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:57,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059209943] [2020-02-10 20:31:57,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:57,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:58,012 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:31:58,146 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:31:58,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:31:58,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059209943] [2020-02-10 20:31:58,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:58,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:31:58,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29018987] [2020-02-10 20:31:58,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:31:58,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:58,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:31:58,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:31:58,156 INFO L87 Difference]: Start difference. First operand 3126 states and 15583 transitions. Second operand 12 states. [2020-02-10 20:31:58,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:58,418 INFO L93 Difference]: Finished difference Result 5981 states and 26719 transitions. [2020-02-10 20:31:58,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:31:58,418 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:31:58,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:58,434 INFO L225 Difference]: With dead ends: 5981 [2020-02-10 20:31:58,434 INFO L226 Difference]: Without dead ends: 5952 [2020-02-10 20:31: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:31:58,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5952 states. [2020-02-10 20:31:58,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5952 to 3114. [2020-02-10 20:31:58,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3114 states. [2020-02-10 20:31:58,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 15556 transitions. [2020-02-10 20:31:58,618 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 15556 transitions. Word has length 31 [2020-02-10 20:31:58,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:58,618 INFO L479 AbstractCegarLoop]: Abstraction has 3114 states and 15556 transitions. [2020-02-10 20:31:58,618 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:31:58,619 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 15556 transitions. [2020-02-10 20:31:58,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:31:58,624 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:58,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:31:58,624 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:31:58,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:58,624 INFO L82 PathProgramCache]: Analyzing trace with hash 732940072, now seen corresponding path program 259 times [2020-02-10 20:31:58,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:58,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928195737] [2020-02-10 20:31:58,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:58,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:31:59,154 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:31:59,282 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:31:59,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:31:59,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928195737] [2020-02-10 20:31:59,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:31:59,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:31:59,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601324293] [2020-02-10 20:31:59,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:31:59,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:31:59,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:31:59,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:31:59,292 INFO L87 Difference]: Start difference. First operand 3114 states and 15556 transitions. Second operand 12 states. [2020-02-10 20:31:59,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:31:59,527 INFO L93 Difference]: Finished difference Result 5970 states and 26703 transitions. [2020-02-10 20:31:59,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:31:59,528 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:31:59,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:31:59,542 INFO L225 Difference]: With dead ends: 5970 [2020-02-10 20:31:59,542 INFO L226 Difference]: Without dead ends: 5954 [2020-02-10 20:31:59,542 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:31:59,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5954 states. [2020-02-10 20:31:59,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5954 to 3124. [2020-02-10 20:31:59,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:31:59,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15584 transitions. [2020-02-10 20:31:59,726 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15584 transitions. Word has length 31 [2020-02-10 20:31:59,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:31:59,727 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15584 transitions. [2020-02-10 20:31:59,727 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:31:59,727 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15584 transitions. [2020-02-10 20:31:59,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:31:59,732 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:31:59,732 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:31:59,732 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:31:59,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:31:59,732 INFO L82 PathProgramCache]: Analyzing trace with hash -112031380, now seen corresponding path program 260 times [2020-02-10 20:31:59,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:31:59,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492017415] [2020-02-10 20:31:59,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:31:59,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:00,320 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:32:00,452 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:32:00,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:32:00,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492017415] [2020-02-10 20:32:00,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:00,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:32:00,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827304355] [2020-02-10 20:32:00,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:32:00,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:00,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:32:00,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:32:00,462 INFO L87 Difference]: Start difference. First operand 3124 states and 15584 transitions. Second operand 12 states. [2020-02-10 20:32:00,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:00,757 INFO L93 Difference]: Finished difference Result 5974 states and 26706 transitions. [2020-02-10 20:32:00,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:32:00,757 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:32:00,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:00,772 INFO L225 Difference]: With dead ends: 5974 [2020-02-10 20:32:00,773 INFO L226 Difference]: Without dead ends: 5949 [2020-02-10 20:32:00,773 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:32:00,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5949 states. [2020-02-10 20:32:00,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5949 to 3119. [2020-02-10 20:32:00,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 20:32:00,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15570 transitions. [2020-02-10 20:32:00,961 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15570 transitions. Word has length 31 [2020-02-10 20:32:00,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:00,961 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15570 transitions. [2020-02-10 20:32:00,961 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:32:00,961 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15570 transitions. [2020-02-10 20:32:00,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:32:00,966 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:00,966 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:32:00,966 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:32:00,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:00,967 INFO L82 PathProgramCache]: Analyzing trace with hash 308628836, now seen corresponding path program 261 times [2020-02-10 20:32:00,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:00,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62338097] [2020-02-10 20:32:00,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:00,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:01,520 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:32:01,653 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:32:01,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:32:01,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62338097] [2020-02-10 20:32:01,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:01,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:32:01,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816265134] [2020-02-10 20:32:01,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:32:01,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:01,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:32:01,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:32:01,664 INFO L87 Difference]: Start difference. First operand 3119 states and 15570 transitions. Second operand 12 states. [2020-02-10 20:32:01,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:01,970 INFO L93 Difference]: Finished difference Result 5967 states and 26692 transitions. [2020-02-10 20:32:01,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:32:01,971 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:32:01,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:01,986 INFO L225 Difference]: With dead ends: 5967 [2020-02-10 20:32:01,986 INFO L226 Difference]: Without dead ends: 5951 [2020-02-10 20:32:01,986 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:32:02,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5951 states. [2020-02-10 20:32:02,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5951 to 3124. [2020-02-10 20:32:02,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:32:02,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15579 transitions. [2020-02-10 20:32:02,176 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15579 transitions. Word has length 31 [2020-02-10 20:32:02,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:02,176 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15579 transitions. [2020-02-10 20:32:02,177 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:32:02,177 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15579 transitions. [2020-02-10 20:32:02,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:32:02,182 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:02,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:32:02,182 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:32:02,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:02,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1381314068, now seen corresponding path program 262 times [2020-02-10 20:32:02,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:02,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263825338] [2020-02-10 20:32:02,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:02,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:02,721 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:32:02,852 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:32:02,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:32:02,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263825338] [2020-02-10 20:32:02,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:02,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:32:02,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954957793] [2020-02-10 20:32:02,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:32:02,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:02,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:32:02,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:32:02,863 INFO L87 Difference]: Start difference. First operand 3124 states and 15579 transitions. Second operand 12 states. [2020-02-10 20:32:03,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:03,104 INFO L93 Difference]: Finished difference Result 5968 states and 26689 transitions. [2020-02-10 20:32:03,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:32:03,104 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:32:03,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:03,119 INFO L225 Difference]: With dead ends: 5968 [2020-02-10 20:32:03,119 INFO L226 Difference]: Without dead ends: 5946 [2020-02-10 20:32:03,119 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:32:03,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5946 states. [2020-02-10 20:32:03,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5946 to 3119. [2020-02-10 20:32:03,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 20:32:03,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15565 transitions. [2020-02-10 20:32:03,303 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15565 transitions. Word has length 31 [2020-02-10 20:32:03,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:03,303 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15565 transitions. [2020-02-10 20:32:03,303 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:32:03,303 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15565 transitions. [2020-02-10 20:32:03,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:32:03,308 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:03,308 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:32:03,308 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:32:03,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:03,309 INFO L82 PathProgramCache]: Analyzing trace with hash -960653852, now seen corresponding path program 263 times [2020-02-10 20:32:03,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:03,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089552905] [2020-02-10 20:32:03,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:03,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:03,846 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:32:03,980 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:32:03,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:32:03,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089552905] [2020-02-10 20:32:03,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:03,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:32:03,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882923896] [2020-02-10 20:32:03,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:32:03,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:03,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:32:03,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:32:03,990 INFO L87 Difference]: Start difference. First operand 3119 states and 15565 transitions. Second operand 12 states. [2020-02-10 20:32:04,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:04,270 INFO L93 Difference]: Finished difference Result 5976 states and 26706 transitions. [2020-02-10 20:32:04,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:32:04,270 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:32:04,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:04,285 INFO L225 Difference]: With dead ends: 5976 [2020-02-10 20:32:04,286 INFO L226 Difference]: Without dead ends: 5956 [2020-02-10 20:32:04,286 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:32:04,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5956 states. [2020-02-10 20:32:04,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5956 to 3125. [2020-02-10 20:32:04,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 20:32:04,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15576 transitions. [2020-02-10 20:32:04,474 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15576 transitions. Word has length 31 [2020-02-10 20:32:04,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:04,474 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15576 transitions. [2020-02-10 20:32:04,474 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:32:04,474 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15576 transitions. [2020-02-10 20:32:04,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:32:04,479 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:04,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 20:32:04,479 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:32:04,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:04,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1805625304, now seen corresponding path program 264 times [2020-02-10 20:32:04,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:04,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197943512] [2020-02-10 20:32:04,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:04,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:05,025 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:32:05,155 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:32:05,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:32:05,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197943512] [2020-02-10 20:32:05,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:05,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:32:05,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484806837] [2020-02-10 20:32:05,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:32:05,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:05,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:32:05,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:32:05,165 INFO L87 Difference]: Start difference. First operand 3125 states and 15576 transitions. Second operand 12 states. [2020-02-10 20:32:05,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:05,444 INFO L93 Difference]: Finished difference Result 5973 states and 26694 transitions. [2020-02-10 20:32:05,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:32:05,444 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:32:05,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:05,459 INFO L225 Difference]: With dead ends: 5973 [2020-02-10 20:32:05,459 INFO L226 Difference]: Without dead ends: 5940 [2020-02-10 20:32:05,459 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:32:05,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5940 states. [2020-02-10 20:32:05,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5940 to 3109. [2020-02-10 20:32:05,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3109 states. [2020-02-10 20:32:05,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3109 states to 3109 states and 15542 transitions. [2020-02-10 20:32:05,647 INFO L78 Accepts]: Start accepts. Automaton has 3109 states and 15542 transitions. Word has length 31 [2020-02-10 20:32:05,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:05,648 INFO L479 AbstractCegarLoop]: Abstraction has 3109 states and 15542 transitions. [2020-02-10 20:32:05,648 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:32:05,648 INFO L276 IsEmpty]: Start isEmpty. Operand 3109 states and 15542 transitions. [2020-02-10 20:32:05,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:32:05,653 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:05,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:32:05,653 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:32:05,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:05,653 INFO L82 PathProgramCache]: Analyzing trace with hash 575070398, now seen corresponding path program 265 times [2020-02-10 20:32:05,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:05,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563936493] [2020-02-10 20:32:05,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:05,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:06,188 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:32:06,321 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:32:06,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:32:06,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563936493] [2020-02-10 20:32:06,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:06,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:32:06,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611691645] [2020-02-10 20:32:06,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:32:06,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:06,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:32:06,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:32:06,331 INFO L87 Difference]: Start difference. First operand 3109 states and 15542 transitions. Second operand 12 states. [2020-02-10 20:32:06,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:06,633 INFO L93 Difference]: Finished difference Result 5980 states and 26739 transitions. [2020-02-10 20:32:06,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:32:06,633 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:32:06,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:06,647 INFO L225 Difference]: With dead ends: 5980 [2020-02-10 20:32:06,648 INFO L226 Difference]: Without dead ends: 5961 [2020-02-10 20:32:06,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:32:06,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5961 states. [2020-02-10 20:32:06,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5961 to 3124. [2020-02-10 20:32:06,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:32:06,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15594 transitions. [2020-02-10 20:32:06,836 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15594 transitions. Word has length 31 [2020-02-10 20:32:06,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:06,836 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15594 transitions. [2020-02-10 20:32:06,836 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:32:06,836 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15594 transitions. [2020-02-10 20:32:06,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:32:06,841 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:06,841 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:32:06,841 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:32:06,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:06,842 INFO L82 PathProgramCache]: Analyzing trace with hash 152584672, now seen corresponding path program 266 times [2020-02-10 20:32:06,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:06,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623447688] [2020-02-10 20:32:06,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:06,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:07,292 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 30 [2020-02-10 20:32:07,417 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:32:07,548 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:32:07,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 20:32:07,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623447688] [2020-02-10 20:32:07,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:07,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:32:07,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968446402] [2020-02-10 20:32:07,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:32:07,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:07,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:32:07,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:32:07,558 INFO L87 Difference]: Start difference. First operand 3124 states and 15594 transitions. Second operand 12 states. [2020-02-10 20:32:07,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:07,915 INFO L93 Difference]: Finished difference Result 5977 states and 26728 transitions. [2020-02-10 20:32:07,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:32:07,916 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:32:07,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:07,930 INFO L225 Difference]: With dead ends: 5977 [2020-02-10 20:32:07,930 INFO L226 Difference]: Without dead ends: 5956 [2020-02-10 20:32:07,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:32:08,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5956 states. [2020-02-10 20:32:08,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5956 to 3119. [2020-02-10 20:32:08,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 20:32:08,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15580 transitions. [2020-02-10 20:32:08,118 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15580 transitions. Word has length 31 [2020-02-10 20:32:08,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:08,119 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15580 transitions. [2020-02-10 20:32:08,119 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:32:08,119 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15580 transitions. [2020-02-10 20:32:08,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:32:08,124 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:08,124 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:32:08,124 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:32:08,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:08,124 INFO L82 PathProgramCache]: Analyzing trace with hash 150759162, now seen corresponding path program 267 times [2020-02-10 20:32:08,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:08,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566950712] [2020-02-10 20:32:08,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:08,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:08,655 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:32:08,790 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:32:08,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:32:08,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566950712] [2020-02-10 20:32:08,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:08,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:32:08,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730717879] [2020-02-10 20:32:08,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:32:08,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:08,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:32:08,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:32:08,801 INFO L87 Difference]: Start difference. First operand 3119 states and 15580 transitions. Second operand 12 states. [2020-02-10 20:32:09,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:09,056 INFO L93 Difference]: Finished difference Result 5987 states and 26751 transitions. [2020-02-10 20:32:09,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:32:09,056 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:32:09,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:09,071 INFO L225 Difference]: With dead ends: 5987 [2020-02-10 20:32:09,071 INFO L226 Difference]: Without dead ends: 5968 [2020-02-10 20:32:09,071 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:32:09,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5968 states. [2020-02-10 20:32:09,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5968 to 3127. [2020-02-10 20:32:09,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:32:09,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15595 transitions. [2020-02-10 20:32:09,259 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15595 transitions. Word has length 31 [2020-02-10 20:32:09,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:09,259 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15595 transitions. [2020-02-10 20:32:09,259 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:32:09,259 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15595 transitions. [2020-02-10 20:32:09,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:32:09,264 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:09,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:32:09,264 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:32:09,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:09,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1116698016, now seen corresponding path program 268 times [2020-02-10 20:32:09,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:09,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67367059] [2020-02-10 20:32:09,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:09,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:09,797 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:32:09,930 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:32:09,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:32:09,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67367059] [2020-02-10 20:32:09,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:09,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:32:09,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177582010] [2020-02-10 20:32:09,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:32:09,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:09,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:32:09,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:32:09,939 INFO L87 Difference]: Start difference. First operand 3127 states and 15595 transitions. Second operand 12 states. [2020-02-10 20:32:10,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:10,206 INFO L93 Difference]: Finished difference Result 5988 states and 26745 transitions. [2020-02-10 20:32:10,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:32:10,206 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:32:10,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:10,220 INFO L225 Difference]: With dead ends: 5988 [2020-02-10 20:32:10,220 INFO L226 Difference]: Without dead ends: 5960 [2020-02-10 20:32:10,221 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:32:10,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5960 states. [2020-02-10 20:32:10,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5960 to 3119. [2020-02-10 20:32:10,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 20:32:10,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15575 transitions. [2020-02-10 20:32:10,403 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15575 transitions. Word has length 31 [2020-02-10 20:32:10,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:10,403 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15575 transitions. [2020-02-10 20:32:10,403 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:32:10,404 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15575 transitions. [2020-02-10 20:32:10,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:32:10,409 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:10,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:32:10,409 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:32:10,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:10,409 INFO L82 PathProgramCache]: Analyzing trace with hash -483882182, now seen corresponding path program 269 times [2020-02-10 20:32:10,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:10,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032923693] [2020-02-10 20:32:10,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:10,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:10,937 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:32:11,069 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:32:11,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:32:11,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032923693] [2020-02-10 20:32:11,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:11,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:32:11,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47079401] [2020-02-10 20:32:11,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:32:11,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:11,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:32:11,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:32:11,080 INFO L87 Difference]: Start difference. First operand 3119 states and 15575 transitions. Second operand 12 states. [2020-02-10 20:32:11,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:11,341 INFO L93 Difference]: Finished difference Result 5978 states and 26725 transitions. [2020-02-10 20:32:11,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:32:11,342 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:32:11,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:11,357 INFO L225 Difference]: With dead ends: 5978 [2020-02-10 20:32:11,357 INFO L226 Difference]: Without dead ends: 5962 [2020-02-10 20:32:11,357 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:32:11,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5962 states. [2020-02-10 20:32:11,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5962 to 3124. [2020-02-10 20:32:11,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:32:11,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15584 transitions. [2020-02-10 20:32:11,546 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15584 transitions. Word has length 31 [2020-02-10 20:32:11,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:11,546 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15584 transitions. [2020-02-10 20:32:11,546 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:32:11,546 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15584 transitions. [2020-02-10 20:32:11,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:32:11,551 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:11,551 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:32:11,551 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:32:11,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:11,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1328853634, now seen corresponding path program 270 times [2020-02-10 20:32:11,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:11,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008600473] [2020-02-10 20:32:11,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:11,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:12,077 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:32:12,210 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:32:12,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:32:12,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008600473] [2020-02-10 20:32:12,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:12,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:32:12,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746595675] [2020-02-10 20:32:12,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:32:12,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:12,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:32:12,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:32:12,220 INFO L87 Difference]: Start difference. First operand 3124 states and 15584 transitions. Second operand 12 states. [2020-02-10 20:32:12,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:12,490 INFO L93 Difference]: Finished difference Result 5982 states and 26728 transitions. [2020-02-10 20:32:12,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:32:12,491 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:32:12,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:12,506 INFO L225 Difference]: With dead ends: 5982 [2020-02-10 20:32:12,506 INFO L226 Difference]: Without dead ends: 5952 [2020-02-10 20:32:12,506 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:32:12,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5952 states. [2020-02-10 20:32:12,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5952 to 3114. [2020-02-10 20:32:12,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3114 states. [2020-02-10 20:32:12,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 15561 transitions. [2020-02-10 20:32:12,693 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 15561 transitions. Word has length 31 [2020-02-10 20:32:12,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:12,693 INFO L479 AbstractCegarLoop]: Abstraction has 3114 states and 15561 transitions. [2020-02-10 20:32:12,693 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:32:12,693 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 15561 transitions. [2020-02-10 20:32:12,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:32:12,698 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:12,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:32:12,698 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:32:12,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:12,698 INFO L82 PathProgramCache]: Analyzing trace with hash 37577542, now seen corresponding path program 271 times [2020-02-10 20:32:12,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:12,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374083485] [2020-02-10 20:32:12,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:12,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:13,232 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:32:13,364 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:32:13,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:32:13,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374083485] [2020-02-10 20:32:13,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:13,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:32:13,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843822937] [2020-02-10 20:32:13,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:32:13,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:13,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:32:13,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:32:13,374 INFO L87 Difference]: Start difference. First operand 3114 states and 15561 transitions. Second operand 12 states. [2020-02-10 20:32:13,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:13,669 INFO L93 Difference]: Finished difference Result 5977 states and 26727 transitions. [2020-02-10 20:32:13,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:32:13,670 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:32:13,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:13,685 INFO L225 Difference]: With dead ends: 5977 [2020-02-10 20:32:13,685 INFO L226 Difference]: Without dead ends: 5958 [2020-02-10 20:32:13,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:32:13,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5958 states. [2020-02-10 20:32:13,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5958 to 3124. [2020-02-10 20:32:13,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:32:13,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15589 transitions. [2020-02-10 20:32:13,874 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15589 transitions. Word has length 31 [2020-02-10 20:32:13,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:13,874 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15589 transitions. [2020-02-10 20:32:13,874 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:32:13,874 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15589 transitions. [2020-02-10 20:32:13,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:32:13,879 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:13,879 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:32:13,879 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:32:13,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:13,879 INFO L82 PathProgramCache]: Analyzing trace with hash -384908184, now seen corresponding path program 272 times [2020-02-10 20:32:13,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:13,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480851742] [2020-02-10 20:32:13,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:13,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:14,406 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:32:14,537 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:32:14,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:32:14,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480851742] [2020-02-10 20:32:14,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:14,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:32:14,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534224706] [2020-02-10 20:32:14,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:32:14,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:14,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:32:14,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:32:14,548 INFO L87 Difference]: Start difference. First operand 3124 states and 15589 transitions. Second operand 12 states. [2020-02-10 20:32:14,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:14,826 INFO L93 Difference]: Finished difference Result 5974 states and 26716 transitions. [2020-02-10 20:32:14,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:32:14,826 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:32:14,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:14,840 INFO L225 Difference]: With dead ends: 5974 [2020-02-10 20:32:14,840 INFO L226 Difference]: Without dead ends: 5953 [2020-02-10 20:32:14,841 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:32:14,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5953 states. [2020-02-10 20:32:15,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5953 to 3119. [2020-02-10 20:32:15,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 20:32:15,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15575 transitions. [2020-02-10 20:32:15,028 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15575 transitions. Word has length 31 [2020-02-10 20:32:15,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:15,028 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15575 transitions. [2020-02-10 20:32:15,028 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:32:15,028 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15575 transitions. [2020-02-10 20:32:15,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:32:15,033 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:15,033 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:32:15,033 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:32:15,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:15,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1235356166, now seen corresponding path program 273 times [2020-02-10 20:32:15,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:15,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712636249] [2020-02-10 20:32:15,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:15,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:15,567 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:32:15,697 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:32:15,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:32:15,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712636249] [2020-02-10 20:32:15,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:15,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:32:15,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143120813] [2020-02-10 20:32:15,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:32:15,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:15,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:32:15,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:32:15,707 INFO L87 Difference]: Start difference. First operand 3119 states and 15575 transitions. Second operand 12 states. [2020-02-10 20:32:15,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:15,947 INFO L93 Difference]: Finished difference Result 5981 states and 26732 transitions. [2020-02-10 20:32:15,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:32:15,948 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:32:15,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:15,962 INFO L225 Difference]: With dead ends: 5981 [2020-02-10 20:32:15,962 INFO L226 Difference]: Without dead ends: 5962 [2020-02-10 20:32:15,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:32:16,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5962 states. [2020-02-10 20:32:16,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5962 to 3126. [2020-02-10 20:32:16,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 20:32:16,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15588 transitions. [2020-02-10 20:32:16,146 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15588 transitions. Word has length 31 [2020-02-10 20:32:16,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:16,146 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15588 transitions. [2020-02-10 20:32:16,146 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:32:16,146 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15588 transitions. [2020-02-10 20:32:16,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:32:16,151 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:16,151 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:32:16,151 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:32:16,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:16,152 INFO L82 PathProgramCache]: Analyzing trace with hash 102211048, now seen corresponding path program 274 times [2020-02-10 20:32:16,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:16,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956294460] [2020-02-10 20:32:16,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:16,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:16,687 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:32:16,816 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:32:16,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:32:16,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956294460] [2020-02-10 20:32:16,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:16,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:32:16,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057279071] [2020-02-10 20:32:16,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:32:16,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:16,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:32:16,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:32:16,825 INFO L87 Difference]: Start difference. First operand 3126 states and 15588 transitions. Second operand 12 states. [2020-02-10 20:32:17,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:17,049 INFO L93 Difference]: Finished difference Result 5980 states and 26723 transitions. [2020-02-10 20:32:17,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:32:17,049 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:32:17,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:17,064 INFO L225 Difference]: With dead ends: 5980 [2020-02-10 20:32:17,065 INFO L226 Difference]: Without dead ends: 5955 [2020-02-10 20:32:17,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:32:17,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5955 states. [2020-02-10 20:32:17,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5955 to 3119. [2020-02-10 20:32:17,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 20:32:17,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15570 transitions. [2020-02-10 20:32:17,246 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15570 transitions. Word has length 31 [2020-02-10 20:32:17,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:17,246 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15570 transitions. [2020-02-10 20:32:17,246 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:32:17,246 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15570 transitions. [2020-02-10 20:32:17,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:32:17,251 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:17,251 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:32:17,251 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:32:17,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:17,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1869997510, now seen corresponding path program 275 times [2020-02-10 20:32:17,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:17,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110488014] [2020-02-10 20:32:17,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:17,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:17,791 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-02-10 20:32:17,924 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:32:17,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:32:17,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110488014] [2020-02-10 20:32:17,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:17,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:32:17,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940883121] [2020-02-10 20:32:17,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:32:17,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:17,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:32:17,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:32:17,935 INFO L87 Difference]: Start difference. First operand 3119 states and 15570 transitions. Second operand 12 states. [2020-02-10 20:32:18,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:18,184 INFO L93 Difference]: Finished difference Result 5973 states and 26709 transitions. [2020-02-10 20:32:18,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:32:18,185 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:32:18,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:18,199 INFO L225 Difference]: With dead ends: 5973 [2020-02-10 20:32:18,200 INFO L226 Difference]: Without dead ends: 5957 [2020-02-10 20:32:18,200 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:32:18,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5957 states. [2020-02-10 20:32:18,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5957 to 3124. [2020-02-10 20:32:18,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:32:18,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15579 transitions. [2020-02-10 20:32:18,387 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15579 transitions. Word has length 31 [2020-02-10 20:32:18,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:18,387 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15579 transitions. [2020-02-10 20:32:18,387 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:32:18,387 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15579 transitions. [2020-02-10 20:32:18,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:32:18,392 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:18,392 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:32:18,392 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:32:18,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:18,393 INFO L82 PathProgramCache]: Analyzing trace with hash -109944570, now seen corresponding path program 276 times [2020-02-10 20:32:18,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:18,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501022844] [2020-02-10 20:32:18,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:18,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:18,928 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:32:19,060 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:32:19,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:32:19,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501022844] [2020-02-10 20:32:19,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:19,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:32:19,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495634381] [2020-02-10 20:32:19,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:32:19,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:19,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:32:19,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:32:19,070 INFO L87 Difference]: Start difference. First operand 3124 states and 15579 transitions. Second operand 12 states. [2020-02-10 20:32:19,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:19,293 INFO L93 Difference]: Finished difference Result 5975 states and 26708 transitions. [2020-02-10 20:32:19,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:32:19,294 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:32:19,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:19,308 INFO L225 Difference]: With dead ends: 5975 [2020-02-10 20:32:19,308 INFO L226 Difference]: Without dead ends: 5947 [2020-02-10 20:32:19,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:32:19,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5947 states. [2020-02-10 20:32:19,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5947 to 3114. [2020-02-10 20:32:19,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3114 states. [2020-02-10 20:32:19,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 15556 transitions. [2020-02-10 20:32:19,494 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 15556 transitions. Word has length 31 [2020-02-10 20:32:19,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:19,494 INFO L479 AbstractCegarLoop]: Abstraction has 3114 states and 15556 transitions. [2020-02-10 20:32:19,495 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:32:19,495 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 15556 transitions. [2020-02-10 20:32:19,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:32:19,500 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:19,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:32:19,500 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:32:19,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:19,500 INFO L82 PathProgramCache]: Analyzing trace with hash -655480122, now seen corresponding path program 277 times [2020-02-10 20:32:19,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:19,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799211067] [2020-02-10 20:32:19,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:19,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:20,045 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:32:20,180 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:32:20,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:32:20,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799211067] [2020-02-10 20:32:20,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:20,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:32:20,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978067970] [2020-02-10 20:32:20,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:32:20,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:20,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:32:20,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:32:20,190 INFO L87 Difference]: Start difference. First operand 3114 states and 15556 transitions. Second operand 12 states. [2020-02-10 20:32:20,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:20,426 INFO L93 Difference]: Finished difference Result 5995 states and 26770 transitions. [2020-02-10 20:32:20,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:32:20,426 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:32:20,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:20,442 INFO L225 Difference]: With dead ends: 5995 [2020-02-10 20:32:20,442 INFO L226 Difference]: Without dead ends: 5976 [2020-02-10 20:32:20,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:32:20,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5976 states. [2020-02-10 20:32:20,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5976 to 3129. [2020-02-10 20:32:20,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 20:32:20,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15598 transitions. [2020-02-10 20:32:20,632 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15598 transitions. Word has length 31 [2020-02-10 20:32:20,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:20,632 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15598 transitions. [2020-02-10 20:32:20,632 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:32:20,632 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15598 transitions. [2020-02-10 20:32:20,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:32:20,637 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:20,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:32:20,638 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:32:20,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:20,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1922937300, now seen corresponding path program 278 times [2020-02-10 20:32:20,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:20,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035676803] [2020-02-10 20:32:20,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:20,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:21,189 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:32:21,323 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:32:21,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:32:21,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035676803] [2020-02-10 20:32:21,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:21,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:32:21,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634088983] [2020-02-10 20:32:21,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:32:21,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:21,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:32:21,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:32:21,333 INFO L87 Difference]: Start difference. First operand 3129 states and 15598 transitions. Second operand 12 states. [2020-02-10 20:32:21,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:21,634 INFO L93 Difference]: Finished difference Result 5996 states and 26764 transitions. [2020-02-10 20:32:21,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:32:21,634 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:32:21,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:21,649 INFO L225 Difference]: With dead ends: 5996 [2020-02-10 20:32:21,649 INFO L226 Difference]: Without dead ends: 5968 [2020-02-10 20:32:21,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:32:21,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5968 states. [2020-02-10 20:32:21,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5968 to 3121. [2020-02-10 20:32:21,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 20:32:21,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15576 transitions. [2020-02-10 20:32:21,873 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15576 transitions. Word has length 31 [2020-02-10 20:32:21,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:21,873 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15576 transitions. [2020-02-10 20:32:21,873 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:32:21,873 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15576 transitions. [2020-02-10 20:32:21,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:32:21,878 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:21,878 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:32:21,878 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:32:21,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:21,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1504102594, now seen corresponding path program 279 times [2020-02-10 20:32:21,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:21,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219931526] [2020-02-10 20:32:21,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:21,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:22,539 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:32:22,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:32:22,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219931526] [2020-02-10 20:32:22,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:22,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:32:22,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680761509] [2020-02-10 20:32:22,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:32:22,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:22,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:32:22,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:32:22,550 INFO L87 Difference]: Start difference. First operand 3121 states and 15576 transitions. Second operand 12 states. [2020-02-10 20:32:22,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:22,774 INFO L93 Difference]: Finished difference Result 5992 states and 26756 transitions. [2020-02-10 20:32:22,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:32:22,774 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:32:22,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:22,789 INFO L225 Difference]: With dead ends: 5992 [2020-02-10 20:32:22,789 INFO L226 Difference]: Without dead ends: 5973 [2020-02-10 20:32:22,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:32:22,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5973 states. [2020-02-10 20:32:22,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5973 to 3128. [2020-02-10 20:32:22,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 20:32:22,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15589 transitions. [2020-02-10 20:32:22,978 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15589 transitions. Word has length 31 [2020-02-10 20:32:22,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:22,978 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15589 transitions. [2020-02-10 20:32:22,978 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:32:22,978 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15589 transitions. [2020-02-10 20:32:22,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:32:22,984 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:22,984 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:32:22,984 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:32:22,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:22,984 INFO L82 PathProgramCache]: Analyzing trace with hash -166535380, now seen corresponding path program 280 times [2020-02-10 20:32:22,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:22,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050859553] [2020-02-10 20:32:22,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:22,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:23,533 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:32:23,666 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:32:23,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:32:23,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050859553] [2020-02-10 20:32:23,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:23,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:32:23,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131625088] [2020-02-10 20:32:23,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:32:23,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:23,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:32:23,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:32:23,676 INFO L87 Difference]: Start difference. First operand 3128 states and 15589 transitions. Second operand 12 states. [2020-02-10 20:32:23,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:23,944 INFO L93 Difference]: Finished difference Result 5991 states and 26747 transitions. [2020-02-10 20:32:23,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:32:23,944 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:32:23,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:23,959 INFO L225 Difference]: With dead ends: 5991 [2020-02-10 20:32:23,959 INFO L226 Difference]: Without dead ends: 5966 [2020-02-10 20:32:23,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:32:24,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5966 states. [2020-02-10 20:32:24,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5966 to 3121. [2020-02-10 20:32:24,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 20:32:24,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15569 transitions. [2020-02-10 20:32:24,144 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15569 transitions. Word has length 31 [2020-02-10 20:32:24,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:24,145 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15569 transitions. [2020-02-10 20:32:24,145 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:32:24,145 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15569 transitions. [2020-02-10 20:32:24,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:32:24,150 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:24,150 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:32:24,150 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:32:24,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:24,150 INFO L82 PathProgramCache]: Analyzing trace with hash 886940670, now seen corresponding path program 281 times [2020-02-10 20:32:24,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:24,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943915192] [2020-02-10 20:32:24,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:24,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:24,685 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:32:24,822 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:32:24,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 20:32:24,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943915192] [2020-02-10 20:32:24,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:24,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:32:24,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981116816] [2020-02-10 20:32:24,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:32:24,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:24,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:32:24,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:32:24,832 INFO L87 Difference]: Start difference. First operand 3121 states and 15569 transitions. Second operand 12 states. [2020-02-10 20:32:25,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:25,059 INFO L93 Difference]: Finished difference Result 5994 states and 26753 transitions. [2020-02-10 20:32:25,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:32:25,059 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:32:25,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:25,074 INFO L225 Difference]: With dead ends: 5994 [2020-02-10 20:32:25,074 INFO L226 Difference]: Without dead ends: 5974 [2020-02-10 20:32:25,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:32:25,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5974 states. [2020-02-10 20:32:25,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5974 to 3128. [2020-02-10 20:32:25,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 20:32:25,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15582 transitions. [2020-02-10 20:32:25,262 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15582 transitions. Word has length 31 [2020-02-10 20:32:25,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:25,263 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15582 transitions. [2020-02-10 20:32:25,263 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:32:25,263 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15582 transitions. [2020-02-10 20:32:25,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:32:25,268 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:25,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:32:25,268 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:32:25,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:25,268 INFO L82 PathProgramCache]: Analyzing trace with hash -803002234, now seen corresponding path program 282 times [2020-02-10 20:32:25,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:25,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869520193] [2020-02-10 20:32:25,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:25,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:25,804 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:32:25,936 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:32:25,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:32:25,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869520193] [2020-02-10 20:32:25,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:25,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:32:25,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595695482] [2020-02-10 20:32:25,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:32:25,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:25,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:32:25,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:32:25,946 INFO L87 Difference]: Start difference. First operand 3128 states and 15582 transitions. Second operand 12 states. [2020-02-10 20:32:26,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:26,254 INFO L93 Difference]: Finished difference Result 5992 states and 26742 transitions. [2020-02-10 20:32:26,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:32:26,254 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:32:26,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:26,270 INFO L225 Difference]: With dead ends: 5992 [2020-02-10 20:32:26,270 INFO L226 Difference]: Without dead ends: 5960 [2020-02-10 20:32:26,270 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:32:26,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5960 states. [2020-02-10 20:32:26,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5960 to 3114. [2020-02-10 20:32:26,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3114 states. [2020-02-10 20:32:26,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 15551 transitions. [2020-02-10 20:32:26,452 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 15551 transitions. Word has length 31 [2020-02-10 20:32:26,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:26,453 INFO L479 AbstractCegarLoop]: Abstraction has 3114 states and 15551 transitions. [2020-02-10 20:32:26,453 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:32:26,453 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 15551 transitions. [2020-02-10 20:32:26,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:32:26,458 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:26,458 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:32:26,458 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:32:26,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:26,458 INFO L82 PathProgramCache]: Analyzing trace with hash 722988968, now seen corresponding path program 283 times [2020-02-10 20:32:26,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:26,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420701399] [2020-02-10 20:32:26,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:26,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:26,996 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:32:27,126 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:32:27,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:32:27,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420701399] [2020-02-10 20:32:27,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:27,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:32:27,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049105598] [2020-02-10 20:32:27,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:32:27,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:27,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:32:27,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:32:27,136 INFO L87 Difference]: Start difference. First operand 3114 states and 15551 transitions. Second operand 12 states. [2020-02-10 20:32:27,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:27,357 INFO L93 Difference]: Finished difference Result 5976 states and 26715 transitions. [2020-02-10 20:32:27,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:32:27,358 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:32:27,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:27,372 INFO L225 Difference]: With dead ends: 5976 [2020-02-10 20:32:27,372 INFO L226 Difference]: Without dead ends: 5960 [2020-02-10 20:32:27,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:32:27,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5960 states. [2020-02-10 20:32:27,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5960 to 3124. [2020-02-10 20:32:27,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:32:27,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15579 transitions. [2020-02-10 20:32:27,554 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15579 transitions. Word has length 31 [2020-02-10 20:32:27,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:27,554 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15579 transitions. [2020-02-10 20:32:27,554 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:32:27,554 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15579 transitions. [2020-02-10 20:32:27,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:32:27,559 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:27,559 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:32:27,559 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:32:27,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:27,560 INFO L82 PathProgramCache]: Analyzing trace with hash -121982484, now seen corresponding path program 284 times [2020-02-10 20:32:27,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:27,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134620098] [2020-02-10 20:32:27,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:27,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:28,087 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:32:28,217 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:32:28,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 20:32:28,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134620098] [2020-02-10 20:32:28,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:28,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:32:28,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993324092] [2020-02-10 20:32:28,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:32:28,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:28,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:32:28,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:32:28,227 INFO L87 Difference]: Start difference. First operand 3124 states and 15579 transitions. Second operand 12 states. [2020-02-10 20:32:28,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:28,453 INFO L93 Difference]: Finished difference Result 5980 states and 26718 transitions. [2020-02-10 20:32:28,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:32:28,453 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:32:28,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:28,467 INFO L225 Difference]: With dead ends: 5980 [2020-02-10 20:32:28,467 INFO L226 Difference]: Without dead ends: 5955 [2020-02-10 20:32:28,468 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:32:28,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5955 states. [2020-02-10 20:32:28,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5955 to 3119. [2020-02-10 20:32:28,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 20:32:28,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15565 transitions. [2020-02-10 20:32:28,658 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15565 transitions. Word has length 31 [2020-02-10 20:32:28,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:28,658 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15565 transitions. [2020-02-10 20:32:28,658 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:32:28,658 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15565 transitions. [2020-02-10 20:32:28,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:32:28,663 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:28,664 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:32:28,664 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:32:28,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:28,664 INFO L82 PathProgramCache]: Analyzing trace with hash -125633504, now seen corresponding path program 285 times [2020-02-10 20:32:28,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:28,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376041601] [2020-02-10 20:32:28,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:28,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:29,242 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:32:29,370 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:32:29,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:32:29,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376041601] [2020-02-10 20:32:29,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:29,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:32:29,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790708171] [2020-02-10 20:32:29,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:32:29,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:29,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:32:29,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:32:29,380 INFO L87 Difference]: Start difference. First operand 3119 states and 15565 transitions. Second operand 12 states. [2020-02-10 20:32:29,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:29,668 INFO L93 Difference]: Finished difference Result 5974 states and 26706 transitions. [2020-02-10 20:32:29,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:32:29,668 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:32:29,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:29,682 INFO L225 Difference]: With dead ends: 5974 [2020-02-10 20:32:29,682 INFO L226 Difference]: Without dead ends: 5958 [2020-02-10 20:32:29,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:32:29,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5958 states. [2020-02-10 20:32:29,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5958 to 3124. [2020-02-10 20:32:29,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:32:29,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15574 transitions. [2020-02-10 20:32:29,874 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15574 transitions. Word has length 31 [2020-02-10 20:32:29,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:29,874 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15574 transitions. [2020-02-10 20:32:29,874 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:32:29,874 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15574 transitions. [2020-02-10 20:32:29,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:32:29,880 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:29,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 20:32:29,880 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:32:29,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:29,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1634419436, now seen corresponding path program 286 times [2020-02-10 20:32:29,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:29,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756655274] [2020-02-10 20:32:29,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:29,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:30,407 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:32:30,539 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:32:30,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:32:30,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756655274] [2020-02-10 20:32:30,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:30,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:32:30,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472729274] [2020-02-10 20:32:30,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:32:30,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:30,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:32:30,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:32:30,549 INFO L87 Difference]: Start difference. First operand 3124 states and 15574 transitions. Second operand 12 states. [2020-02-10 20:32:30,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:30,778 INFO L93 Difference]: Finished difference Result 5976 states and 26705 transitions. [2020-02-10 20:32:30,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:32:30,779 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:32:30,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:30,794 INFO L225 Difference]: With dead ends: 5976 [2020-02-10 20:32:30,794 INFO L226 Difference]: Without dead ends: 5953 [2020-02-10 20:32:30,794 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:32:30,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5953 states. [2020-02-10 20:32:30,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5953 to 3119. [2020-02-10 20:32:30,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 20:32:30,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15560 transitions. [2020-02-10 20:32:30,977 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15560 transitions. Word has length 31 [2020-02-10 20:32:30,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:30,977 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15560 transitions. [2020-02-10 20:32:30,977 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:32:30,978 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15560 transitions. [2020-02-10 20:32:30,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:32:30,982 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:30,983 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:32:30,983 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:32:30,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:30,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1394916192, now seen corresponding path program 287 times [2020-02-10 20:32:30,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:30,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407601572] [2020-02-10 20:32:30,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:30,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:31,510 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:32:31,640 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:32:31,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:32:31,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407601572] [2020-02-10 20:32:31,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:31,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:32:31,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579358260] [2020-02-10 20:32:31,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:32:31,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:31,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:32:31,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:32:31,650 INFO L87 Difference]: Start difference. First operand 3119 states and 15560 transitions. Second operand 12 states. [2020-02-10 20:32:31,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:31,940 INFO L93 Difference]: Finished difference Result 5984 states and 26723 transitions. [2020-02-10 20:32:31,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:32:31,940 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:32:31,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:31,955 INFO L225 Difference]: With dead ends: 5984 [2020-02-10 20:32:31,955 INFO L226 Difference]: Without dead ends: 5964 [2020-02-10 20:32:31,956 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:32:32,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5964 states. [2020-02-10 20:32:32,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5964 to 3126. [2020-02-10 20:32:32,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 20:32:32,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15573 transitions. [2020-02-10 20:32:32,139 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15573 transitions. Word has length 31 [2020-02-10 20:32:32,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:32,139 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15573 transitions. [2020-02-10 20:32:32,139 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:32:32,139 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15573 transitions. [2020-02-10 20:32:32,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:32:32,144 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:32,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:32:32,144 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:32:32,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:32,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1210108200, now seen corresponding path program 288 times [2020-02-10 20:32:32,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:32,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189175265] [2020-02-10 20:32:32,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:32,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:32,687 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:32:32,818 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:32:32,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:32:32,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189175265] [2020-02-10 20:32:32,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:32,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:32:32,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420201531] [2020-02-10 20:32:32,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:32:32,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:32,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:32:32,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:32:32,827 INFO L87 Difference]: Start difference. First operand 3126 states and 15573 transitions. Second operand 12 states. [2020-02-10 20:32:33,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:33,085 INFO L93 Difference]: Finished difference Result 5982 states and 26712 transitions. [2020-02-10 20:32:33,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:32:33,085 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:32:33,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:33,100 INFO L225 Difference]: With dead ends: 5982 [2020-02-10 20:32:33,100 INFO L226 Difference]: Without dead ends: 5947 [2020-02-10 20:32:33,100 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:32:33,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5947 states. [2020-02-10 20:32:33,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5947 to 3109. [2020-02-10 20:32:33,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3109 states. [2020-02-10 20:32:33,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3109 states to 3109 states and 15537 transitions. [2020-02-10 20:32:33,287 INFO L78 Accepts]: Start accepts. Automaton has 3109 states and 15537 transitions. Word has length 31 [2020-02-10 20:32:33,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:33,287 INFO L479 AbstractCegarLoop]: Abstraction has 3109 states and 15537 transitions. [2020-02-10 20:32:33,287 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:32:33,287 INFO L276 IsEmpty]: Start isEmpty. Operand 3109 states and 15537 transitions. [2020-02-10 20:32:33,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:32:33,292 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:33,292 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:32:33,292 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:32:33,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:33,292 INFO L82 PathProgramCache]: Analyzing trace with hash 565119294, now seen corresponding path program 289 times [2020-02-10 20:32:33,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:33,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856368964] [2020-02-10 20:32:33,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:33,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:33,822 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:32:33,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:32:33,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:32:33,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856368964] [2020-02-10 20:32:33,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:33,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:32:33,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269492139] [2020-02-10 20:32:33,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:32:33,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:33,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:32:33,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:32:33,965 INFO L87 Difference]: Start difference. First operand 3109 states and 15537 transitions. Second operand 12 states. [2020-02-10 20:32:34,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:34,301 INFO L93 Difference]: Finished difference Result 5968 states and 26703 transitions. [2020-02-10 20:32:34,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:32:34,302 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:32:34,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:34,316 INFO L225 Difference]: With dead ends: 5968 [2020-02-10 20:32:34,316 INFO L226 Difference]: Without dead ends: 5949 [2020-02-10 20:32:34,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:32:34,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5949 states. [2020-02-10 20:32:34,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5949 to 3124. [2020-02-10 20:32:34,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:32:34,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15589 transitions. [2020-02-10 20:32:34,500 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15589 transitions. Word has length 31 [2020-02-10 20:32:34,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:34,500 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15589 transitions. [2020-02-10 20:32:34,500 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:32:34,500 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15589 transitions. [2020-02-10 20:32:34,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:32:34,505 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:34,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:32:34,505 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:32:34,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:34,505 INFO L82 PathProgramCache]: Analyzing trace with hash 142633568, now seen corresponding path program 290 times [2020-02-10 20:32:34,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:34,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138519049] [2020-02-10 20:32:34,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:34,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:35,045 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2020-02-10 20:32:35,174 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:32:35,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:32:35,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138519049] [2020-02-10 20:32:35,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:35,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:32:35,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276418785] [2020-02-10 20:32:35,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:32:35,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:35,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:32:35,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:32:35,183 INFO L87 Difference]: Start difference. First operand 3124 states and 15589 transitions. Second operand 12 states. [2020-02-10 20:32:35,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:35,431 INFO L93 Difference]: Finished difference Result 5965 states and 26692 transitions. [2020-02-10 20:32:35,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:32:35,432 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:32:35,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:35,446 INFO L225 Difference]: With dead ends: 5965 [2020-02-10 20:32:35,446 INFO L226 Difference]: Without dead ends: 5944 [2020-02-10 20:32:35,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:32:35,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5944 states. [2020-02-10 20:32:35,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5944 to 3119. [2020-02-10 20:32:35,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 20:32:35,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15575 transitions. [2020-02-10 20:32:35,628 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15575 transitions. Word has length 31 [2020-02-10 20:32:35,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:35,628 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15575 transitions. [2020-02-10 20:32:35,628 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:32:35,628 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15575 transitions. [2020-02-10 20:32:35,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:32:35,633 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:35,633 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:32:35,633 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:32:35,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:35,633 INFO L82 PathProgramCache]: Analyzing trace with hash -283503178, now seen corresponding path program 291 times [2020-02-10 20:32:35,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:35,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709644553] [2020-02-10 20:32:35,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:35,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:36,172 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:32:36,307 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 20:32:36,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:32:36,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709644553] [2020-02-10 20:32:36,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:36,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:32:36,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515912140] [2020-02-10 20:32:36,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:32:36,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:36,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:32:36,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:32:36,317 INFO L87 Difference]: Start difference. First operand 3119 states and 15575 transitions. Second operand 12 states. [2020-02-10 20:32:36,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:36,659 INFO L93 Difference]: Finished difference Result 5970 states and 26703 transitions. [2020-02-10 20:32:36,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:32:36,660 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:32:36,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:36,675 INFO L225 Difference]: With dead ends: 5970 [2020-02-10 20:32:36,675 INFO L226 Difference]: Without dead ends: 5951 [2020-02-10 20:32:36,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:32:36,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5951 states. [2020-02-10 20:32:36,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5951 to 3125. [2020-02-10 20:32:36,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 20:32:36,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15586 transitions. [2020-02-10 20:32:36,868 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15586 transitions. Word has length 31 [2020-02-10 20:32:36,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:36,868 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15586 transitions. [2020-02-10 20:32:36,868 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:32:36,869 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15586 transitions. [2020-02-10 20:32:36,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:32:36,874 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:36,874 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:32:36,874 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:32:36,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:36,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1899035488, now seen corresponding path program 292 times [2020-02-10 20:32:36,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:36,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040269079] [2020-02-10 20:32:36,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:36,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:37,408 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:32:37,538 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:32:37,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:32:37,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040269079] [2020-02-10 20:32:37,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:37,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:32:37,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539243406] [2020-02-10 20:32:37,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:32:37,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:37,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:32:37,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:32:37,549 INFO L87 Difference]: Start difference. First operand 3125 states and 15586 transitions. Second operand 12 states. [2020-02-10 20:32:37,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:37,797 INFO L93 Difference]: Finished difference Result 5968 states and 26693 transitions. [2020-02-10 20:32:37,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:32:37,797 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:32:37,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:37,812 INFO L225 Difference]: With dead ends: 5968 [2020-02-10 20:32:37,812 INFO L226 Difference]: Without dead ends: 5945 [2020-02-10 20:32:37,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 20:32:37,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5945 states. [2020-02-10 20:32:37,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5945 to 3119. [2020-02-10 20:32:37,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 20:32:37,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15570 transitions. [2020-02-10 20:32:37,998 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15570 transitions. Word has length 31 [2020-02-10 20:32:37,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:37,999 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15570 transitions. [2020-02-10 20:32:37,999 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:32:37,999 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15570 transitions. [2020-02-10 20:32:38,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:32:38,004 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:38,004 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:32:38,004 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:32:38,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:38,004 INFO L82 PathProgramCache]: Analyzing trace with hash -918144522, now seen corresponding path program 293 times [2020-02-10 20:32:38,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:38,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339892001] [2020-02-10 20:32:38,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:38,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:38,548 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:32:38,684 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:32:38,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:32:38,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339892001] [2020-02-10 20:32:38,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:38,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:32:38,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328733300] [2020-02-10 20:32:38,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:32:38,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:38,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:32:38,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:32:38,694 INFO L87 Difference]: Start difference. First operand 3119 states and 15570 transitions. Second operand 12 states. [2020-02-10 20:32:38,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:38,927 INFO L93 Difference]: Finished difference Result 5963 states and 26683 transitions. [2020-02-10 20:32:38,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:32:38,928 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:32:38,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:38,943 INFO L225 Difference]: With dead ends: 5963 [2020-02-10 20:32:38,943 INFO L226 Difference]: Without dead ends: 5947 [2020-02-10 20:32:38,943 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:32:39,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5947 states. [2020-02-10 20:32:39,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5947 to 3124. [2020-02-10 20:32:39,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:32:39,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15579 transitions. [2020-02-10 20:32:39,130 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15579 transitions. Word has length 31 [2020-02-10 20:32:39,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:39,131 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15579 transitions. [2020-02-10 20:32:39,131 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:32:39,131 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15579 transitions. [2020-02-10 20:32:39,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:32:39,136 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:39,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:32:39,136 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:32:39,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:39,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1686879870, now seen corresponding path program 294 times [2020-02-10 20:32:39,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:39,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302575437] [2020-02-10 20:32:39,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:39,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:39,688 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:32:39,820 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:32:39,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:32:39,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302575437] [2020-02-10 20:32:39,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:39,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:32:39,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016448879] [2020-02-10 20:32:39,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:32:39,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:39,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:32:39,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:32:39,830 INFO L87 Difference]: Start difference. First operand 3124 states and 15579 transitions. Second operand 12 states. [2020-02-10 20:32:40,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:40,066 INFO L93 Difference]: Finished difference Result 5964 states and 26680 transitions. [2020-02-10 20:32:40,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:32:40,067 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:32:40,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:40,082 INFO L225 Difference]: With dead ends: 5964 [2020-02-10 20:32:40,082 INFO L226 Difference]: Without dead ends: 5937 [2020-02-10 20:32:40,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:32:40,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5937 states. [2020-02-10 20:32:40,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5937 to 3114. [2020-02-10 20:32:40,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3114 states. [2020-02-10 20:32:40,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 15556 transitions. [2020-02-10 20:32:40,268 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 15556 transitions. Word has length 31 [2020-02-10 20:32:40,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:40,268 INFO L479 AbstractCegarLoop]: Abstraction has 3114 states and 15556 transitions. [2020-02-10 20:32:40,268 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:32:40,268 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 15556 transitions. [2020-02-10 20:32:40,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:32:40,273 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:40,273 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:32:40,273 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:32:40,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:40,274 INFO L82 PathProgramCache]: Analyzing trace with hash 296372866, now seen corresponding path program 295 times [2020-02-10 20:32:40,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:40,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442130998] [2020-02-10 20:32:40,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:40,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:40,817 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:32:40,946 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:32:40,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:32:40,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442130998] [2020-02-10 20:32:40,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:40,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:32:40,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155383831] [2020-02-10 20:32:40,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:32:40,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:40,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:32:40,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:32:40,957 INFO L87 Difference]: Start difference. First operand 3114 states and 15556 transitions. Second operand 12 states. [2020-02-10 20:32:41,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:41,208 INFO L93 Difference]: Finished difference Result 5970 states and 26703 transitions. [2020-02-10 20:32:41,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:32:41,209 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:32:41,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:41,223 INFO L225 Difference]: With dead ends: 5970 [2020-02-10 20:32:41,224 INFO L226 Difference]: Without dead ends: 5951 [2020-02-10 20:32:41,224 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:32:41,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5951 states. [2020-02-10 20:32:41,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5951 to 3124. [2020-02-10 20:32:41,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:32:41,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15584 transitions. [2020-02-10 20:32:41,412 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15584 transitions. Word has length 31 [2020-02-10 20:32:41,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:41,412 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15584 transitions. [2020-02-10 20:32:41,412 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:32:41,412 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15584 transitions. [2020-02-10 20:32:41,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:32:41,417 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:41,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:32:41,417 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:32:41,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:41,417 INFO L82 PathProgramCache]: Analyzing trace with hash -126112860, now seen corresponding path program 296 times [2020-02-10 20:32:41,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:41,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106114233] [2020-02-10 20:32:41,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:41,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:41,960 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:32:42,092 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:32:42,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:32:42,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106114233] [2020-02-10 20:32:42,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:42,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:32:42,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142761769] [2020-02-10 20:32:42,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:32:42,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:42,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:32:42,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:32:42,103 INFO L87 Difference]: Start difference. First operand 3124 states and 15584 transitions. Second operand 12 states. [2020-02-10 20:32:42,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:42,333 INFO L93 Difference]: Finished difference Result 5967 states and 26692 transitions. [2020-02-10 20:32:42,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:32:42,334 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:32:42,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:42,349 INFO L225 Difference]: With dead ends: 5967 [2020-02-10 20:32:42,349 INFO L226 Difference]: Without dead ends: 5946 [2020-02-10 20:32:42,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 20:32:42,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5946 states. [2020-02-10 20:32:42,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5946 to 3119. [2020-02-10 20:32:42,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 20:32:42,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15570 transitions. [2020-02-10 20:32:42,536 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15570 transitions. Word has length 31 [2020-02-10 20:32:42,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:42,536 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15570 transitions. [2020-02-10 20:32:42,536 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:32:42,536 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15570 transitions. [2020-02-10 20:32:42,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:32:42,541 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:42,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:32:42,541 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:32:42,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:42,541 INFO L82 PathProgramCache]: Analyzing trace with hash -976560842, now seen corresponding path program 297 times [2020-02-10 20:32:42,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:42,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565208974] [2020-02-10 20:32:42,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:42,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:43,090 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:32:43,220 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:32:43,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:32:43,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565208974] [2020-02-10 20:32:43,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:43,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:32:43,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758761567] [2020-02-10 20:32:43,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:32:43,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:43,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:32:43,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:32:43,231 INFO L87 Difference]: Start difference. First operand 3119 states and 15570 transitions. Second operand 12 states. [2020-02-10 20:32:43,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:43,457 INFO L93 Difference]: Finished difference Result 5974 states and 26708 transitions. [2020-02-10 20:32:43,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:32:43,457 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:32:43,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:43,471 INFO L225 Difference]: With dead ends: 5974 [2020-02-10 20:32:43,471 INFO L226 Difference]: Without dead ends: 5955 [2020-02-10 20:32:43,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:32:43,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5955 states. [2020-02-10 20:32:43,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5955 to 3126. [2020-02-10 20:32:43,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 20:32:43,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15583 transitions. [2020-02-10 20:32:43,698 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15583 transitions. Word has length 31 [2020-02-10 20:32:43,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:43,698 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15583 transitions. [2020-02-10 20:32:43,698 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:32:43,698 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15583 transitions. [2020-02-10 20:32:43,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:32:43,703 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:43,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 20:32:43,703 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:32:43,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:43,704 INFO L82 PathProgramCache]: Analyzing trace with hash 361006372, now seen corresponding path program 298 times [2020-02-10 20:32:43,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:43,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308536801] [2020-02-10 20:32:43,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:43,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:44,251 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:32:44,386 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:32:44,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:32:44,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308536801] [2020-02-10 20:32:44,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:44,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:32:44,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133014309] [2020-02-10 20:32:44,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:32:44,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:44,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:32:44,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:32:44,395 INFO L87 Difference]: Start difference. First operand 3126 states and 15583 transitions. Second operand 12 states. [2020-02-10 20:32:44,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:44,640 INFO L93 Difference]: Finished difference Result 5973 states and 26699 transitions. [2020-02-10 20:32:44,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:32:44,641 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:32:44,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:44,656 INFO L225 Difference]: With dead ends: 5973 [2020-02-10 20:32:44,656 INFO L226 Difference]: Without dead ends: 5948 [2020-02-10 20:32:44,656 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:32:44,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5948 states. [2020-02-10 20:32:44,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5948 to 3119. [2020-02-10 20:32:44,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 20:32:44,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15565 transitions. [2020-02-10 20:32:44,842 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15565 transitions. Word has length 31 [2020-02-10 20:32:44,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:44,842 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15565 transitions. [2020-02-10 20:32:44,842 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:32:44,842 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15565 transitions. [2020-02-10 20:32:44,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:32:44,848 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:44,848 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:32:44,848 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:32:44,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:44,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1611202186, now seen corresponding path program 299 times [2020-02-10 20:32:44,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:44,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769640933] [2020-02-10 20:32:44,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:44,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:45,390 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:32:45,525 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:32:45,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:32:45,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769640933] [2020-02-10 20:32:45,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:45,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:32:45,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167562241] [2020-02-10 20:32:45,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:32:45,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:45,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:32:45,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:32:45,535 INFO L87 Difference]: Start difference. First operand 3119 states and 15565 transitions. Second operand 12 states. [2020-02-10 20:32:45,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:45,760 INFO L93 Difference]: Finished difference Result 5966 states and 26685 transitions. [2020-02-10 20:32:45,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:32:45,761 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:32:45,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:45,776 INFO L225 Difference]: With dead ends: 5966 [2020-02-10 20:32:45,776 INFO L226 Difference]: Without dead ends: 5950 [2020-02-10 20:32:45,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:32:45,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5950 states. [2020-02-10 20:32:45,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5950 to 3124. [2020-02-10 20:32:45,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:32:45,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15574 transitions. [2020-02-10 20:32:45,963 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15574 transitions. Word has length 31 [2020-02-10 20:32:45,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:45,963 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15574 transitions. [2020-02-10 20:32:45,963 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:32:45,963 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15574 transitions. [2020-02-10 20:32:45,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:32:45,968 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:45,968 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:32:45,968 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:32:45,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:45,968 INFO L82 PathProgramCache]: Analyzing trace with hash 148850754, now seen corresponding path program 300 times [2020-02-10 20:32:45,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:45,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333564246] [2020-02-10 20:32:45,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:45,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:46,502 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:32:46,633 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:32:46,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:32:46,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333564246] [2020-02-10 20:32:46,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:46,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:32:46,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962517172] [2020-02-10 20:32:46,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:32:46,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:46,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:32:46,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:32:46,642 INFO L87 Difference]: Start difference. First operand 3124 states and 15574 transitions. Second operand 12 states. [2020-02-10 20:32:46,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:46,905 INFO L93 Difference]: Finished difference Result 5968 states and 26684 transitions. [2020-02-10 20:32:46,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:32:46,905 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:32:46,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:46,920 INFO L225 Difference]: With dead ends: 5968 [2020-02-10 20:32:46,920 INFO L226 Difference]: Without dead ends: 5940 [2020-02-10 20:32:46,920 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:32:47,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5940 states. [2020-02-10 20:32:47,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5940 to 3114. [2020-02-10 20:32:47,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3114 states. [2020-02-10 20:32:47,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 15551 transitions. [2020-02-10 20:32:47,102 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 15551 transitions. Word has length 31 [2020-02-10 20:32:47,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:47,102 INFO L479 AbstractCegarLoop]: Abstraction has 3114 states and 15551 transitions. [2020-02-10 20:32:47,102 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:32:47,102 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 15551 transitions. [2020-02-10 20:32:47,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:32:47,107 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:47,107 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:32:47,107 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:32:47,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:47,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1089742462, now seen corresponding path program 301 times [2020-02-10 20:32:47,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:47,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140967373] [2020-02-10 20:32:47,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:47,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:47,647 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:32:47,780 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:32:47,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:32:47,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140967373] [2020-02-10 20:32:47,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:47,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:32:47,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903436747] [2020-02-10 20:32:47,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:32:47,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:47,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:32:47,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:32:47,790 INFO L87 Difference]: Start difference. First operand 3114 states and 15551 transitions. Second operand 12 states. [2020-02-10 20:32:48,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:48,091 INFO L93 Difference]: Finished difference Result 5976 states and 26715 transitions. [2020-02-10 20:32:48,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:32:48,091 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:32:48,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:48,106 INFO L225 Difference]: With dead ends: 5976 [2020-02-10 20:32:48,106 INFO L226 Difference]: Without dead ends: 5957 [2020-02-10 20:32:48,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:32:48,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5957 states. [2020-02-10 20:32:48,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5957 to 3126. [2020-02-10 20:32:48,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 20:32:48,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15585 transitions. [2020-02-10 20:32:48,294 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15585 transitions. Word has length 31 [2020-02-10 20:32:48,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:48,294 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15585 transitions. [2020-02-10 20:32:48,294 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:32:48,294 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15585 transitions. [2020-02-10 20:32:48,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:32:48,300 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:48,300 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:32:48,300 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:32:48,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:48,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1092796204, now seen corresponding path program 302 times [2020-02-10 20:32:48,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:48,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719107889] [2020-02-10 20:32:48,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:48,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:48,847 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:32:48,978 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:32:48,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:32:48,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719107889] [2020-02-10 20:32:48,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:48,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:32:48,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865376506] [2020-02-10 20:32:48,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:32:48,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:48,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:32:48,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:32:48,988 INFO L87 Difference]: Start difference. First operand 3126 states and 15585 transitions. Second operand 12 states. [2020-02-10 20:32:49,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:49,287 INFO L93 Difference]: Finished difference Result 5974 states and 26705 transitions. [2020-02-10 20:32:49,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:32:49,288 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:32:49,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:49,302 INFO L225 Difference]: With dead ends: 5974 [2020-02-10 20:32:49,303 INFO L226 Difference]: Without dead ends: 5951 [2020-02-10 20:32:49,303 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:32:49,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5951 states. [2020-02-10 20:32:49,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5951 to 3120. [2020-02-10 20:32:49,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3120 states. [2020-02-10 20:32:49,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 15568 transitions. [2020-02-10 20:32:49,484 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 15568 transitions. Word has length 31 [2020-02-10 20:32:49,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:49,484 INFO L479 AbstractCegarLoop]: Abstraction has 3120 states and 15568 transitions. [2020-02-10 20:32:49,484 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:32:49,484 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 15568 transitions. [2020-02-10 20:32:49,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:32:49,489 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:49,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:32:49,489 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:32:49,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:49,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1514053698, now seen corresponding path program 303 times [2020-02-10 20:32:49,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:49,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788607829] [2020-02-10 20:32:49,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:49,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:50,027 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:32:50,163 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:32:50,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:32:50,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788607829] [2020-02-10 20:32:50,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:50,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:32:50,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063092953] [2020-02-10 20:32:50,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:32:50,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:50,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:32:50,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:32:50,174 INFO L87 Difference]: Start difference. First operand 3120 states and 15568 transitions. Second operand 12 states. [2020-02-10 20:32:50,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:50,465 INFO L93 Difference]: Finished difference Result 5978 states and 26714 transitions. [2020-02-10 20:32:50,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:32:50,466 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:32:50,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:50,480 INFO L225 Difference]: With dead ends: 5978 [2020-02-10 20:32:50,480 INFO L226 Difference]: Without dead ends: 5959 [2020-02-10 20:32:50,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:32:50,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5959 states. [2020-02-10 20:32:50,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5959 to 3127. [2020-02-10 20:32:50,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:32:50,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15581 transitions. [2020-02-10 20:32:50,667 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15581 transitions. Word has length 31 [2020-02-10 20:32:50,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:50,668 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15581 transitions. [2020-02-10 20:32:50,668 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:32:50,668 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15581 transitions. [2020-02-10 20:32:50,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:32:50,673 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:50,673 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:32:50,673 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:32:50,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:50,673 INFO L82 PathProgramCache]: Analyzing trace with hash -176486484, now seen corresponding path program 304 times [2020-02-10 20:32:50,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:50,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876262842] [2020-02-10 20:32:50,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:50,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:51,266 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:32:51,396 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:32:51,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:32:51,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876262842] [2020-02-10 20:32:51,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:51,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:32:51,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810348940] [2020-02-10 20:32:51,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:32:51,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:51,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:32:51,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:32:51,407 INFO L87 Difference]: Start difference. First operand 3127 states and 15581 transitions. Second operand 12 states. [2020-02-10 20:32:51,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:51,648 INFO L93 Difference]: Finished difference Result 5977 states and 26705 transitions. [2020-02-10 20:32:51,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:32:51,648 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:32:51,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:51,663 INFO L225 Difference]: With dead ends: 5977 [2020-02-10 20:32:51,663 INFO L226 Difference]: Without dead ends: 5952 [2020-02-10 20:32:51,663 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:32:51,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5952 states. [2020-02-10 20:32:51,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5952 to 3120. [2020-02-10 20:32:51,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3120 states. [2020-02-10 20:32:51,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 15562 transitions. [2020-02-10 20:32:51,845 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 15562 transitions. Word has length 31 [2020-02-10 20:32:51,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:51,845 INFO L479 AbstractCegarLoop]: Abstraction has 3120 states and 15562 transitions. [2020-02-10 20:32:51,845 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:32:51,845 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 15562 transitions. [2020-02-10 20:32:51,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:32:51,850 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:51,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 20:32:51,850 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:32:51,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:51,851 INFO L82 PathProgramCache]: Analyzing trace with hash -392293122, now seen corresponding path program 305 times [2020-02-10 20:32:51,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:51,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241903826] [2020-02-10 20:32:51,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:51,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:52,406 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:32:52,538 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:32:52,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:32:52,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241903826] [2020-02-10 20:32:52,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:52,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:32:52,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017097566] [2020-02-10 20:32:52,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:32:52,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:52,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:32:52,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:32:52,549 INFO L87 Difference]: Start difference. First operand 3120 states and 15562 transitions. Second operand 12 states. [2020-02-10 20:32:52,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:52,828 INFO L93 Difference]: Finished difference Result 5973 states and 26697 transitions. [2020-02-10 20:32:52,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:32:52,828 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:32:52,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:52,843 INFO L225 Difference]: With dead ends: 5973 [2020-02-10 20:32:52,843 INFO L226 Difference]: Without dead ends: 5956 [2020-02-10 20:32:52,844 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:32:52,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5956 states. [2020-02-10 20:32:53,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5956 to 3126. [2020-02-10 20:32:53,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 20:32:53,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15573 transitions. [2020-02-10 20:32:53,026 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15573 transitions. Word has length 31 [2020-02-10 20:32:53,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:53,027 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15573 transitions. [2020-02-10 20:32:53,027 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:32:53,027 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15573 transitions. [2020-02-10 20:32:53,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:32:53,032 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:53,032 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:32:53,032 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:32:53,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:53,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1237264574, now seen corresponding path program 306 times [2020-02-10 20:32:53,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:53,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115817539] [2020-02-10 20:32:53,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:53,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:53,586 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:32:53,719 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:32:53,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:32:53,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115817539] [2020-02-10 20:32:53,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:53,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:32:53,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256391944] [2020-02-10 20:32:53,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:32:53,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:53,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:32:53,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:32:53,728 INFO L87 Difference]: Start difference. First operand 3126 states and 15573 transitions. Second operand 12 states. [2020-02-10 20:32:54,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:54,037 INFO L93 Difference]: Finished difference Result 5974 states and 26693 transitions. [2020-02-10 20:32:54,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:32:54,038 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:32:54,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:54,052 INFO L225 Difference]: With dead ends: 5974 [2020-02-10 20:32:54,053 INFO L226 Difference]: Without dead ends: 5944 [2020-02-10 20:32:54,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:32:54,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5944 states. [2020-02-10 20:32:54,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5944 to 3114. [2020-02-10 20:32:54,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3114 states. [2020-02-10 20:32:54,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 15546 transitions. [2020-02-10 20:32:54,236 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 15546 transitions. Word has length 31 [2020-02-10 20:32:54,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:54,236 INFO L479 AbstractCegarLoop]: Abstraction has 3114 states and 15546 transitions. [2020-02-10 20:32:54,236 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:32:54,236 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 15546 transitions. [2020-02-10 20:32:54,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:32:54,241 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:54,241 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:32:54,241 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:32:54,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:54,241 INFO L82 PathProgramCache]: Analyzing trace with hash 288726628, now seen corresponding path program 307 times [2020-02-10 20:32:54,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:54,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374743323] [2020-02-10 20:32:54,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:54,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:54,799 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:32:54,932 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 35 [2020-02-10 20:32:54,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:32:54,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374743323] [2020-02-10 20:32:54,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:54,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:32:54,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425680950] [2020-02-10 20:32:54,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:32:54,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:54,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:32:54,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:32:54,942 INFO L87 Difference]: Start difference. First operand 3114 states and 15546 transitions. Second operand 12 states. [2020-02-10 20:32:55,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:55,182 INFO L93 Difference]: Finished difference Result 5962 states and 26676 transitions. [2020-02-10 20:32:55,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:32:55,182 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:32:55,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:55,196 INFO L225 Difference]: With dead ends: 5962 [2020-02-10 20:32:55,196 INFO L226 Difference]: Without dead ends: 5946 [2020-02-10 20:32:55,197 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:32:55,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5946 states. [2020-02-10 20:32:55,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5946 to 3124. [2020-02-10 20:32:55,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:32:55,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15574 transitions. [2020-02-10 20:32:55,379 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15574 transitions. Word has length 31 [2020-02-10 20:32:55,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:55,379 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15574 transitions. [2020-02-10 20:32:55,379 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:32:55,379 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15574 transitions. [2020-02-10 20:32:55,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:32:55,384 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:55,384 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:32:55,384 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:32:55,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:55,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1401216276, now seen corresponding path program 308 times [2020-02-10 20:32:55,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:55,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094284355] [2020-02-10 20:32:55,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:55,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:55,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:32:56,070 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:32:56,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:32:56,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094284355] [2020-02-10 20:32:56,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:56,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:32:56,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062971264] [2020-02-10 20:32:56,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:32:56,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:56,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:32:56,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:32:56,081 INFO L87 Difference]: Start difference. First operand 3124 states and 15574 transitions. Second operand 12 states. [2020-02-10 20:32:56,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:56,315 INFO L93 Difference]: Finished difference Result 5963 states and 26673 transitions. [2020-02-10 20:32:56,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:32:56,315 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:32:56,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:56,330 INFO L225 Difference]: With dead ends: 5963 [2020-02-10 20:32:56,330 INFO L226 Difference]: Without dead ends: 5941 [2020-02-10 20:32:56,330 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:32:56,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5941 states. [2020-02-10 20:32:56,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5941 to 3119. [2020-02-10 20:32:56,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 20:32:56,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15560 transitions. [2020-02-10 20:32:56,512 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15560 transitions. Word has length 31 [2020-02-10 20:32:56,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:56,512 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15560 transitions. [2020-02-10 20:32:56,512 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:32:56,512 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15560 transitions. [2020-02-10 20:32:56,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:32:56,517 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:56,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:32:56,517 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:32:56,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:56,517 INFO L82 PathProgramCache]: Analyzing trace with hash -135584608, now seen corresponding path program 309 times [2020-02-10 20:32:56,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:56,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578626042] [2020-02-10 20:32:56,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:56,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:57,071 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:32:57,203 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:32:57,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:32:57,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578626042] [2020-02-10 20:32:57,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:57,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:32:57,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279492644] [2020-02-10 20:32:57,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:32:57,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:57,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:32:57,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:32:57,213 INFO L87 Difference]: Start difference. First operand 3119 states and 15560 transitions. Second operand 12 states. [2020-02-10 20:32:57,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:57,569 INFO L93 Difference]: Finished difference Result 5963 states and 26673 transitions. [2020-02-10 20:32:57,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:32:57,570 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:32:57,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:57,584 INFO L225 Difference]: With dead ends: 5963 [2020-02-10 20:32:57,585 INFO L226 Difference]: Without dead ends: 5947 [2020-02-10 20:32:57,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:32:57,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5947 states. [2020-02-10 20:32:57,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5947 to 3124. [2020-02-10 20:32:57,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:32:57,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15569 transitions. [2020-02-10 20:32:57,772 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15569 transitions. Word has length 31 [2020-02-10 20:32:57,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:57,772 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15569 transitions. [2020-02-10 20:32:57,772 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:32:57,772 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15569 transitions. [2020-02-10 20:32:57,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:32:57,777 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:57,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:32:57,778 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:32:57,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:57,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1624468332, now seen corresponding path program 310 times [2020-02-10 20:32:57,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:57,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961338165] [2020-02-10 20:32:57,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:57,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:58,328 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:32:58,457 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:32:58,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:32:58,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961338165] [2020-02-10 20:32:58,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:58,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:32:58,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229824624] [2020-02-10 20:32:58,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:32:58,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:58,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:32:58,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:32:58,467 INFO L87 Difference]: Start difference. First operand 3124 states and 15569 transitions. Second operand 12 states. [2020-02-10 20:32:58,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:32:58,857 INFO L93 Difference]: Finished difference Result 5965 states and 26672 transitions. [2020-02-10 20:32:58,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:32:58,858 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:32:58,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:32:58,873 INFO L225 Difference]: With dead ends: 5965 [2020-02-10 20:32:58,873 INFO L226 Difference]: Without dead ends: 5942 [2020-02-10 20:32:58,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:32:59,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5942 states. [2020-02-10 20:32:59,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5942 to 3119. [2020-02-10 20:32:59,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 20:32:59,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15555 transitions. [2020-02-10 20:32:59,060 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15555 transitions. Word has length 31 [2020-02-10 20:32:59,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:32:59,061 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15555 transitions. [2020-02-10 20:32:59,061 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:32:59,061 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15555 transitions. [2020-02-10 20:32:59,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:32:59,066 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:32:59,066 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:32:59,066 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:32:59,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:32:59,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1620817312, now seen corresponding path program 311 times [2020-02-10 20:32:59,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:32:59,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128600832] [2020-02-10 20:32:59,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:32:59,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:32:59,614 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:32:59,746 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:32:59,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:32:59,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128600832] [2020-02-10 20:32:59,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:32:59,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:32:59,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234354118] [2020-02-10 20:32:59,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:32:59,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:32:59,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:32:59,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:32:59,757 INFO L87 Difference]: Start difference. First operand 3119 states and 15555 transitions. Second operand 12 states. [2020-02-10 20:33:00,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:00,017 INFO L93 Difference]: Finished difference Result 5966 states and 26675 transitions. [2020-02-10 20:33:00,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:33:00,018 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:33:00,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:00,032 INFO L225 Difference]: With dead ends: 5966 [2020-02-10 20:33:00,032 INFO L226 Difference]: Without dead ends: 5949 [2020-02-10 20:33:00,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:33:00,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5949 states. [2020-02-10 20:33:00,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5949 to 3125. [2020-02-10 20:33:00,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 20:33:00,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15566 transitions. [2020-02-10 20:33:00,215 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15566 transitions. Word has length 31 [2020-02-10 20:33:00,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:00,215 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15566 transitions. [2020-02-10 20:33:00,215 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:33:00,215 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15566 transitions. [2020-02-10 20:33:00,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:33:00,220 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:00,220 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:33:00,220 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:33:00,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:00,220 INFO L82 PathProgramCache]: Analyzing trace with hash 775845860, now seen corresponding path program 312 times [2020-02-10 20:33:00,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:00,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673963390] [2020-02-10 20:33:00,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:00,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:00,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 20:33:00,900 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:33:00,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:33:00,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673963390] [2020-02-10 20:33:00,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:00,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:33:00,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834459076] [2020-02-10 20:33:00,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:33:00,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:00,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:33:00,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:33:00,911 INFO L87 Difference]: Start difference. First operand 3125 states and 15566 transitions. Second operand 12 states. [2020-02-10 20:33:01,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:01,276 INFO L93 Difference]: Finished difference Result 5967 states and 26671 transitions. [2020-02-10 20:33:01,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:33:01,276 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:33:01,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:01,291 INFO L225 Difference]: With dead ends: 5967 [2020-02-10 20:33:01,291 INFO L226 Difference]: Without dead ends: 5933 [2020-02-10 20:33:01,291 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:33:01,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5933 states. [2020-02-10 20:33:01,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5933 to 3109. [2020-02-10 20:33:01,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3109 states. [2020-02-10 20:33:01,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3109 states to 3109 states and 15532 transitions. [2020-02-10 20:33:01,478 INFO L78 Accepts]: Start accepts. Automaton has 3109 states and 15532 transitions. Word has length 31 [2020-02-10 20:33:01,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:01,478 INFO L479 AbstractCegarLoop]: Abstraction has 3109 states and 15532 transitions. [2020-02-10 20:33:01,478 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:33:01,478 INFO L276 IsEmpty]: Start isEmpty. Operand 3109 states and 15532 transitions. [2020-02-10 20:33:01,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:33:01,483 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:01,483 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:33:01,484 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:33:01,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:01,484 INFO L82 PathProgramCache]: Analyzing trace with hash 130856954, now seen corresponding path program 313 times [2020-02-10 20:33:01,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:01,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357456998] [2020-02-10 20:33:01,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:01,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:02,026 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:33:02,157 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:33:02,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:33:02,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357456998] [2020-02-10 20:33:02,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:02,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:33:02,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821536524] [2020-02-10 20:33:02,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:33:02,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:02,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:33:02,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:33:02,168 INFO L87 Difference]: Start difference. First operand 3109 states and 15532 transitions. Second operand 12 states. [2020-02-10 20:33:02,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:02,484 INFO L93 Difference]: Finished difference Result 5999 states and 26786 transitions. [2020-02-10 20:33:02,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:33:02,484 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:33:02,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:02,499 INFO L225 Difference]: With dead ends: 5999 [2020-02-10 20:33:02,499 INFO L226 Difference]: Without dead ends: 5980 [2020-02-10 20:33:02,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:33:02,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5980 states. [2020-02-10 20:33:02,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5980 to 3129. [2020-02-10 20:33:02,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 20:33:02,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15599 transitions. [2020-02-10 20:33:02,687 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15599 transitions. Word has length 31 [2020-02-10 20:33:02,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:02,687 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15599 transitions. [2020-02-10 20:33:02,687 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:33:02,687 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15599 transitions. [2020-02-10 20:33:02,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:33:02,692 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:02,692 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:33:02,692 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:33:02,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:02,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1136600224, now seen corresponding path program 314 times [2020-02-10 20:33:02,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:02,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010833028] [2020-02-10 20:33:02,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:02,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33: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:33:03,376 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:33:03,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:33:03,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010833028] [2020-02-10 20:33:03,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:03,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:33:03,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713775905] [2020-02-10 20:33:03,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:33:03,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:03,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:33:03,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:33:03,386 INFO L87 Difference]: Start difference. First operand 3129 states and 15599 transitions. Second operand 12 states. [2020-02-10 20:33:03,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:03,738 INFO L93 Difference]: Finished difference Result 6000 states and 26780 transitions. [2020-02-10 20:33:03,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:33:03,738 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:33:03,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:03,753 INFO L225 Difference]: With dead ends: 6000 [2020-02-10 20:33:03,753 INFO L226 Difference]: Without dead ends: 5972 [2020-02-10 20:33:03,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:33:03,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5972 states. [2020-02-10 20:33:03,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5972 to 3121. [2020-02-10 20:33:03,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 20:33:03,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15578 transitions. [2020-02-10 20:33:03,936 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15578 transitions. Word has length 31 [2020-02-10 20:33:03,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:03,936 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15578 transitions. [2020-02-10 20:33:03,937 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:33:03,937 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15578 transitions. [2020-02-10 20:33:03,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:33:03,942 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:03,942 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:33:03,942 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:33:03,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:03,942 INFO L82 PathProgramCache]: Analyzing trace with hash -293454282, now seen corresponding path program 315 times [2020-02-10 20:33:03,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:03,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548166435] [2020-02-10 20:33:03,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:03,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:04,494 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:33:04,625 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:33:04,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:33:04,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548166435] [2020-02-10 20:33:04,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:04,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:33:04,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906722534] [2020-02-10 20:33:04,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:33:04,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:04,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:33:04,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:33:04,635 INFO L87 Difference]: Start difference. First operand 3121 states and 15578 transitions. Second operand 12 states. [2020-02-10 20:33:04,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:04,860 INFO L93 Difference]: Finished difference Result 5994 states and 26768 transitions. [2020-02-10 20:33:04,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:33:04,860 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:33:04,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:04,875 INFO L225 Difference]: With dead ends: 5994 [2020-02-10 20:33:04,875 INFO L226 Difference]: Without dead ends: 5975 [2020-02-10 20:33:04,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:33:05,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5975 states. [2020-02-10 20:33:05,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5975 to 3127. [2020-02-10 20:33:05,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:33:05,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15589 transitions. [2020-02-10 20:33:05,061 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15589 transitions. Word has length 31 [2020-02-10 20:33:05,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:05,062 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15589 transitions. [2020-02-10 20:33:05,062 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:33:05,062 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15589 transitions. [2020-02-10 20:33:05,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:33:05,067 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:05,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:33:05,067 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:33:05,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:05,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1889084384, now seen corresponding path program 316 times [2020-02-10 20:33:05,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:05,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633657329] [2020-02-10 20:33:05,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:05,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:05,613 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:33:05,743 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:33:05,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:33:05,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633657329] [2020-02-10 20:33:05,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:05,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:33:05,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525127178] [2020-02-10 20:33:05,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:33:05,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:05,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:33:05,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:33:05,754 INFO L87 Difference]: Start difference. First operand 3127 states and 15589 transitions. Second operand 12 states. [2020-02-10 20:33:05,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:05,985 INFO L93 Difference]: Finished difference Result 5992 states and 26758 transitions. [2020-02-10 20:33:05,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:33:05,986 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:33:05,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:06,000 INFO L225 Difference]: With dead ends: 5992 [2020-02-10 20:33:06,001 INFO L226 Difference]: Without dead ends: 5969 [2020-02-10 20:33:06,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:33:06,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5969 states. [2020-02-10 20:33:06,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5969 to 3121. [2020-02-10 20:33:06,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 20:33:06,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15572 transitions. [2020-02-10 20:33:06,227 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15572 transitions. Word has length 31 [2020-02-10 20:33:06,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:06,227 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15572 transitions. [2020-02-10 20:33:06,227 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:33:06,227 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15572 transitions. [2020-02-10 20:33:06,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:33:06,232 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:06,232 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:33:06,233 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:33:06,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:06,233 INFO L82 PathProgramCache]: Analyzing trace with hash 2097588982, now seen corresponding path program 317 times [2020-02-10 20:33:06,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:06,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422253542] [2020-02-10 20:33:06,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:06,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:06,772 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:33:06,902 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:33:06,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:33:06,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422253542] [2020-02-10 20:33:06,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:06,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:33:06,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471531429] [2020-02-10 20:33:06,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:33:06,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:06,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:33:06,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:33:06,912 INFO L87 Difference]: Start difference. First operand 3121 states and 15572 transitions. Second operand 12 states. [2020-02-10 20:33:07,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:07,134 INFO L93 Difference]: Finished difference Result 5996 states and 26766 transitions. [2020-02-10 20:33:07,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:33:07,135 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:33:07,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:07,149 INFO L225 Difference]: With dead ends: 5996 [2020-02-10 20:33:07,150 INFO L226 Difference]: Without dead ends: 5976 [2020-02-10 20:33:07,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:33:07,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5976 states. [2020-02-10 20:33:07,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5976 to 3127. [2020-02-10 20:33:07,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:33:07,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15583 transitions. [2020-02-10 20:33:07,333 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15583 transitions. Word has length 31 [2020-02-10 20:33:07,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:07,333 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15583 transitions. [2020-02-10 20:33:07,333 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:33:07,333 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15583 transitions. [2020-02-10 20:33:07,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:33:07,338 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:07,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:33:07,339 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:33:07,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:07,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1252617530, now seen corresponding path program 318 times [2020-02-10 20:33:07,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:07,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374910743] [2020-02-10 20:33:07,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:07,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:08,011 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:33:08,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:33:08,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374910743] [2020-02-10 20:33:08,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:08,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:33:08,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694206798] [2020-02-10 20:33:08,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:33:08,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:08,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:33:08,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:33:08,021 INFO L87 Difference]: Start difference. First operand 3127 states and 15583 transitions. Second operand 12 states. [2020-02-10 20:33:08,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:08,246 INFO L93 Difference]: Finished difference Result 5993 states and 26754 transitions. [2020-02-10 20:33:08,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:33:08,246 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:33:08,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:08,260 INFO L225 Difference]: With dead ends: 5993 [2020-02-10 20:33:08,261 INFO L226 Difference]: Without dead ends: 5964 [2020-02-10 20:33:08,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:33:08,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5964 states. [2020-02-10 20:33:08,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5964 to 3115. [2020-02-10 20:33:08,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3115 states. [2020-02-10 20:33:08,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3115 states to 3115 states and 15555 transitions. [2020-02-10 20:33:08,455 INFO L78 Accepts]: Start accepts. Automaton has 3115 states and 15555 transitions. Word has length 31 [2020-02-10 20:33:08,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:08,455 INFO L479 AbstractCegarLoop]: Abstraction has 3115 states and 15555 transitions. [2020-02-10 20:33:08,455 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:33:08,455 INFO L276 IsEmpty]: Start isEmpty. Operand 3115 states and 15555 transitions. [2020-02-10 20:33:08,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:33:08,460 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:08,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:33:08,460 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:33:08,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:08,460 INFO L82 PathProgramCache]: Analyzing trace with hash -137889474, now seen corresponding path program 319 times [2020-02-10 20:33:08,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:08,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937883825] [2020-02-10 20:33:08,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:08,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:09,013 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:33:09,143 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 37 [2020-02-10 20:33:09,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:33:09,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937883825] [2020-02-10 20:33:09,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:09,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:33:09,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906850519] [2020-02-10 20:33:09,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:33:09,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:09,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:33:09,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:33:09,153 INFO L87 Difference]: Start difference. First operand 3115 states and 15555 transitions. Second operand 12 states. [2020-02-10 20:33:09,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:09,396 INFO L93 Difference]: Finished difference Result 6003 states and 26792 transitions. [2020-02-10 20:33:09,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:33:09,397 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:33:09,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:09,412 INFO L225 Difference]: With dead ends: 6003 [2020-02-10 20:33:09,412 INFO L226 Difference]: Without dead ends: 5984 [2020-02-10 20:33:09,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:33:09,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5984 states. [2020-02-10 20:33:09,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5984 to 3130. [2020-02-10 20:33:09,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 20:33:09,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15597 transitions. [2020-02-10 20:33:09,594 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15597 transitions. Word has length 31 [2020-02-10 20:33:09,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:09,595 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15597 transitions. [2020-02-10 20:33:09,595 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:33:09,595 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15597 transitions. [2020-02-10 20:33:09,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:33:09,600 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:09,600 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:33:09,600 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:33:09,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:09,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1405346652, now seen corresponding path program 320 times [2020-02-10 20:33:09,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:09,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043727877] [2020-02-10 20:33:09,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:09,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:10,146 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:33:10,279 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:33:10,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:33:10,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043727877] [2020-02-10 20:33:10,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:10,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:33:10,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357376687] [2020-02-10 20:33:10,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:33:10,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:10,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:33:10,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:33:10,289 INFO L87 Difference]: Start difference. First operand 3130 states and 15597 transitions. Second operand 12 states. [2020-02-10 20:33:10,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:10,519 INFO L93 Difference]: Finished difference Result 6004 states and 26786 transitions. [2020-02-10 20:33:10,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:33:10,519 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:33:10,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:10,534 INFO L225 Difference]: With dead ends: 6004 [2020-02-10 20:33:10,534 INFO L226 Difference]: Without dead ends: 5976 [2020-02-10 20:33:10,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:33:10,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5976 states. [2020-02-10 20:33:10,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5976 to 3122. [2020-02-10 20:33:10,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-02-10 20:33:10,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15575 transitions. [2020-02-10 20:33:10,721 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15575 transitions. Word has length 31 [2020-02-10 20:33:10,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:10,721 INFO L479 AbstractCegarLoop]: Abstraction has 3122 states and 15575 transitions. [2020-02-10 20:33:10,721 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:33:10,721 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15575 transitions. [2020-02-10 20:33:10,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:33:10,726 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:10,726 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:33:10,726 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:33:10,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:10,727 INFO L82 PathProgramCache]: Analyzing trace with hash -986511946, now seen corresponding path program 321 times [2020-02-10 20:33:10,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:10,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035529524] [2020-02-10 20:33:10,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:10,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:11,296 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:33:11,429 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:33:11,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:33:11,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035529524] [2020-02-10 20:33:11,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:11,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:33:11,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209370107] [2020-02-10 20:33:11,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:33:11,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:11,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:33:11,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:33:11,439 INFO L87 Difference]: Start difference. First operand 3122 states and 15575 transitions. Second operand 12 states. [2020-02-10 20:33:11,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:11,667 INFO L93 Difference]: Finished difference Result 6000 states and 26778 transitions. [2020-02-10 20:33:11,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:33:11,668 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:33:11,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:11,682 INFO L225 Difference]: With dead ends: 6000 [2020-02-10 20:33:11,682 INFO L226 Difference]: Without dead ends: 5981 [2020-02-10 20:33:11,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:33:11,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5981 states. [2020-02-10 20:33:11,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5981 to 3129. [2020-02-10 20:33:11,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 20:33:11,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15588 transitions. [2020-02-10 20:33:11,865 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15588 transitions. Word has length 31 [2020-02-10 20:33:11,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:11,865 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15588 transitions. [2020-02-10 20:33:11,865 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:33:11,865 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15588 transitions. [2020-02-10 20:33:11,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:33:11,870 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:11,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:33:11,870 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:33:11,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:11,870 INFO L82 PathProgramCache]: Analyzing trace with hash 351055268, now seen corresponding path program 322 times [2020-02-10 20:33:11,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:11,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230021783] [2020-02-10 20:33:11,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:11,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:12,440 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:33:12,572 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:33:12,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:33:12,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230021783] [2020-02-10 20:33:12,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:12,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:33:12,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741833780] [2020-02-10 20:33:12,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:33:12,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:12,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:33:12,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:33:12,583 INFO L87 Difference]: Start difference. First operand 3129 states and 15588 transitions. Second operand 12 states. [2020-02-10 20:33:12,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:12,818 INFO L93 Difference]: Finished difference Result 5999 states and 26769 transitions. [2020-02-10 20:33:12,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:33:12,819 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:33:12,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:12,834 INFO L225 Difference]: With dead ends: 5999 [2020-02-10 20:33:12,834 INFO L226 Difference]: Without dead ends: 5974 [2020-02-10 20:33:12,834 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:33:12,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5974 states. [2020-02-10 20:33:13,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5974 to 3122. [2020-02-10 20:33:13,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-02-10 20:33:13,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15568 transitions. [2020-02-10 20:33:13,023 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15568 transitions. Word has length 31 [2020-02-10 20:33:13,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:13,024 INFO L479 AbstractCegarLoop]: Abstraction has 3122 states and 15568 transitions. [2020-02-10 20:33:13,024 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:33:13,024 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15568 transitions. [2020-02-10 20:33:13,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:33:13,029 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:13,029 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:33:13,029 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:33:13,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:13,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1404531318, now seen corresponding path program 323 times [2020-02-10 20:33:13,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:13,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135394988] [2020-02-10 20:33:13,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:13,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:13,494 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 30 [2020-02-10 20:33:13,616 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:33:13,749 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:33:13,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:33:13,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135394988] [2020-02-10 20:33:13,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:13,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:33:13,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258512999] [2020-02-10 20:33:13,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:33:13,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:13,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:33:13,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:33:13,759 INFO L87 Difference]: Start difference. First operand 3122 states and 15568 transitions. Second operand 12 states. [2020-02-10 20:33:13,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:13,981 INFO L93 Difference]: Finished difference Result 6002 states and 26775 transitions. [2020-02-10 20:33:13,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:33:13,982 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:33:13,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:13,996 INFO L225 Difference]: With dead ends: 6002 [2020-02-10 20:33:13,996 INFO L226 Difference]: Without dead ends: 5982 [2020-02-10 20:33:13,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:33:14,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5982 states. [2020-02-10 20:33:14,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5982 to 3129. [2020-02-10 20:33:14,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 20:33:14,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15581 transitions. [2020-02-10 20:33:14,179 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15581 transitions. Word has length 31 [2020-02-10 20:33:14,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:14,180 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15581 transitions. [2020-02-10 20:33:14,180 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:33:14,180 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15581 transitions. [2020-02-10 20:33:14,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:33:14,185 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:14,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:33:14,185 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:33:14,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:14,185 INFO L82 PathProgramCache]: Analyzing trace with hash -285411586, now seen corresponding path program 324 times [2020-02-10 20:33:14,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:14,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997851274] [2020-02-10 20:33:14,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:14,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:14,858 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:33:14,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:33:14,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997851274] [2020-02-10 20:33:14,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:14,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:33:14,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844743842] [2020-02-10 20:33:14,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:33:14,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:14,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:33:14,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:33:14,868 INFO L87 Difference]: Start difference. First operand 3129 states and 15581 transitions. Second operand 12 states. [2020-02-10 20:33:15,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:15,139 INFO L93 Difference]: Finished difference Result 6000 states and 26764 transitions. [2020-02-10 20:33:15,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:33:15,139 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:33:15,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:15,153 INFO L225 Difference]: With dead ends: 6000 [2020-02-10 20:33:15,154 INFO L226 Difference]: Without dead ends: 5968 [2020-02-10 20:33:15,154 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:33:15,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5968 states. [2020-02-10 20:33:15,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5968 to 3115. [2020-02-10 20:33:15,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3115 states. [2020-02-10 20:33:15,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3115 states to 3115 states and 15549 transitions. [2020-02-10 20:33:15,335 INFO L78 Accepts]: Start accepts. Automaton has 3115 states and 15549 transitions. Word has length 31 [2020-02-10 20:33:15,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:15,335 INFO L479 AbstractCegarLoop]: Abstraction has 3115 states and 15549 transitions. [2020-02-10 20:33:15,336 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:33:15,336 INFO L276 IsEmpty]: Start isEmpty. Operand 3115 states and 15549 transitions. [2020-02-10 20:33:15,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:33:15,340 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:15,340 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:33:15,341 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:33:15,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:15,341 INFO L82 PathProgramCache]: Analyzing trace with hash -830947138, now seen corresponding path program 325 times [2020-02-10 20:33:15,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:15,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066213341] [2020-02-10 20:33:15,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:15,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:15,879 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:33:16,009 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:33:16,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:33:16,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066213341] [2020-02-10 20:33:16,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:16,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:33:16,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899756154] [2020-02-10 20:33:16,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:33:16,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:16,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:33:16,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:33:16,019 INFO L87 Difference]: Start difference. First operand 3115 states and 15549 transitions. Second operand 12 states. [2020-02-10 20:33:16,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:16,278 INFO L93 Difference]: Finished difference Result 5991 states and 26755 transitions. [2020-02-10 20:33:16,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:33:16,279 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:33:16,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:16,293 INFO L225 Difference]: With dead ends: 5991 [2020-02-10 20:33:16,294 INFO L226 Difference]: Without dead ends: 5972 [2020-02-10 20:33:16,294 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:33:16,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5972 states. [2020-02-10 20:33:16,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5972 to 3127. [2020-02-10 20:33:16,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:33:16,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15583 transitions. [2020-02-10 20:33:16,476 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15583 transitions. Word has length 31 [2020-02-10 20:33:16,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:16,476 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15583 transitions. [2020-02-10 20:33:16,476 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:33:16,476 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15583 transitions. [2020-02-10 20:33:16,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:33:16,481 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:16,481 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:33:16,481 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:33:16,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:16,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1351591528, now seen corresponding path program 326 times [2020-02-10 20:33:16,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:16,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138046218] [2020-02-10 20:33:16,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:16,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:17,016 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:33:17,149 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:33:17,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:33:17,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138046218] [2020-02-10 20:33:17,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:17,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:33:17,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956575023] [2020-02-10 20:33:17,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:33:17,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:17,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:33:17,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:33:17,160 INFO L87 Difference]: Start difference. First operand 3127 states and 15583 transitions. Second operand 12 states. [2020-02-10 20:33:17,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:17,392 INFO L93 Difference]: Finished difference Result 5989 states and 26745 transitions. [2020-02-10 20:33:17,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:33:17,393 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:33:17,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:17,408 INFO L225 Difference]: With dead ends: 5989 [2020-02-10 20:33:17,408 INFO L226 Difference]: Without dead ends: 5966 [2020-02-10 20:33:17,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:33:17,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5966 states. [2020-02-10 20:33:17,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5966 to 3121. [2020-02-10 20:33:17,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 20:33:17,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15566 transitions. [2020-02-10 20:33:17,591 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15566 transitions. Word has length 31 [2020-02-10 20:33:17,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:17,591 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15566 transitions. [2020-02-10 20:33:17,591 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:33:17,591 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15566 transitions. [2020-02-10 20:33:17,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:33:17,596 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:17,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:33:17,597 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:33:17,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:17,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1255258374, now seen corresponding path program 327 times [2020-02-10 20:33:17,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:17,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132874096] [2020-02-10 20:33:17,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:17,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:18,138 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:33:18,273 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:33:18,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:33:18,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132874096] [2020-02-10 20:33:18,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:18,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:33:18,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178585046] [2020-02-10 20:33:18,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:33:18,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:18,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:33:18,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:33:18,284 INFO L87 Difference]: Start difference. First operand 3121 states and 15566 transitions. Second operand 12 states. [2020-02-10 20:33:18,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:18,513 INFO L93 Difference]: Finished difference Result 5993 states and 26754 transitions. [2020-02-10 20:33:18,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:33:18,513 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:33:18,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:18,527 INFO L225 Difference]: With dead ends: 5993 [2020-02-10 20:33:18,527 INFO L226 Difference]: Without dead ends: 5974 [2020-02-10 20:33:18,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:33:18,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5974 states. [2020-02-10 20:33:18,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5974 to 3128. [2020-02-10 20:33:18,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 20:33:18,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15579 transitions. [2020-02-10 20:33:18,715 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15579 transitions. Word has length 31 [2020-02-10 20:33:18,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:18,716 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15579 transitions. [2020-02-10 20:33:18,716 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:33:18,716 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15579 transitions. [2020-02-10 20:33:18,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:33:18,721 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:18,721 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:33:18,721 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:33:18,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:18,721 INFO L82 PathProgramCache]: Analyzing trace with hash 82308840, now seen corresponding path program 328 times [2020-02-10 20:33:18,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:18,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740218030] [2020-02-10 20:33:18,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:18,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:19,266 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:33:19,400 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:33:19,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:33:19,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740218030] [2020-02-10 20:33:19,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:19,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:33:19,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976325085] [2020-02-10 20:33:19,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:33:19,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:19,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:33:19,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:33:19,411 INFO L87 Difference]: Start difference. First operand 3128 states and 15579 transitions. Second operand 12 states. [2020-02-10 20:33:19,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:19,687 INFO L93 Difference]: Finished difference Result 5992 states and 26745 transitions. [2020-02-10 20:33:19,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:33:19,687 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:33:19,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:19,701 INFO L225 Difference]: With dead ends: 5992 [2020-02-10 20:33:19,701 INFO L226 Difference]: Without dead ends: 5967 [2020-02-10 20:33:19,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:33:19,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5967 states. [2020-02-10 20:33:19,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5967 to 3121. [2020-02-10 20:33:19,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 20:33:19,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15560 transitions. [2020-02-10 20:33:19,884 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15560 transitions. Word has length 31 [2020-02-10 20:33:19,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:19,884 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15560 transitions. [2020-02-10 20:33:19,884 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:33:19,884 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15560 transitions. [2020-02-10 20:33:19,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:33:19,889 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:19,890 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:33:19,890 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:33:19,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:19,890 INFO L82 PathProgramCache]: Analyzing trace with hash -133497798, now seen corresponding path program 329 times [2020-02-10 20:33:19,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:19,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940074658] [2020-02-10 20:33:19,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:19,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:20,454 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:33:20,586 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:33:20,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:33:20,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940074658] [2020-02-10 20:33:20,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:20,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:33:20,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122135521] [2020-02-10 20:33:20,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:33:20,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:20,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:33:20,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:33:20,596 INFO L87 Difference]: Start difference. First operand 3121 states and 15560 transitions. Second operand 12 states. [2020-02-10 20:33:20,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:20,823 INFO L93 Difference]: Finished difference Result 5988 states and 26737 transitions. [2020-02-10 20:33:20,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:33:20,823 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:33:20,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:20,837 INFO L225 Difference]: With dead ends: 5988 [2020-02-10 20:33:20,837 INFO L226 Difference]: Without dead ends: 5971 [2020-02-10 20:33:20,837 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:33:21,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5971 states. [2020-02-10 20:33:21,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5971 to 3127. [2020-02-10 20:33:21,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:33:21,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15571 transitions. [2020-02-10 20:33:21,059 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15571 transitions. Word has length 31 [2020-02-10 20:33:21,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:21,059 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15571 transitions. [2020-02-10 20:33:21,059 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:33:21,059 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15571 transitions. [2020-02-10 20:33:21,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:33:21,064 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:21,065 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:33:21,065 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:33:21,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:21,065 INFO L82 PathProgramCache]: Analyzing trace with hash -978469250, now seen corresponding path program 330 times [2020-02-10 20:33:21,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:21,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440903730] [2020-02-10 20:33:21,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:21,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:21,612 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:33:21,744 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:33:21,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:33:21,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440903730] [2020-02-10 20:33:21,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:21,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:33:21,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935766491] [2020-02-10 20:33:21,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:33:21,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:21,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:33:21,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:33:21,755 INFO L87 Difference]: Start difference. First operand 3127 states and 15571 transitions. Second operand 12 states. [2020-02-10 20:33:21,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:21,977 INFO L93 Difference]: Finished difference Result 5989 states and 26733 transitions. [2020-02-10 20:33:21,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:33:21,978 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:33:21,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:21,992 INFO L225 Difference]: With dead ends: 5989 [2020-02-10 20:33:21,993 INFO L226 Difference]: Without dead ends: 5959 [2020-02-10 20:33:21,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:33:22,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5959 states. [2020-02-10 20:33:22,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5959 to 3115. [2020-02-10 20:33:22,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3115 states. [2020-02-10 20:33:22,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3115 states to 3115 states and 15543 transitions. [2020-02-10 20:33:22,180 INFO L78 Accepts]: Start accepts. Automaton has 3115 states and 15543 transitions. Word has length 31 [2020-02-10 20:33:22,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:22,180 INFO L479 AbstractCegarLoop]: Abstraction has 3115 states and 15543 transitions. [2020-02-10 20:33:22,180 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:33:22,180 INFO L276 IsEmpty]: Start isEmpty. Operand 3115 states and 15543 transitions. [2020-02-10 20:33:22,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:33:22,185 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:22,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:33:22,185 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:33:22,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:22,186 INFO L82 PathProgramCache]: Analyzing trace with hash -990507164, now seen corresponding path program 331 times [2020-02-10 20:33:22,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:22,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261613813] [2020-02-10 20:33:22,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:22,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:22,707 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:33:22,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:33:22,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:33:22,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261613813] [2020-02-10 20:33:22,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:22,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:33:22,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605216711] [2020-02-10 20:33:22,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:33:22,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:22,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:33:22,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:33:22,849 INFO L87 Difference]: Start difference. First operand 3115 states and 15543 transitions. Second operand 12 states. [2020-02-10 20:33:23,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:23,161 INFO L93 Difference]: Finished difference Result 5994 states and 26755 transitions. [2020-02-10 20:33:23,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:33:23,162 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:33:23,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:23,176 INFO L225 Difference]: With dead ends: 5994 [2020-02-10 20:33:23,177 INFO L226 Difference]: Without dead ends: 5974 [2020-02-10 20:33:23,177 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:33:23,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5974 states. [2020-02-10 20:33:23,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5974 to 3127. [2020-02-10 20:33:23,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:33:23,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15577 transitions. [2020-02-10 20:33:23,357 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15577 transitions. Word has length 31 [2020-02-10 20:33:23,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:23,357 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15577 transitions. [2020-02-10 20:33:23,357 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:33:23,357 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15577 transitions. [2020-02-10 20:33:23,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:33:23,362 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:23,362 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:33:23,363 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:33:23,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:23,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1835478616, now seen corresponding path program 332 times [2020-02-10 20:33:23,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:23,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737501349] [2020-02-10 20:33:23,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:23,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:23,900 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:33:24,035 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:33:24,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:33:24,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737501349] [2020-02-10 20:33:24,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:24,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:33:24,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821930358] [2020-02-10 20:33:24,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:33:24,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:24,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:33:24,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:33:24,044 INFO L87 Difference]: Start difference. First operand 3127 states and 15577 transitions. Second operand 12 states. [2020-02-10 20:33:24,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:24,277 INFO L93 Difference]: Finished difference Result 5991 states and 26743 transitions. [2020-02-10 20:33:24,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:33:24,277 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:33:24,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:24,293 INFO L225 Difference]: With dead ends: 5991 [2020-02-10 20:33:24,293 INFO L226 Difference]: Without dead ends: 5968 [2020-02-10 20:33:24,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:33:24,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5968 states. [2020-02-10 20:33:24,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5968 to 3121. [2020-02-10 20:33:24,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 20:33:24,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15560 transitions. [2020-02-10 20:33:24,479 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15560 transitions. Word has length 31 [2020-02-10 20:33:24,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:24,479 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15560 transitions. [2020-02-10 20:33:24,479 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:33:24,479 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15560 transitions. [2020-02-10 20:33:24,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:33:24,484 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:24,484 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:33:24,484 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:33:24,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:24,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1414818400, now seen corresponding path program 333 times [2020-02-10 20:33:24,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:24,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230809953] [2020-02-10 20:33:24,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:24,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:25,008 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:33:25,140 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:33:25,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:33:25,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230809953] [2020-02-10 20:33:25,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:25,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:33:25,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605652875] [2020-02-10 20:33:25,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:33:25,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:25,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:33:25,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:33:25,151 INFO L87 Difference]: Start difference. First operand 3121 states and 15560 transitions. Second operand 12 states. [2020-02-10 20:33:25,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:25,469 INFO L93 Difference]: Finished difference Result 5996 states and 26754 transitions. [2020-02-10 20:33:25,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:33:25,469 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:33:25,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:25,484 INFO L225 Difference]: With dead ends: 5996 [2020-02-10 20:33:25,484 INFO L226 Difference]: Without dead ends: 5976 [2020-02-10 20:33:25,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:33:25,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5976 states. [2020-02-10 20:33:25,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5976 to 3128. [2020-02-10 20:33:25,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 20:33:25,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15573 transitions. [2020-02-10 20:33:25,668 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15573 transitions. Word has length 31 [2020-02-10 20:33:25,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:25,668 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15573 transitions. [2020-02-10 20:33:25,668 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:33:25,668 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15573 transitions. [2020-02-10 20:33:25,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:33:25,673 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:25,673 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:33:25,673 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:33:25,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:25,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1190205992, now seen corresponding path program 334 times [2020-02-10 20:33:25,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:25,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308061645] [2020-02-10 20:33:25,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:25,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:26,205 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:33:26,335 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:33:26,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:33:26,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308061645] [2020-02-10 20:33:26,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:26,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:33:26,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643701641] [2020-02-10 20:33:26,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:33:26,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:26,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:33:26,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:33:26,346 INFO L87 Difference]: Start difference. First operand 3128 states and 15573 transitions. Second operand 12 states. [2020-02-10 20:33:26,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:26,589 INFO L93 Difference]: Finished difference Result 5994 states and 26743 transitions. [2020-02-10 20:33:26,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:33:26,589 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:33:26,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:26,604 INFO L225 Difference]: With dead ends: 5994 [2020-02-10 20:33:26,604 INFO L226 Difference]: Without dead ends: 5969 [2020-02-10 20:33:26,604 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:33:26,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5969 states. [2020-02-10 20:33:26,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5969 to 3121. [2020-02-10 20:33:26,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 20:33:26,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15554 transitions. [2020-02-10 20:33:26,792 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15554 transitions. Word has length 31 [2020-02-10 20:33:26,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:26,792 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15554 transitions. [2020-02-10 20:33:26,792 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:33:26,792 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15554 transitions. [2020-02-10 20:33:26,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:33:26,797 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:26,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:33:26,798 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:33:26,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:26,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1610866208, now seen corresponding path program 335 times [2020-02-10 20:33:26,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:26,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24248936] [2020-02-10 20:33:26,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:26,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:27,357 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:33:27,486 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:33:27,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:33:27,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24248936] [2020-02-10 20:33:27,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:27,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:33:27,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662028448] [2020-02-10 20:33:27,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:33:27,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:27,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:33:27,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:33:27,497 INFO L87 Difference]: Start difference. First operand 3121 states and 15554 transitions. Second operand 12 states. [2020-02-10 20:33:27,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:27,779 INFO L93 Difference]: Finished difference Result 5989 states and 26733 transitions. [2020-02-10 20:33:27,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:33:27,779 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:33:27,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:27,794 INFO L225 Difference]: With dead ends: 5989 [2020-02-10 20:33:27,794 INFO L226 Difference]: Without dead ends: 5972 [2020-02-10 20:33:27,794 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:33:27,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5972 states. [2020-02-10 20:33:27,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5972 to 3127. [2020-02-10 20:33:27,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:33:27,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15565 transitions. [2020-02-10 20:33:27,982 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15565 transitions. Word has length 31 [2020-02-10 20:33:27,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:27,982 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15565 transitions. [2020-02-10 20:33:27,982 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:33:27,982 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15565 transitions. [2020-02-10 20:33:27,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:33:27,987 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:27,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:33:27,988 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:33:27,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:27,988 INFO L82 PathProgramCache]: Analyzing trace with hash 765894756, now seen corresponding path program 336 times [2020-02-10 20:33:27,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:27,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227985744] [2020-02-10 20:33:27,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:27,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:28,276 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 23 [2020-02-10 20:33:28,585 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:33:28,718 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:33:28,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:33:28,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227985744] [2020-02-10 20:33:28,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:28,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:33:28,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745087112] [2020-02-10 20:33:28,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:33:28,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:28,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:33:28,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:33:28,728 INFO L87 Difference]: Start difference. First operand 3127 states and 15565 transitions. Second operand 12 states. [2020-02-10 20:33:28,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:28,982 INFO L93 Difference]: Finished difference Result 5990 states and 26729 transitions. [2020-02-10 20:33:28,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:33:28,982 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:33:28,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:28,998 INFO L225 Difference]: With dead ends: 5990 [2020-02-10 20:33:28,998 INFO L226 Difference]: Without dead ends: 5954 [2020-02-10 20:33:28,998 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:33:29,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5954 states. [2020-02-10 20:33:29,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5954 to 3109. [2020-02-10 20:33:29,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3109 states. [2020-02-10 20:33:29,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3109 states to 3109 states and 15527 transitions. [2020-02-10 20:33:29,185 INFO L78 Accepts]: Start accepts. Automaton has 3109 states and 15527 transitions. Word has length 31 [2020-02-10 20:33:29,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:29,185 INFO L479 AbstractCegarLoop]: Abstraction has 3109 states and 15527 transitions. [2020-02-10 20:33:29,185 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:33:29,185 INFO L276 IsEmpty]: Start isEmpty. Operand 3109 states and 15527 transitions. [2020-02-10 20:33:29,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:33:29,190 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:29,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:33:29,190 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:33:29,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:29,190 INFO L82 PathProgramCache]: Analyzing trace with hash -508759942, now seen corresponding path program 337 times [2020-02-10 20:33:29,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:29,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881893681] [2020-02-10 20:33:29,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:29,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:29,704 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:33:29,838 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:33:29,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:33:29,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881893681] [2020-02-10 20:33:29,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:29,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:33:29,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241778086] [2020-02-10 20:33:29,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:33:29,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:29,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:33:29,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:33:29,848 INFO L87 Difference]: Start difference. First operand 3109 states and 15527 transitions. Second operand 12 states. [2020-02-10 20:33:30,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:30,111 INFO L93 Difference]: Finished difference Result 5968 states and 26693 transitions. [2020-02-10 20:33:30,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:33:30,112 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:33:30,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:30,126 INFO L225 Difference]: With dead ends: 5968 [2020-02-10 20:33:30,126 INFO L226 Difference]: Without dead ends: 5952 [2020-02-10 20:33:30,126 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:33:30,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5952 states. [2020-02-10 20:33:30,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5952 to 3124. [2020-02-10 20:33:30,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:33:30,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15579 transitions. [2020-02-10 20:33:30,310 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15579 transitions. Word has length 31 [2020-02-10 20:33:30,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:30,310 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15579 transitions. [2020-02-10 20:33:30,310 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:33:30,310 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15579 transitions. [2020-02-10 20:33:30,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:33:30,315 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:30,315 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:33:30,315 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:33:30,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:30,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1353731394, now seen corresponding path program 338 times [2020-02-10 20:33:30,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:30,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511944397] [2020-02-10 20:33:30,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:30,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:30,837 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:33:30,965 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:33:30,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:33:30,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511944397] [2020-02-10 20:33:30,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:30,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:33:30,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057514923] [2020-02-10 20:33:30,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:33:30,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:30,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:33:30,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:33:30,975 INFO L87 Difference]: Start difference. First operand 3124 states and 15579 transitions. Second operand 12 states. [2020-02-10 20:33:31,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:31,193 INFO L93 Difference]: Finished difference Result 5972 states and 26696 transitions. [2020-02-10 20:33:31,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:33:31,193 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:33:31,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:31,208 INFO L225 Difference]: With dead ends: 5972 [2020-02-10 20:33:31,208 INFO L226 Difference]: Without dead ends: 5947 [2020-02-10 20:33:31,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:33:31,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5947 states. [2020-02-10 20:33:31,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5947 to 3119. [2020-02-10 20:33:31,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 20:33:31,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15565 transitions. [2020-02-10 20:33:31,393 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15565 transitions. Word has length 31 [2020-02-10 20:33:31,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:31,393 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15565 transitions. [2020-02-10 20:33:31,393 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:33:31,393 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15565 transitions. [2020-02-10 20:33:31,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:33:31,398 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:31,398 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:33:31,398 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:33:31,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:31,399 INFO L82 PathProgramCache]: Analyzing trace with hash -933071178, now seen corresponding path program 339 times [2020-02-10 20:33:31,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:31,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245823860] [2020-02-10 20:33:31,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:31,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:31,935 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:33:32,063 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:33:32,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:33:32,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245823860] [2020-02-10 20:33:32,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:32,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:33:32,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758189319] [2020-02-10 20:33:32,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:33:32,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:32,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:33:32,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:33:32,073 INFO L87 Difference]: Start difference. First operand 3119 states and 15565 transitions. Second operand 12 states. [2020-02-10 20:33:32,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:32,282 INFO L93 Difference]: Finished difference Result 5965 states and 26682 transitions. [2020-02-10 20:33:32,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:33:32,282 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:33:32,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:32,297 INFO L225 Difference]: With dead ends: 5965 [2020-02-10 20:33:32,298 INFO L226 Difference]: Without dead ends: 5949 [2020-02-10 20:33:32,298 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:33:32,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5949 states. [2020-02-10 20:33:32,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5949 to 3124. [2020-02-10 20:33:32,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:33:32,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15574 transitions. [2020-02-10 20:33:32,489 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15574 transitions. Word has length 31 [2020-02-10 20:33:32,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:32,490 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15574 transitions. [2020-02-10 20:33:32,490 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:33:32,490 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15574 transitions. [2020-02-10 20:33:32,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:33:32,495 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:32,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:33:32,496 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:33:32,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:32,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1671953214, now seen corresponding path program 340 times [2020-02-10 20:33:32,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:32,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977209261] [2020-02-10 20:33:32,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:32,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:33,037 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:33:33,171 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:33:33,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:33:33,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977209261] [2020-02-10 20:33:33,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:33,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:33:33,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191252764] [2020-02-10 20:33:33,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:33:33,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:33,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:33:33,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:33:33,181 INFO L87 Difference]: Start difference. First operand 3124 states and 15574 transitions. Second operand 12 states. [2020-02-10 20:33:33,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:33,407 INFO L93 Difference]: Finished difference Result 5966 states and 26679 transitions. [2020-02-10 20:33:33,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:33:33,407 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:33:33,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:33,421 INFO L225 Difference]: With dead ends: 5966 [2020-02-10 20:33:33,421 INFO L226 Difference]: Without dead ends: 5944 [2020-02-10 20:33:33,421 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:33:33,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5944 states. [2020-02-10 20:33:33,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5944 to 3119. [2020-02-10 20:33:33,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 20:33:33,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15560 transitions. [2020-02-10 20:33:33,603 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15560 transitions. Word has length 31 [2020-02-10 20:33:33,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:33,603 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15560 transitions. [2020-02-10 20:33:33,603 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:33:33,603 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15560 transitions. [2020-02-10 20:33:33,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:33:33,608 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:33,608 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:33:33,608 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:33:33,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:33,609 INFO L82 PathProgramCache]: Analyzing trace with hash 2092613430, now seen corresponding path program 341 times [2020-02-10 20:33:33,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:33,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473997624] [2020-02-10 20:33:33,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:33,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:34,139 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:33:34,274 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:33:34,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:33:34,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473997624] [2020-02-10 20:33:34,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:34,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:33:34,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063866990] [2020-02-10 20:33:34,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:33:34,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:34,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:33:34,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:33:34,285 INFO L87 Difference]: Start difference. First operand 3119 states and 15560 transitions. Second operand 12 states. [2020-02-10 20:33:34,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:34,545 INFO L93 Difference]: Finished difference Result 5974 states and 26696 transitions. [2020-02-10 20:33:34,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:33:34,545 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:33:34,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:34,559 INFO L225 Difference]: With dead ends: 5974 [2020-02-10 20:33:34,559 INFO L226 Difference]: Without dead ends: 5954 [2020-02-10 20:33:34,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:33:34,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5954 states. [2020-02-10 20:33:34,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5954 to 3125. [2020-02-10 20:33:34,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 20:33:34,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15571 transitions. [2020-02-10 20:33:34,742 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15571 transitions. Word has length 31 [2020-02-10 20:33:34,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:34,742 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15571 transitions. [2020-02-10 20:33:34,742 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:33:34,743 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15571 transitions. [2020-02-10 20:33:34,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:33:34,747 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:34,748 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:33:34,748 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:33:34,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:34,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1247641978, now seen corresponding path program 342 times [2020-02-10 20:33:34,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:34,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984611901] [2020-02-10 20:33:34,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:34,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:35,270 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:33:35,401 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:33:35,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:33:35,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984611901] [2020-02-10 20:33:35,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:35,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:33:35,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473839555] [2020-02-10 20:33:35,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:33:35,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:35,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:33:35,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:33:35,410 INFO L87 Difference]: Start difference. First operand 3125 states and 15571 transitions. Second operand 12 states. [2020-02-10 20:33:35,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:35,715 INFO L93 Difference]: Finished difference Result 5971 states and 26684 transitions. [2020-02-10 20:33:35,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:33:35,716 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:33:35,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:35,731 INFO L225 Difference]: With dead ends: 5971 [2020-02-10 20:33:35,731 INFO L226 Difference]: Without dead ends: 5943 [2020-02-10 20:33:35,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:33:35,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5943 states. [2020-02-10 20:33:35,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5943 to 3114. [2020-02-10 20:33:35,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3114 states. [2020-02-10 20:33:35,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 15546 transitions. [2020-02-10 20:33:35,955 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 15546 transitions. Word has length 31 [2020-02-10 20:33:35,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:35,955 INFO L479 AbstractCegarLoop]: Abstraction has 3114 states and 15546 transitions. [2020-02-10 20:33:35,955 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:33:35,955 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 15546 transitions. [2020-02-10 20:33:35,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:33:35,960 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:35,960 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:33:35,960 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:33:35,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:35,961 INFO L82 PathProgramCache]: Analyzing trace with hash -777506370, now seen corresponding path program 343 times [2020-02-10 20:33:35,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:35,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236840688] [2020-02-10 20:33:35,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:35,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:36,475 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:33:36,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:33:36,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:33:36,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236840688] [2020-02-10 20:33:36,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:36,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:33:36,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157087095] [2020-02-10 20:33:36,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:33:36,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:36,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:33:36,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:33:36,614 INFO L87 Difference]: Start difference. First operand 3114 states and 15546 transitions. Second operand 12 states. [2020-02-10 20:33:36,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:36,844 INFO L93 Difference]: Finished difference Result 5970 states and 26693 transitions. [2020-02-10 20:33:36,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:33:36,844 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:33:36,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:36,859 INFO L225 Difference]: With dead ends: 5970 [2020-02-10 20:33:36,859 INFO L226 Difference]: Without dead ends: 5954 [2020-02-10 20:33:36,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:33:36,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5954 states. [2020-02-10 20:33:37,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5954 to 3124. [2020-02-10 20:33:37,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:33:37,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15574 transitions. [2020-02-10 20:33:37,047 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15574 transitions. Word has length 31 [2020-02-10 20:33:37,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:37,047 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15574 transitions. [2020-02-10 20:33:37,047 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:33:37,047 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15574 transitions. [2020-02-10 20:33:37,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:33:37,052 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:37,052 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:33:37,053 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:33:37,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:37,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1622477822, now seen corresponding path program 344 times [2020-02-10 20:33:37,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:37,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778362544] [2020-02-10 20:33:37,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:37,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:37,574 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:33:37,703 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:33:37,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:33:37,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778362544] [2020-02-10 20:33:37,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:37,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:33:37,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204959840] [2020-02-10 20:33:37,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:33:37,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:37,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:33:37,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:33:37,714 INFO L87 Difference]: Start difference. First operand 3124 states and 15574 transitions. Second operand 12 states. [2020-02-10 20:33:37,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:37,997 INFO L93 Difference]: Finished difference Result 5974 states and 26696 transitions. [2020-02-10 20:33:37,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:33:37,998 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:33:37,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:38,013 INFO L225 Difference]: With dead ends: 5974 [2020-02-10 20:33:38,013 INFO L226 Difference]: Without dead ends: 5949 [2020-02-10 20:33:38,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:33:38,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5949 states. [2020-02-10 20:33:38,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5949 to 3119. [2020-02-10 20:33:38,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 20:33:38,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15560 transitions. [2020-02-10 20:33:38,198 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15560 transitions. Word has length 31 [2020-02-10 20:33:38,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:38,199 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15560 transitions. [2020-02-10 20:33:38,199 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:33:38,199 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15560 transitions. [2020-02-10 20:33:38,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:33:38,204 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:38,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:33:38,204 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:33:38,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:38,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1626128842, now seen corresponding path program 345 times [2020-02-10 20:33:38,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:38,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548136698] [2020-02-10 20:33:38,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:38,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:38,732 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:33:38,865 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:33:38,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:33:38,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548136698] [2020-02-10 20:33:38,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:38,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:33:38,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971385958] [2020-02-10 20:33:38,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:33:38,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:38,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:33:38,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:33:38,876 INFO L87 Difference]: Start difference. First operand 3119 states and 15560 transitions. Second operand 12 states. [2020-02-10 20:33:39,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:39,161 INFO L93 Difference]: Finished difference Result 5968 states and 26684 transitions. [2020-02-10 20:33:39,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:33:39,161 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:33:39,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:39,176 INFO L225 Difference]: With dead ends: 5968 [2020-02-10 20:33:39,176 INFO L226 Difference]: Without dead ends: 5952 [2020-02-10 20:33:39,176 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:33:39,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5952 states. [2020-02-10 20:33:39,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5952 to 3124. [2020-02-10 20:33:39,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:33:39,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15569 transitions. [2020-02-10 20:33:39,360 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15569 transitions. Word has length 31 [2020-02-10 20:33:39,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:39,360 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15569 transitions. [2020-02-10 20:33:39,360 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:33:39,360 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15569 transitions. [2020-02-10 20:33:39,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:33:39,365 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:39,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:33:39,365 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:33:39,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:39,365 INFO L82 PathProgramCache]: Analyzing trace with hash 133924098, now seen corresponding path program 346 times [2020-02-10 20:33:39,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:39,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13617298] [2020-02-10 20:33:39,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:39,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:39,893 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:33:40,025 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:33:40,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:33:40,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13617298] [2020-02-10 20:33:40,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:40,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:33:40,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612586802] [2020-02-10 20:33:40,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:33:40,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:40,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:33:40,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:33:40,035 INFO L87 Difference]: Start difference. First operand 3124 states and 15569 transitions. Second operand 12 states. [2020-02-10 20:33:40,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:40,265 INFO L93 Difference]: Finished difference Result 5970 states and 26683 transitions. [2020-02-10 20:33:40,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:33:40,266 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:33:40,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:40,280 INFO L225 Difference]: With dead ends: 5970 [2020-02-10 20:33:40,280 INFO L226 Difference]: Without dead ends: 5947 [2020-02-10 20:33:40,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:33:40,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5947 states. [2020-02-10 20:33:40,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5947 to 3119. [2020-02-10 20:33:40,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 20:33:40,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15555 transitions. [2020-02-10 20:33:40,462 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15555 transitions. Word has length 31 [2020-02-10 20:33:40,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:40,462 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15555 transitions. [2020-02-10 20:33:40,462 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:33:40,462 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15555 transitions. [2020-02-10 20:33:40,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:33:40,467 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:40,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:33:40,467 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:33:40,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:40,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1399555766, now seen corresponding path program 347 times [2020-02-10 20:33:40,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:40,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747317631] [2020-02-10 20:33:40,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:40,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:40,991 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:33:41,122 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:33:41,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:33:41,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747317631] [2020-02-10 20:33:41,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:41,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:33:41,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171493610] [2020-02-10 20:33:41,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:33:41,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:41,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:33:41,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:33:41,131 INFO L87 Difference]: Start difference. First operand 3119 states and 15555 transitions. Second operand 12 states. [2020-02-10 20:33:41,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:41,375 INFO L93 Difference]: Finished difference Result 5978 states and 26701 transitions. [2020-02-10 20:33:41,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:33:41,375 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:33:41,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:41,389 INFO L225 Difference]: With dead ends: 5978 [2020-02-10 20:33:41,389 INFO L226 Difference]: Without dead ends: 5958 [2020-02-10 20:33:41,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:33:41,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5958 states. [2020-02-10 20:33:41,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5958 to 3126. [2020-02-10 20:33:41,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 20:33:41,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15568 transitions. [2020-02-10 20:33:41,573 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15568 transitions. Word has length 31 [2020-02-10 20:33:41,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:41,573 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15568 transitions. [2020-02-10 20:33:41,573 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:33:41,573 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15568 transitions. [2020-02-10 20:33:41,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:33:41,578 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:41,578 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:33:41,578 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:33:41,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:41,578 INFO L82 PathProgramCache]: Analyzing trace with hash -290387138, now seen corresponding path program 348 times [2020-02-10 20:33:41,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:41,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724005881] [2020-02-10 20:33:41,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:41,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:42,113 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:33:42,244 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:33:42,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:33:42,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724005881] [2020-02-10 20:33:42,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:42,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:33:42,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944173877] [2020-02-10 20:33:42,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:33:42,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:42,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:33:42,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:33:42,253 INFO L87 Difference]: Start difference. First operand 3126 states and 15568 transitions. Second operand 12 states. [2020-02-10 20:33:42,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:42,496 INFO L93 Difference]: Finished difference Result 5976 states and 26690 transitions. [2020-02-10 20:33:42,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:33:42,497 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:33:42,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:42,511 INFO L225 Difference]: With dead ends: 5976 [2020-02-10 20:33:42,511 INFO L226 Difference]: Without dead ends: 5946 [2020-02-10 20:33:42,511 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:33:42,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5946 states. [2020-02-10 20:33:42,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5946 to 3114. [2020-02-10 20:33:42,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3114 states. [2020-02-10 20:33:42,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 15541 transitions. [2020-02-10 20:33:42,694 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 15541 transitions. Word has length 31 [2020-02-10 20:33:42,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:42,694 INFO L479 AbstractCegarLoop]: Abstraction has 3114 states and 15541 transitions. [2020-02-10 20:33:42,694 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:33:42,694 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 15541 transitions. [2020-02-10 20:33:42,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:33:42,699 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33: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:33:42,699 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:33:42,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:42,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1470564034, now seen corresponding path program 349 times [2020-02-10 20:33:42,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:42,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472132050] [2020-02-10 20:33:42,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:42,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:43,171 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 30 [2020-02-10 20:33:43,296 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:33:43,429 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:33:43,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:33:43,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472132050] [2020-02-10 20:33:43,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:43,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:33:43,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497214715] [2020-02-10 20:33:43,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:33:43,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:43,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:33:43,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:33:43,438 INFO L87 Difference]: Start difference. First operand 3114 states and 15541 transitions. Second operand 12 states. [2020-02-10 20:33:43,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:43,730 INFO L93 Difference]: Finished difference Result 5963 states and 26673 transitions. [2020-02-10 20:33:43,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:33:43,731 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:33:43,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:43,746 INFO L225 Difference]: With dead ends: 5963 [2020-02-10 20:33:43,746 INFO L226 Difference]: Without dead ends: 5947 [2020-02-10 20:33:43,746 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:33:43,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5947 states. [2020-02-10 20:33:43,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5947 to 3124. [2020-02-10 20:33:43,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:33:43,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15569 transitions. [2020-02-10 20:33:43,929 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15569 transitions. Word has length 31 [2020-02-10 20:33:43,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:43,930 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15569 transitions. [2020-02-10 20:33:43,930 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:33:43,930 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15569 transitions. [2020-02-10 20:33:43,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:33:43,935 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:43,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:33:43,935 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:33:43,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:43,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1134460358, now seen corresponding path program 350 times [2020-02-10 20:33:43,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:43,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920299010] [2020-02-10 20:33:43,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:43,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:44,474 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:33:44,604 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:33:44,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:33:44,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920299010] [2020-02-10 20:33:44,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:44,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:33:44,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102465639] [2020-02-10 20:33:44,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:33:44,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:44,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:33:44,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:33:44,614 INFO L87 Difference]: Start difference. First operand 3124 states and 15569 transitions. Second operand 12 states. [2020-02-10 20:33:44,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:44,892 INFO L93 Difference]: Finished difference Result 5964 states and 26670 transitions. [2020-02-10 20:33:44,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:33:44,892 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:33:44,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:44,908 INFO L225 Difference]: With dead ends: 5964 [2020-02-10 20:33:44,908 INFO L226 Difference]: Without dead ends: 5942 [2020-02-10 20:33:44,908 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:33:45,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5942 states. [2020-02-10 20:33:45,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5942 to 3119. [2020-02-10 20:33:45,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 20:33:45,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15555 transitions. [2020-02-10 20:33:45,091 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15555 transitions. Word has length 31 [2020-02-10 20:33:45,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:45,091 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15555 transitions. [2020-02-10 20:33:45,091 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:33:45,091 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15555 transitions. [2020-02-10 20:33:45,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:33:45,096 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:45,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:33:45,097 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:33:45,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:45,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1894875270, now seen corresponding path program 351 times [2020-02-10 20:33:45,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:45,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772149715] [2020-02-10 20:33:45,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:45,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:45,657 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:33:45,790 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:33:45,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:33:45,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772149715] [2020-02-10 20:33:45,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:45,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:33:45,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617806266] [2020-02-10 20:33:45,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:33:45,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:45,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:33:45,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:33:45,800 INFO L87 Difference]: Start difference. First operand 3119 states and 15555 transitions. Second operand 12 states. [2020-02-10 20:33:46,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:46,062 INFO L93 Difference]: Finished difference Result 5964 states and 26670 transitions. [2020-02-10 20:33:46,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:33:46,063 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:33:46,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:46,076 INFO L225 Difference]: With dead ends: 5964 [2020-02-10 20:33:46,077 INFO L226 Difference]: Without dead ends: 5948 [2020-02-10 20:33:46,077 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:33:46,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5948 states. [2020-02-10 20:33:46,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5948 to 3124. [2020-02-10 20:33:46,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:33:46,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15564 transitions. [2020-02-10 20:33:46,260 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15564 transitions. Word has length 31 [2020-02-10 20:33:46,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:46,260 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15564 transitions. [2020-02-10 20:33:46,260 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:33:46,260 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15564 transitions. [2020-02-10 20:33:46,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:33:46,265 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:46,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:33:46,265 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:33:46,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:46,266 INFO L82 PathProgramCache]: Analyzing trace with hash -134822330, now seen corresponding path program 352 times [2020-02-10 20:33:46,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:46,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244247293] [2020-02-10 20:33:46,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:46,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:46,934 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:33:46,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:33:46,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244247293] [2020-02-10 20:33:46,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:46,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:33:46,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034125645] [2020-02-10 20:33:46,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:33:46,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:46,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:33:46,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:33:46,944 INFO L87 Difference]: Start difference. First operand 3124 states and 15564 transitions. Second operand 12 states. [2020-02-10 20:33:47,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:47,299 INFO L93 Difference]: Finished difference Result 5966 states and 26669 transitions. [2020-02-10 20:33:47,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:33:47,299 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:33:47,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:47,314 INFO L225 Difference]: With dead ends: 5966 [2020-02-10 20:33:47,314 INFO L226 Difference]: Without dead ends: 5943 [2020-02-10 20:33:47,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:33:47,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5943 states. [2020-02-10 20:33:47,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5943 to 3119. [2020-02-10 20:33:47,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 20:33:47,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15550 transitions. [2020-02-10 20:33:47,497 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15550 transitions. Word has length 31 [2020-02-10 20:33:47,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:47,498 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15550 transitions. [2020-02-10 20:33:47,498 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:33:47,498 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15550 transitions. [2020-02-10 20:33:47,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:33:47,503 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:47,503 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:33:47,503 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:33:47,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:47,503 INFO L82 PathProgramCache]: Analyzing trace with hash -138473350, now seen corresponding path program 353 times [2020-02-10 20:33:47,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:47,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196089033] [2020-02-10 20:33:47,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:47,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:48,057 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:33:48,189 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:33:48,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:33:48,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196089033] [2020-02-10 20:33:48,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:48,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:33:48,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212737209] [2020-02-10 20:33:48,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:33:48,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:48,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:33:48,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:33:48,199 INFO L87 Difference]: Start difference. First operand 3119 states and 15550 transitions. Second operand 12 states. [2020-02-10 20:33:48,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:48,451 INFO L93 Difference]: Finished difference Result 5967 states and 26672 transitions. [2020-02-10 20:33:48,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:33:48,452 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:33:48,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:48,467 INFO L225 Difference]: With dead ends: 5967 [2020-02-10 20:33:48,467 INFO L226 Difference]: Without dead ends: 5950 [2020-02-10 20:33:48,467 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:33:48,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5950 states. [2020-02-10 20:33:48,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5950 to 3125. [2020-02-10 20:33:48,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 20:33:48,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15561 transitions. [2020-02-10 20:33:48,654 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15561 transitions. Word has length 31 [2020-02-10 20:33:48,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:48,655 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15561 transitions. [2020-02-10 20:33:48,655 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:33:48,655 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15561 transitions. [2020-02-10 20:33:48,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:33:48,660 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:48,660 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:33:48,660 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:33:48,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:48,660 INFO L82 PathProgramCache]: Analyzing trace with hash -983444802, now seen corresponding path program 354 times [2020-02-10 20:33:48,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:48,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640689967] [2020-02-10 20:33:48,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:48,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:49,203 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:33:49,334 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:33:49,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:33:49,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640689967] [2020-02-10 20:33:49,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:49,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:33:49,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847123166] [2020-02-10 20:33:49,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:33:49,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:49,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:33:49,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:33:49,344 INFO L87 Difference]: Start difference. First operand 3125 states and 15561 transitions. Second operand 12 states. [2020-02-10 20:33:49,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:49,702 INFO L93 Difference]: Finished difference Result 5968 states and 26668 transitions. [2020-02-10 20:33:49,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:33:49,703 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:33:49,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:49,718 INFO L225 Difference]: With dead ends: 5968 [2020-02-10 20:33:49,718 INFO L226 Difference]: Without dead ends: 5939 [2020-02-10 20:33:49,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:33:49,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5939 states. [2020-02-10 20:33:49,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5939 to 3114. [2020-02-10 20:33:49,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3114 states. [2020-02-10 20:33:49,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 15536 transitions. [2020-02-10 20:33:49,907 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 15536 transitions. Word has length 31 [2020-02-10 20:33:49,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:49,907 INFO L479 AbstractCegarLoop]: Abstraction has 3114 states and 15536 transitions. [2020-02-10 20:33:49,907 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:33:49,907 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 15536 transitions. [2020-02-10 20:33:49,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:33:49,912 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:49,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:33:49,912 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:33:49,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:49,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1286374146, now seen corresponding path program 355 times [2020-02-10 20:33:49,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:49,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234453876] [2020-02-10 20:33:49,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:49,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:50,428 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:33:50,562 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:33:50,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:33:50,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234453876] [2020-02-10 20:33:50,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:50,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:33:50,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133357813] [2020-02-10 20:33:50,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:33:50,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:50,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:33:50,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:33:50,571 INFO L87 Difference]: Start difference. First operand 3114 states and 15536 transitions. Second operand 12 states. [2020-02-10 20:33:50,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:50,958 INFO L93 Difference]: Finished difference Result 5980 states and 26708 transitions. [2020-02-10 20:33:50,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:33:50,959 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:33:50,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:50,974 INFO L225 Difference]: With dead ends: 5980 [2020-02-10 20:33:50,974 INFO L226 Difference]: Without dead ends: 5960 [2020-02-10 20:33:50,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:33:51,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5960 states. [2020-02-10 20:33:51,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5960 to 3126. [2020-02-10 20:33:51,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 20:33:51,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15570 transitions. [2020-02-10 20:33:51,157 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15570 transitions. Word has length 31 [2020-02-10 20:33:51,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:51,158 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15570 transitions. [2020-02-10 20:33:51,158 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:33:51,158 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15570 transitions. [2020-02-10 20:33:51,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:33:51,163 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:51,163 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:33:51,163 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:33:51,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:51,163 INFO L82 PathProgramCache]: Analyzing trace with hash 441402694, now seen corresponding path program 356 times [2020-02-10 20:33:51,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:51,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588100829] [2020-02-10 20:33:51,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:51,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:51,689 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:33:51,816 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:33:51,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:33:51,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588100829] [2020-02-10 20:33:51,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:51,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:33:51,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040670012] [2020-02-10 20:33:51,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:33:51,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:51,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:33:51,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:33:51,826 INFO L87 Difference]: Start difference. First operand 3126 states and 15570 transitions. Second operand 12 states. [2020-02-10 20:33:52,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:52,085 INFO L93 Difference]: Finished difference Result 5977 states and 26696 transitions. [2020-02-10 20:33:52,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:33:52,085 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:33:52,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:52,100 INFO L225 Difference]: With dead ends: 5977 [2020-02-10 20:33:52,101 INFO L226 Difference]: Without dead ends: 5954 [2020-02-10 20:33:52,101 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:33:52,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5954 states. [2020-02-10 20:33:52,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5954 to 3120. [2020-02-10 20:33:52,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3120 states. [2020-02-10 20:33:52,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 15553 transitions. [2020-02-10 20:33:52,282 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 15553 transitions. Word has length 31 [2020-02-10 20:33:52,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:52,282 INFO L479 AbstractCegarLoop]: Abstraction has 3120 states and 15553 transitions. [2020-02-10 20:33:52,282 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:33:52,282 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 15553 transitions. [2020-02-10 20:33:52,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:33:52,287 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:52,287 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:33:52,287 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:33:52,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:52,287 INFO L82 PathProgramCache]: Analyzing trace with hash 862062910, now seen corresponding path program 357 times [2020-02-10 20:33:52,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:52,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468352452] [2020-02-10 20:33:52,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:52,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:52,834 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:33:52,963 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:33:52,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:33:52,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468352452] [2020-02-10 20:33:52,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:52,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:33:52,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779847552] [2020-02-10 20:33:52,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:33:52,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:52,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:33:52,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:33:52,973 INFO L87 Difference]: Start difference. First operand 3120 states and 15553 transitions. Second operand 12 states. [2020-02-10 20:33:53,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:53,177 INFO L93 Difference]: Finished difference Result 5982 states and 26707 transitions. [2020-02-10 20:33:53,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:33:53,178 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:33:53,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:53,193 INFO L225 Difference]: With dead ends: 5982 [2020-02-10 20:33:53,193 INFO L226 Difference]: Without dead ends: 5962 [2020-02-10 20:33:53,193 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:33:53,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5962 states. [2020-02-10 20:33:53,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5962 to 3127. [2020-02-10 20:33:53,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:33:53,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15566 transitions. [2020-02-10 20:33:53,374 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15566 transitions. Word has length 31 [2020-02-10 20:33:53,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:53,374 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15566 transitions. [2020-02-10 20:33:53,375 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:33:53,375 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15566 transitions. [2020-02-10 20:33:53,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:33:53,380 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:53,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:33:53,380 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:33:53,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:53,380 INFO L82 PathProgramCache]: Analyzing trace with hash -827879994, now seen corresponding path program 358 times [2020-02-10 20:33:53,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:53,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123477922] [2020-02-10 20:33:53,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:53,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:53,907 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:33:54,039 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:33:54,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:33:54,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123477922] [2020-02-10 20:33:54,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:54,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:33:54,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202032522] [2020-02-10 20:33:54,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:33:54,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:54,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:33:54,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:33:54,049 INFO L87 Difference]: Start difference. First operand 3127 states and 15566 transitions. Second operand 12 states. [2020-02-10 20:33:54,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:54,289 INFO L93 Difference]: Finished difference Result 5980 states and 26696 transitions. [2020-02-10 20:33:54,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:33:54,290 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:33:54,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:54,304 INFO L225 Difference]: With dead ends: 5980 [2020-02-10 20:33:54,304 INFO L226 Difference]: Without dead ends: 5955 [2020-02-10 20:33:54,304 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:33:54,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5955 states. [2020-02-10 20:33:54,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5955 to 3120. [2020-02-10 20:33:54,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3120 states. [2020-02-10 20:33:54,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 15547 transitions. [2020-02-10 20:33:54,493 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 15547 transitions. Word has length 31 [2020-02-10 20:33:54,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:54,493 INFO L479 AbstractCegarLoop]: Abstraction has 3120 states and 15547 transitions. [2020-02-10 20:33:54,493 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:33:54,493 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 15547 transitions. [2020-02-10 20:33:54,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:33:54,498 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:54,498 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:33:54,498 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:33:54,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:54,499 INFO L82 PathProgramCache]: Analyzing trace with hash -407219778, now seen corresponding path program 359 times [2020-02-10 20:33:54,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:54,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436309954] [2020-02-10 20:33:54,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:54,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33: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:33:55,185 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:33:55,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:33:55,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436309954] [2020-02-10 20:33:55,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:55,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:33:55,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333717] [2020-02-10 20:33:55,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:33:55,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:55,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:33:55,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:33:55,195 INFO L87 Difference]: Start difference. First operand 3120 states and 15547 transitions. Second operand 12 states. [2020-02-10 20:33:55,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:55,413 INFO L93 Difference]: Finished difference Result 5975 states and 26686 transitions. [2020-02-10 20:33:55,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:33:55,413 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:33:55,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:55,429 INFO L225 Difference]: With dead ends: 5975 [2020-02-10 20:33:55,429 INFO L226 Difference]: Without dead ends: 5958 [2020-02-10 20:33:55,429 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:33:55,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5958 states. [2020-02-10 20:33:55,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5958 to 3126. [2020-02-10 20:33:55,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 20:33:55,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15558 transitions. [2020-02-10 20:33:55,614 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15558 transitions. Word has length 31 [2020-02-10 20:33:55,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:55,614 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15558 transitions. [2020-02-10 20:33:55,614 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:33:55,614 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15558 transitions. [2020-02-10 20:33:55,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:33:55,619 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:55,619 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:33:55,619 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:33:55,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:55,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1252191230, now seen corresponding path program 360 times [2020-02-10 20:33:55,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:55,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587498034] [2020-02-10 20:33:55,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:55,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:56,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:33:56,299 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:33:56,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:33:56,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587498034] [2020-02-10 20:33:56,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:56,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:33:56,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879612399] [2020-02-10 20:33:56,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:33:56,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:56,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:33:56,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:33:56,309 INFO L87 Difference]: Start difference. First operand 3126 states and 15558 transitions. Second operand 12 states. [2020-02-10 20:33:56,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:56,531 INFO L93 Difference]: Finished difference Result 5976 states and 26682 transitions. [2020-02-10 20:33:56,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:33:56,532 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:33:56,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:56,547 INFO L225 Difference]: With dead ends: 5976 [2020-02-10 20:33:56,547 INFO L226 Difference]: Without dead ends: 5936 [2020-02-10 20:33:56,547 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:33:56,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5936 states. [2020-02-10 20:33:56,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5936 to 3104. [2020-02-10 20:33:56,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3104 states. [2020-02-10 20:33:56,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3104 states to 3104 states and 15513 transitions. [2020-02-10 20:33:56,734 INFO L78 Accepts]: Start accepts. Automaton has 3104 states and 15513 transitions. Word has length 31 [2020-02-10 20:33:56,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:56,734 INFO L479 AbstractCegarLoop]: Abstraction has 3104 states and 15513 transitions. [2020-02-10 20:33:56,734 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:33:56,734 INFO L276 IsEmpty]: Start isEmpty. Operand 3104 states and 15513 transitions. [2020-02-10 20:33:56,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:33:56,739 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:56,739 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:33:56,739 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:33:56,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:56,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1612839400, now seen corresponding path program 361 times [2020-02-10 20:33:56,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:56,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451840450] [2020-02-10 20:33:56,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:56,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:57,281 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:33:57,416 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:33:57,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:33:57,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451840450] [2020-02-10 20:33:57,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:57,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:33:57,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153278997] [2020-02-10 20:33:57,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:33:57,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:57,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:33:57,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:33:57,427 INFO L87 Difference]: Start difference. First operand 3104 states and 15513 transitions. Second operand 12 states. [2020-02-10 20:33:57,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:57,660 INFO L93 Difference]: Finished difference Result 6011 states and 26822 transitions. [2020-02-10 20:33:57,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:33:57,661 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:33:57,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:57,676 INFO L225 Difference]: With dead ends: 6011 [2020-02-10 20:33:57,676 INFO L226 Difference]: Without dead ends: 5992 [2020-02-10 20:33:57,677 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:33:57,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5992 states. [2020-02-10 20:33:57,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5992 to 3127. [2020-02-10 20:33:57,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:33:57,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15606 transitions. [2020-02-10 20:33:57,865 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15606 transitions. Word has length 31 [2020-02-10 20:33:57,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:57,865 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15606 transitions. [2020-02-10 20:33:57,865 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:33:57,865 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15606 transitions. [2020-02-10 20:33:57,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:33:57,870 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:57,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:33:57,871 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:33:57,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:57,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1190353674, now seen corresponding path program 362 times [2020-02-10 20:33:57,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:57,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485822606] [2020-02-10 20:33:57,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:57,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:58,322 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 30 [2020-02-10 20:33:58,449 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:33:58,583 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:33:58,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:33:58,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485822606] [2020-02-10 20:33:58,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:58,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:33:58,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129625408] [2020-02-10 20:33:58,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:33:58,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:58,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:33:58,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:33:58,594 INFO L87 Difference]: Start difference. First operand 3127 states and 15606 transitions. Second operand 12 states. [2020-02-10 20:33:58,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:58,817 INFO L93 Difference]: Finished difference Result 6008 states and 26811 transitions. [2020-02-10 20:33:58,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:33:58,818 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:33:58,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:58,833 INFO L225 Difference]: With dead ends: 6008 [2020-02-10 20:33:58,833 INFO L226 Difference]: Without dead ends: 5987 [2020-02-10 20:33:58,834 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:33:58,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5987 states. [2020-02-10 20:33:59,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5987 to 3122. [2020-02-10 20:33:59,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-02-10 20:33:59,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15592 transitions. [2020-02-10 20:33:59,016 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15592 transitions. Word has length 31 [2020-02-10 20:33:59,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:33:59,017 INFO L479 AbstractCegarLoop]: Abstraction has 3122 states and 15592 transitions. [2020-02-10 20:33:59,017 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:33:59,017 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15592 transitions. [2020-02-10 20:33:59,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:33:59,022 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:33:59,022 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:33:59,022 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:33:59,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:33:59,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1188528164, now seen corresponding path program 363 times [2020-02-10 20:33:59,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:33:59,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865406541] [2020-02-10 20:33:59,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:33:59,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:33:59,567 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:33:59,696 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:33:59,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:33:59,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865406541] [2020-02-10 20:33:59,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:33:59,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:33:59,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816403478] [2020-02-10 20:33:59,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:33:59,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:33:59,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:33:59,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:33:59,706 INFO L87 Difference]: Start difference. First operand 3122 states and 15592 transitions. Second operand 12 states. [2020-02-10 20:33:59,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:33:59,947 INFO L93 Difference]: Finished difference Result 6018 states and 26834 transitions. [2020-02-10 20:33:59,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:33:59,948 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:33:59,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:33:59,962 INFO L225 Difference]: With dead ends: 6018 [2020-02-10 20:33:59,963 INFO L226 Difference]: Without dead ends: 5999 [2020-02-10 20:33:59,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:34:00,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5999 states. [2020-02-10 20:34:00,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5999 to 3130. [2020-02-10 20:34:00,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 20:34:00,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15607 transitions. [2020-02-10 20:34:00,149 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15607 transitions. Word has length 31 [2020-02-10 20:34:00,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:00,150 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15607 transitions. [2020-02-10 20:34:00,150 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:34:00,150 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15607 transitions. [2020-02-10 20:34:00,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:34:00,155 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:00,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:34:00,155 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:34:00,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:00,155 INFO L82 PathProgramCache]: Analyzing trace with hash -78929014, now seen corresponding path program 364 times [2020-02-10 20:34:00,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:00,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731428143] [2020-02-10 20:34:00,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:00,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:00,701 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:34:00,832 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:34:00,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:34:00,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731428143] [2020-02-10 20:34:00,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:00,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:34:00,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738577916] [2020-02-10 20:34:00,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:34:00,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:00,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:34:00,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:34:00,841 INFO L87 Difference]: Start difference. First operand 3130 states and 15607 transitions. Second operand 12 states. [2020-02-10 20:34:01,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:01,075 INFO L93 Difference]: Finished difference Result 6019 states and 26828 transitions. [2020-02-10 20:34:01,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:34:01,075 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:34:01,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:01,089 INFO L225 Difference]: With dead ends: 6019 [2020-02-10 20:34:01,089 INFO L226 Difference]: Without dead ends: 5991 [2020-02-10 20:34:01,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 20:34:01,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5991 states. [2020-02-10 20:34:01,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5991 to 3122. [2020-02-10 20:34:01,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-02-10 20:34:01,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15587 transitions. [2020-02-10 20:34:01,272 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15587 transitions. Word has length 31 [2020-02-10 20:34:01,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:01,272 INFO L479 AbstractCegarLoop]: Abstraction has 3122 states and 15587 transitions. [2020-02-10 20:34:01,273 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:34:01,273 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15587 transitions. [2020-02-10 20:34:01,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:34:01,278 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:01,278 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:34:01,278 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:34:01,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:01,278 INFO L82 PathProgramCache]: Analyzing trace with hash 553886820, now seen corresponding path program 365 times [2020-02-10 20:34:01,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:01,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152861491] [2020-02-10 20:34:01,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:01,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:01,797 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:34:01,931 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:34:01,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:34:01,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152861491] [2020-02-10 20:34:01,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:01,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:34:01,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939218659] [2020-02-10 20:34:01,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:34:01,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:01,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:34:01,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:34:01,941 INFO L87 Difference]: Start difference. First operand 3122 states and 15587 transitions. Second operand 12 states. [2020-02-10 20:34:02,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:02,168 INFO L93 Difference]: Finished difference Result 6009 states and 26808 transitions. [2020-02-10 20:34:02,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:34:02,169 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:34:02,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:02,184 INFO L225 Difference]: With dead ends: 6009 [2020-02-10 20:34:02,184 INFO L226 Difference]: Without dead ends: 5993 [2020-02-10 20:34:02,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:34:02,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5993 states. [2020-02-10 20:34:02,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5993 to 3127. [2020-02-10 20:34:02,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:34:02,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15596 transitions. [2020-02-10 20:34:02,367 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15596 transitions. Word has length 31 [2020-02-10 20:34:02,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:02,367 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15596 transitions. [2020-02-10 20:34:02,367 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:34:02,367 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15596 transitions. [2020-02-10 20:34:02,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:34:02,372 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:02,372 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:34:02,372 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:34:02,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:02,373 INFO L82 PathProgramCache]: Analyzing trace with hash -291084632, now seen corresponding path program 366 times [2020-02-10 20:34:02,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:02,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412366007] [2020-02-10 20:34:02,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:02,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:02,897 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:34:03,025 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:34:03,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:34:03,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412366007] [2020-02-10 20:34:03,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:03,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:34:03,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755781431] [2020-02-10 20:34:03,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:34:03,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:03,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:34:03,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:34:03,035 INFO L87 Difference]: Start difference. First operand 3127 states and 15596 transitions. Second operand 12 states. [2020-02-10 20:34:03,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:03,308 INFO L93 Difference]: Finished difference Result 6013 states and 26811 transitions. [2020-02-10 20:34:03,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:34:03,308 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:34:03,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:03,322 INFO L225 Difference]: With dead ends: 6013 [2020-02-10 20:34:03,323 INFO L226 Difference]: Without dead ends: 5983 [2020-02-10 20:34:03,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:34:03,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5983 states. [2020-02-10 20:34:03,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5983 to 3117. [2020-02-10 20:34:03,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3117 states. [2020-02-10 20:34:03,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3117 states to 3117 states and 15573 transitions. [2020-02-10 20:34:03,512 INFO L78 Accepts]: Start accepts. Automaton has 3117 states and 15573 transitions. Word has length 31 [2020-02-10 20:34:03,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:03,512 INFO L479 AbstractCegarLoop]: Abstraction has 3117 states and 15573 transitions. [2020-02-10 20:34:03,512 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:34:03,512 INFO L276 IsEmpty]: Start isEmpty. Operand 3117 states and 15573 transitions. [2020-02-10 20:34:03,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:34:03,517 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:03,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:34:03,517 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:34:03,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:03,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1344092972, now seen corresponding path program 367 times [2020-02-10 20:34:03,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:03,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117436190] [2020-02-10 20:34:03,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:03,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:04,042 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:34:04,172 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:34:04,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:34:04,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117436190] [2020-02-10 20:34:04,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:04,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:34:04,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759754962] [2020-02-10 20:34:04,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:34:04,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:04,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:34:04,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:34:04,181 INFO L87 Difference]: Start difference. First operand 3117 states and 15573 transitions. Second operand 12 states. [2020-02-10 20:34:04,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:04,413 INFO L93 Difference]: Finished difference Result 6006 states and 26805 transitions. [2020-02-10 20:34:04,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:34:04,413 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:34:04,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:04,428 INFO L225 Difference]: With dead ends: 6006 [2020-02-10 20:34:04,428 INFO L226 Difference]: Without dead ends: 5987 [2020-02-10 20:34:04,428 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:34:04,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5987 states. [2020-02-10 20:34:04,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5987 to 3127. [2020-02-10 20:34:04,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:34:04,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15601 transitions. [2020-02-10 20:34:04,617 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15601 transitions. Word has length 31 [2020-02-10 20:34:04,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:04,618 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15601 transitions. [2020-02-10 20:34:04,618 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:34:04,618 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15601 transitions. [2020-02-10 20:34:04,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:34:04,623 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:04,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:34:04,623 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:34:04,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:04,623 INFO L82 PathProgramCache]: Analyzing trace with hash 921607246, now seen corresponding path program 368 times [2020-02-10 20:34:04,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:04,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183237087] [2020-02-10 20:34:04,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:04,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:05,167 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:34:05,304 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:34:05,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:34:05,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183237087] [2020-02-10 20:34:05,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:05,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:34:05,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952730071] [2020-02-10 20:34:05,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:34:05,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:05,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:34:05,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:34:05,314 INFO L87 Difference]: Start difference. First operand 3127 states and 15601 transitions. Second operand 12 states. [2020-02-10 20:34:05,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:05,545 INFO L93 Difference]: Finished difference Result 6003 states and 26794 transitions. [2020-02-10 20:34:05,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:34:05,546 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:34:05,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:05,560 INFO L225 Difference]: With dead ends: 6003 [2020-02-10 20:34:05,561 INFO L226 Difference]: Without dead ends: 5982 [2020-02-10 20:34:05,561 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:34:05,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5982 states. [2020-02-10 20:34:05,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5982 to 3122. [2020-02-10 20:34:05,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-02-10 20:34:05,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15587 transitions. [2020-02-10 20:34:05,794 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15587 transitions. Word has length 31 [2020-02-10 20:34:05,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:05,794 INFO L479 AbstractCegarLoop]: Abstraction has 3122 states and 15587 transitions. [2020-02-10 20:34:05,794 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:34:05,794 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15587 transitions. [2020-02-10 20:34:05,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:34:05,799 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:05,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:34:05,799 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:34:05,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:05,800 INFO L82 PathProgramCache]: Analyzing trace with hash 495470500, now seen corresponding path program 369 times [2020-02-10 20:34:05,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:05,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477938990] [2020-02-10 20:34:05,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:05,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:06,331 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:34:06,458 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:34:06,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:34:06,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477938990] [2020-02-10 20:34:06,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:06,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:34:06,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946328384] [2020-02-10 20:34:06,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:34:06,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:06,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:34:06,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:34:06,469 INFO L87 Difference]: Start difference. First operand 3122 states and 15587 transitions. Second operand 12 states. [2020-02-10 20:34:06,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:06,700 INFO L93 Difference]: Finished difference Result 6008 states and 26805 transitions. [2020-02-10 20:34:06,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:34:06,700 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:34:06,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:06,715 INFO L225 Difference]: With dead ends: 6008 [2020-02-10 20:34:06,716 INFO L226 Difference]: Without dead ends: 5989 [2020-02-10 20:34:06,716 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:34:06,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5989 states. [2020-02-10 20:34:06,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5989 to 3128. [2020-02-10 20:34:06,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 20:34:06,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15598 transitions. [2020-02-10 20:34:06,903 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15598 transitions. Word has length 31 [2020-02-10 20:34:06,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:06,903 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15598 transitions. [2020-02-10 20:34:06,903 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:34:06,903 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15598 transitions. [2020-02-10 20:34:06,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:34:06,908 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:06,908 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:34:06,908 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:34:06,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:06,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1616958130, now seen corresponding path program 370 times [2020-02-10 20:34:06,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:06,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144489765] [2020-02-10 20:34:06,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:06,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:07,445 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:34:07,576 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:34:07,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:34:07,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144489765] [2020-02-10 20:34:07,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:07,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:34:07,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107826426] [2020-02-10 20:34:07,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:34:07,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:07,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:34:07,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:34:07,587 INFO L87 Difference]: Start difference. First operand 3128 states and 15598 transitions. Second operand 12 states. [2020-02-10 20:34:07,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:07,838 INFO L93 Difference]: Finished difference Result 6006 states and 26795 transitions. [2020-02-10 20:34:07,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:34:07,839 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:34:07,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:07,853 INFO L225 Difference]: With dead ends: 6006 [2020-02-10 20:34:07,854 INFO L226 Difference]: Without dead ends: 5983 [2020-02-10 20:34:07,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:34:07,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5983 states. [2020-02-10 20:34:08,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5983 to 3122. [2020-02-10 20:34:08,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-02-10 20:34:08,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15582 transitions. [2020-02-10 20:34:08,040 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15582 transitions. Word has length 31 [2020-02-10 20:34:08,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:08,040 INFO L479 AbstractCegarLoop]: Abstraction has 3122 states and 15582 transitions. [2020-02-10 20:34:08,040 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:34:08,040 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15582 transitions. [2020-02-10 20:34:08,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:34:08,045 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:08,045 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:34:08,045 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:34:08,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:08,046 INFO L82 PathProgramCache]: Analyzing trace with hash -139170844, now seen corresponding path program 371 times [2020-02-10 20:34:08,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:08,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239976490] [2020-02-10 20:34:08,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:08,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:08,593 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:34:08,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 20:34:08,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:34:08,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239976490] [2020-02-10 20:34:08,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:08,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:34:08,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399207548] [2020-02-10 20:34:08,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:34:08,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:08,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:34:08,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:34:08,732 INFO L87 Difference]: Start difference. First operand 3122 states and 15582 transitions. Second operand 12 states. [2020-02-10 20:34:08,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:08,958 INFO L93 Difference]: Finished difference Result 6001 states and 26785 transitions. [2020-02-10 20:34:08,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:34:08,958 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:34:08,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:08,973 INFO L225 Difference]: With dead ends: 6001 [2020-02-10 20:34:08,973 INFO L226 Difference]: Without dead ends: 5985 [2020-02-10 20:34:08,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:34:09,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5985 states. [2020-02-10 20:34:09,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5985 to 3127. [2020-02-10 20:34:09,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:34:09,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15591 transitions. [2020-02-10 20:34:09,156 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15591 transitions. Word has length 31 [2020-02-10 20:34:09,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:09,156 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15591 transitions. [2020-02-10 20:34:09,156 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:34:09,156 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15591 transitions. [2020-02-10 20:34:09,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:34:09,161 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:09,161 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:34:09,162 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:34:09,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:09,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1829113748, now seen corresponding path program 372 times [2020-02-10 20:34:09,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:09,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024093720] [2020-02-10 20:34:09,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:09,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:09,700 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:34:09,833 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:34:09,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:34:09,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024093720] [2020-02-10 20:34:09,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:09,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:34:09,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62876802] [2020-02-10 20:34:09,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:34:09,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:09,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:34:09,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:34:09,842 INFO L87 Difference]: Start difference. First operand 3127 states and 15591 transitions. Second operand 12 states. [2020-02-10 20:34:10,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:10,077 INFO L93 Difference]: Finished difference Result 6002 states and 26782 transitions. [2020-02-10 20:34:10,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:34:10,078 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:34:10,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:10,093 INFO L225 Difference]: With dead ends: 6002 [2020-02-10 20:34:10,093 INFO L226 Difference]: Without dead ends: 5975 [2020-02-10 20:34:10,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:34:10,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5975 states. [2020-02-10 20:34:10,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5975 to 3117. [2020-02-10 20:34:10,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3117 states. [2020-02-10 20:34:10,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3117 states to 3117 states and 15568 transitions. [2020-02-10 20:34:10,275 INFO L78 Accepts]: Start accepts. Automaton has 3117 states and 15568 transitions. Word has length 31 [2020-02-10 20:34:10,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:10,276 INFO L479 AbstractCegarLoop]: Abstraction has 3117 states and 15568 transitions. [2020-02-10 20:34:10,276 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:34:10,276 INFO L276 IsEmpty]: Start isEmpty. Operand 3117 states and 15568 transitions. [2020-02-10 20:34:10,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:34:10,280 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:10,281 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:34:10,281 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:34:10,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:10,281 INFO L82 PathProgramCache]: Analyzing trace with hash 651035308, now seen corresponding path program 373 times [2020-02-10 20:34:10,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:10,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883468592] [2020-02-10 20:34:10,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:10,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:10,826 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:34:10,957 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:34:10,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:34:10,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883468592] [2020-02-10 20:34:10,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:10,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:34:10,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932818675] [2020-02-10 20:34:10,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:34:10,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:10,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:34:10,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:34:10,967 INFO L87 Difference]: Start difference. First operand 3117 states and 15568 transitions. Second operand 12 states. [2020-02-10 20:34:11,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:11,281 INFO L93 Difference]: Finished difference Result 6022 states and 26841 transitions. [2020-02-10 20:34:11,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:34:11,281 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:34:11,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:11,296 INFO L225 Difference]: With dead ends: 6022 [2020-02-10 20:34:11,296 INFO L226 Difference]: Without dead ends: 6003 [2020-02-10 20:34:11,297 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:34:11,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6003 states. [2020-02-10 20:34:11,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6003 to 3131. [2020-02-10 20:34:11,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 20:34:11,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15606 transitions. [2020-02-10 20:34:11,483 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15606 transitions. Word has length 31 [2020-02-10 20:34:11,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:11,484 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15606 transitions. [2020-02-10 20:34:11,484 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:34:11,484 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15606 transitions. [2020-02-10 20:34:11,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:34:11,489 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:11,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:34:11,489 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:34:11,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:11,490 INFO L82 PathProgramCache]: Analyzing trace with hash -616421870, now seen corresponding path program 374 times [2020-02-10 20:34:11,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:11,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369141343] [2020-02-10 20:34:11,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:11,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:12,045 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:34:12,175 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:34:12,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:34:12,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369141343] [2020-02-10 20:34:12,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:12,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:34:12,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836872805] [2020-02-10 20:34:12,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:34:12,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:12,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:34:12,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:34:12,186 INFO L87 Difference]: Start difference. First operand 3131 states and 15606 transitions. Second operand 12 states. [2020-02-10 20:34:12,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:12,429 INFO L93 Difference]: Finished difference Result 6023 states and 26835 transitions. [2020-02-10 20:34:12,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:34:12,429 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:34:12,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:12,444 INFO L225 Difference]: With dead ends: 6023 [2020-02-10 20:34:12,445 INFO L226 Difference]: Without dead ends: 5995 [2020-02-10 20:34:12,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:34:12,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5995 states. [2020-02-10 20:34:12,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5995 to 3123. [2020-02-10 20:34:12,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3123 states. [2020-02-10 20:34:12,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 15585 transitions. [2020-02-10 20:34:12,634 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 15585 transitions. Word has length 31 [2020-02-10 20:34:12,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:12,635 INFO L479 AbstractCegarLoop]: Abstraction has 3123 states and 15585 transitions. [2020-02-10 20:34:12,635 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:34:12,635 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 15585 transitions. [2020-02-10 20:34:12,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:34:12,641 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:12,641 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:34:12,641 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:34:12,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:12,641 INFO L82 PathProgramCache]: Analyzing trace with hash 226724072, now seen corresponding path program 375 times [2020-02-10 20:34:12,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:12,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571067722] [2020-02-10 20:34:12,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:12,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:13,182 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:34:13,310 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:34:13,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:34:13,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571067722] [2020-02-10 20:34:13,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:13,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:34:13,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195159167] [2020-02-10 20:34:13,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:34:13,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:13,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:34:13,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:34:13,320 INFO L87 Difference]: Start difference. First operand 3123 states and 15585 transitions. Second operand 12 states. [2020-02-10 20:34:13,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:13,593 INFO L93 Difference]: Finished difference Result 6017 states and 26823 transitions. [2020-02-10 20:34:13,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:34:13,594 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:34:13,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:13,610 INFO L225 Difference]: With dead ends: 6017 [2020-02-10 20:34:13,610 INFO L226 Difference]: Without dead ends: 5998 [2020-02-10 20:34:13,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:34:13,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5998 states. [2020-02-10 20:34:13,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5998 to 3129. [2020-02-10 20:34:13,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 20:34:13,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15596 transitions. [2020-02-10 20:34:13,797 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15596 transitions. Word has length 31 [2020-02-10 20:34:13,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:13,797 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15596 transitions. [2020-02-10 20:34:13,798 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:34:13,798 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15596 transitions. [2020-02-10 20:34:13,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:34:13,803 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:13,803 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:34:13,803 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:34:13,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:13,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1885704558, now seen corresponding path program 376 times [2020-02-10 20:34:13,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:13,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493046931] [2020-02-10 20:34:13,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:13,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:14,325 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:34:14,454 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:34:14,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:34:14,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493046931] [2020-02-10 20:34:14,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:14,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:34:14,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292524890] [2020-02-10 20:34:14,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:34:14,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:14,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:34:14,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:34:14,464 INFO L87 Difference]: Start difference. First operand 3129 states and 15596 transitions. Second operand 12 states. [2020-02-10 20:34:14,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:14,705 INFO L93 Difference]: Finished difference Result 6015 states and 26813 transitions. [2020-02-10 20:34:14,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:34:14,705 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:34:14,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:14,719 INFO L225 Difference]: With dead ends: 6015 [2020-02-10 20:34:14,719 INFO L226 Difference]: Without dead ends: 5992 [2020-02-10 20:34:14,719 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:34:14,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5992 states. [2020-02-10 20:34:14,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5992 to 3123. [2020-02-10 20:34:14,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3123 states. [2020-02-10 20:34:14,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 15579 transitions. [2020-02-10 20:34:14,909 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 15579 transitions. Word has length 31 [2020-02-10 20:34:14,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:14,909 INFO L479 AbstractCegarLoop]: Abstraction has 3123 states and 15579 transitions. [2020-02-10 20:34:14,909 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:34:14,909 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 15579 transitions. [2020-02-10 20:34:14,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:34:14,914 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:14,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:34:14,914 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:34:14,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:14,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1677199960, now seen corresponding path program 377 times [2020-02-10 20:34:14,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:14,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794101182] [2020-02-10 20:34:14,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:14,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:15,445 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:34:15,576 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:34: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:34:15,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794101182] [2020-02-10 20:34:15,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:15,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:34:15,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902024652] [2020-02-10 20:34:15,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:34:15,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:15,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:34:15,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:34:15,586 INFO L87 Difference]: Start difference. First operand 3123 states and 15579 transitions. Second operand 12 states. [2020-02-10 20:34:15,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:15,822 INFO L93 Difference]: Finished difference Result 6019 states and 26821 transitions. [2020-02-10 20:34:15,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:34:15,823 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:34:15,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:15,838 INFO L225 Difference]: With dead ends: 6019 [2020-02-10 20:34:15,838 INFO L226 Difference]: Without dead ends: 5999 [2020-02-10 20:34:15,838 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:34:15,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5999 states. [2020-02-10 20:34:16,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5999 to 3129. [2020-02-10 20:34:16,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 20:34:16,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15590 transitions. [2020-02-10 20:34:16,022 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15590 transitions. Word has length 31 [2020-02-10 20:34:16,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:16,022 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15590 transitions. [2020-02-10 20:34:16,022 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:34:16,022 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15590 transitions. [2020-02-10 20:34:16,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:34:16,027 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:16,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 20:34:16,027 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:34:16,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:16,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1772795884, now seen corresponding path program 378 times [2020-02-10 20:34:16,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:16,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931366107] [2020-02-10 20:34:16,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:16,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:16,556 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:34:16,685 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:34:16,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:34:16,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931366107] [2020-02-10 20:34:16,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:16,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:34:16,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146299600] [2020-02-10 20:34:16,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:34:16,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:16,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:34:16,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:34:16,695 INFO L87 Difference]: Start difference. First operand 3129 states and 15590 transitions. Second operand 12 states. [2020-02-10 20:34:16,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:16,986 INFO L93 Difference]: Finished difference Result 6016 states and 26809 transitions. [2020-02-10 20:34:16,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:34:16,987 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:34:16,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:17,002 INFO L225 Difference]: With dead ends: 6016 [2020-02-10 20:34:17,002 INFO L226 Difference]: Without dead ends: 5987 [2020-02-10 20:34:17,002 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:34:17,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5987 states. [2020-02-10 20:34:17,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5987 to 3117. [2020-02-10 20:34:17,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3117 states. [2020-02-10 20:34:17,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3117 states to 3117 states and 15563 transitions. [2020-02-10 20:34:17,186 INFO L78 Accepts]: Start accepts. Automaton has 3117 states and 15563 transitions. Word has length 31 [2020-02-10 20:34:17,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:17,186 INFO L479 AbstractCegarLoop]: Abstraction has 3117 states and 15563 transitions. [2020-02-10 20:34:17,186 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:34:17,186 INFO L276 IsEmpty]: Start isEmpty. Operand 3117 states and 15563 transitions. [2020-02-10 20:34:17,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:34:17,191 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:17,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:34:17,191 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:34:17,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:17,191 INFO L82 PathProgramCache]: Analyzing trace with hash 2029504398, now seen corresponding path program 379 times [2020-02-10 20:34:17,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:17,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893156947] [2020-02-10 20:34:17,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:17,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:17,716 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:34:17,847 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:34:17,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:34:17,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893156947] [2020-02-10 20:34:17,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:17,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:34:17,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912041158] [2020-02-10 20:34:17,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:34:17,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:17,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:34:17,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:34:17,857 INFO L87 Difference]: Start difference. First operand 3117 states and 15563 transitions. Second operand 12 states. [2020-02-10 20:34:18,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:18,081 INFO L93 Difference]: Finished difference Result 6005 states and 26793 transitions. [2020-02-10 20:34:18,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:34:18,081 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:34:18,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:18,096 INFO L225 Difference]: With dead ends: 6005 [2020-02-10 20:34:18,096 INFO L226 Difference]: Without dead ends: 5989 [2020-02-10 20:34:18,096 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:34:18,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5989 states. [2020-02-10 20:34:18,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5989 to 3127. [2020-02-10 20:34:18,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:34:18,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15591 transitions. [2020-02-10 20:34:18,282 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15591 transitions. Word has length 31 [2020-02-10 20:34:18,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:18,282 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15591 transitions. [2020-02-10 20:34:18,282 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:34:18,283 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15591 transitions. [2020-02-10 20:34:18,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:34:18,288 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:18,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:34:18,288 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:34:18,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:18,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1184532946, now seen corresponding path program 380 times [2020-02-10 20:34:18,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:18,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555142359] [2020-02-10 20:34:18,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:18,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:18,820 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:34:18,954 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:34:18,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:34:18,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555142359] [2020-02-10 20:34:18,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:18,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:34:18,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792390010] [2020-02-10 20:34:18,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:34:18,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:18,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:34:18,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:34:18,964 INFO L87 Difference]: Start difference. First operand 3127 states and 15591 transitions. Second operand 12 states. [2020-02-10 20:34:19,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:19,188 INFO L93 Difference]: Finished difference Result 6009 states and 26796 transitions. [2020-02-10 20:34:19,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:34:19,189 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:34:19,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:19,204 INFO L225 Difference]: With dead ends: 6009 [2020-02-10 20:34:19,204 INFO L226 Difference]: Without dead ends: 5984 [2020-02-10 20:34:19,204 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:34:19,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5984 states. [2020-02-10 20:34:19,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5984 to 3122. [2020-02-10 20:34:19,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-02-10 20:34:19,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15577 transitions. [2020-02-10 20:34:19,391 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15577 transitions. Word has length 31 [2020-02-10 20:34:19,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:19,391 INFO L479 AbstractCegarLoop]: Abstraction has 3122 states and 15577 transitions. [2020-02-10 20:34:19,392 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:34:19,392 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15577 transitions. [2020-02-10 20:34:19,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:34:19,397 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:19,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:34:19,397 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:34:19,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:19,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1605193162, now seen corresponding path program 381 times [2020-02-10 20:34:19,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:19,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459368364] [2020-02-10 20:34:19,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:19,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:19,940 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:34:20,073 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:34:20,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:34:20,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459368364] [2020-02-10 20:34:20,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:20,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:34:20,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910236746] [2020-02-10 20:34:20,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:34:20,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:20,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:34:20,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:34:20,082 INFO L87 Difference]: Start difference. First operand 3122 states and 15577 transitions. Second operand 12 states. [2020-02-10 20:34:20,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:20,352 INFO L93 Difference]: Finished difference Result 6002 states and 26782 transitions. [2020-02-10 20:34:20,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:34:20,352 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:34:20,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:20,367 INFO L225 Difference]: With dead ends: 6002 [2020-02-10 20:34:20,367 INFO L226 Difference]: Without dead ends: 5986 [2020-02-10 20:34:20,367 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:34:20,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5986 states. [2020-02-10 20:34:20,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5986 to 3127. [2020-02-10 20:34:20,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:34:20,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15586 transitions. [2020-02-10 20:34:20,553 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15586 transitions. Word has length 31 [2020-02-10 20:34:20,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:20,553 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15586 transitions. [2020-02-10 20:34:20,553 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:34:20,553 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15586 transitions. [2020-02-10 20:34:20,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:34:20,558 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:20,559 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:34:20,559 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:34:20,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:20,559 INFO L82 PathProgramCache]: Analyzing trace with hash -84749742, now seen corresponding path program 382 times [2020-02-10 20:34:20,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:20,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695604955] [2020-02-10 20:34:20,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:20,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:21,149 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:34:21,281 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:34:21,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:34:21,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695604955] [2020-02-10 20:34:21,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:21,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:34:21,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653575035] [2020-02-10 20:34:21,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:34:21,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:21,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:34:21,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:34:21,291 INFO L87 Difference]: Start difference. First operand 3127 states and 15586 transitions. Second operand 12 states. [2020-02-10 20:34:21,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:21,541 INFO L93 Difference]: Finished difference Result 6003 states and 26779 transitions. [2020-02-10 20:34:21,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:34:21,542 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:34:21,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:21,557 INFO L225 Difference]: With dead ends: 6003 [2020-02-10 20:34:21,557 INFO L226 Difference]: Without dead ends: 5981 [2020-02-10 20:34:21,557 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:34:21,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5981 states. [2020-02-10 20:34:21,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5981 to 3122. [2020-02-10 20:34:21,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-02-10 20:34:21,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15572 transitions. [2020-02-10 20:34:21,741 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15572 transitions. Word has length 31 [2020-02-10 20:34:21,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:21,741 INFO L479 AbstractCegarLoop]: Abstraction has 3122 states and 15572 transitions. [2020-02-10 20:34:21,741 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:34:21,741 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15572 transitions. [2020-02-10 20:34:21,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:34:21,746 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:21,746 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:34:21,746 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:34:21,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:21,747 INFO L82 PathProgramCache]: Analyzing trace with hash 335910474, now seen corresponding path program 383 times [2020-02-10 20:34:21,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:21,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558505471] [2020-02-10 20:34:21,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:21,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:22,279 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:34:22,411 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:34:22,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:34:22,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558505471] [2020-02-10 20:34:22,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:22,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:34:22,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221880550] [2020-02-10 20:34:22,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:34:22,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:22,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:34:22,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:34:22,420 INFO L87 Difference]: Start difference. First operand 3122 states and 15572 transitions. Second operand 12 states. [2020-02-10 20:34:22,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:22,655 INFO L93 Difference]: Finished difference Result 6011 states and 26796 transitions. [2020-02-10 20:34:22,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:34:22,656 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:34:22,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:22,670 INFO L225 Difference]: With dead ends: 6011 [2020-02-10 20:34:22,670 INFO L226 Difference]: Without dead ends: 5991 [2020-02-10 20:34:22,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:34:22,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5991 states. [2020-02-10 20:34:22,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5991 to 3128. [2020-02-10 20:34:22,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 20:34:22,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15583 transitions. [2020-02-10 20:34:22,858 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15583 transitions. Word has length 31 [2020-02-10 20:34:22,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:22,858 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15583 transitions. [2020-02-10 20:34:22,858 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:34:22,859 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15583 transitions. [2020-02-10 20:34:22,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:34:22,864 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:22,864 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:34:22,864 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:34:22,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:22,864 INFO L82 PathProgramCache]: Analyzing trace with hash -509060978, now seen corresponding path program 384 times [2020-02-10 20:34:22,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:22,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052185032] [2020-02-10 20:34:22,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:22,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:23,398 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:34:23,529 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:34:23,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:34:23,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052185032] [2020-02-10 20:34:23,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:23,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:34:23,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044136311] [2020-02-10 20:34:23,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:34:23,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:23,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:34:23,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:34:23,540 INFO L87 Difference]: Start difference. First operand 3128 states and 15583 transitions. Second operand 12 states. [2020-02-10 20:34:23,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:23,844 INFO L93 Difference]: Finished difference Result 6008 states and 26784 transitions. [2020-02-10 20:34:23,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:34:23,844 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:34:23,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:23,859 INFO L225 Difference]: With dead ends: 6008 [2020-02-10 20:34:23,859 INFO L226 Difference]: Without dead ends: 5975 [2020-02-10 20:34:23,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:34:23,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5975 states. [2020-02-10 20:34:24,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5975 to 3112. [2020-02-10 20:34:24,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3112 states. [2020-02-10 20:34:24,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3112 states to 3112 states and 15549 transitions. [2020-02-10 20:34:24,049 INFO L78 Accepts]: Start accepts. Automaton has 3112 states and 15549 transitions. Word has length 31 [2020-02-10 20:34:24,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:24,049 INFO L479 AbstractCegarLoop]: Abstraction has 3112 states and 15549 transitions. [2020-02-10 20:34:24,049 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:34:24,049 INFO L276 IsEmpty]: Start isEmpty. Operand 3112 states and 15549 transitions. [2020-02-10 20:34:24,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:34:24,054 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:24,054 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:34:24,054 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:34:24,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:24,055 INFO L82 PathProgramCache]: Analyzing trace with hash 112344062, now seen corresponding path program 385 times [2020-02-10 20:34:24,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:24,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191842631] [2020-02-10 20:34:24,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:24,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:24,586 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:34:24,719 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:34:24,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:34:24,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191842631] [2020-02-10 20:34:24,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:24,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:34:24,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020025193] [2020-02-10 20:34:24,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:34:24,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:24,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:34:24,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:34:24,730 INFO L87 Difference]: Start difference. First operand 3112 states and 15549 transitions. Second operand 12 states. [2020-02-10 20:34:25,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:25,021 INFO L93 Difference]: Finished difference Result 6036 states and 26879 transitions. [2020-02-10 20:34:25,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:34:25,021 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:34:25,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:25,036 INFO L225 Difference]: With dead ends: 6036 [2020-02-10 20:34:25,036 INFO L226 Difference]: Without dead ends: 6017 [2020-02-10 20:34:25,036 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:34:25,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6017 states. [2020-02-10 20:34:25,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6017 to 3130. [2020-02-10 20:34:25,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 20:34:25,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15610 transitions. [2020-02-10 20:34:25,223 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15610 transitions. Word has length 31 [2020-02-10 20:34:25,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:25,223 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15610 transitions. [2020-02-10 20:34:25,223 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:34:25,223 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15610 transitions. [2020-02-10 20:34:25,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:34:25,228 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:25,228 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:34:25,228 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:34:25,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:25,229 INFO L82 PathProgramCache]: Analyzing trace with hash -310141664, now seen corresponding path program 386 times [2020-02-10 20:34:25,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:25,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745492737] [2020-02-10 20:34:25,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:25,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:25,772 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:34:25,904 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:34:25,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:34:25,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745492737] [2020-02-10 20:34:25,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:25,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:34:25,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328793452] [2020-02-10 20:34:25,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:34:25,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:25,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:34:25,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:34:25,914 INFO L87 Difference]: Start difference. First operand 3130 states and 15610 transitions. Second operand 12 states. [2020-02-10 20:34:26,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:26,159 INFO L93 Difference]: Finished difference Result 6033 states and 26868 transitions. [2020-02-10 20:34:26,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:34:26,160 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:34:26,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:26,174 INFO L225 Difference]: With dead ends: 6033 [2020-02-10 20:34:26,174 INFO L226 Difference]: Without dead ends: 6012 [2020-02-10 20:34:26,174 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:34:26,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6012 states. [2020-02-10 20:34:26,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6012 to 3125. [2020-02-10 20:34:26,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 20:34:26,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15596 transitions. [2020-02-10 20:34:26,363 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15596 transitions. Word has length 31 [2020-02-10 20:34:26,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:26,363 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15596 transitions. [2020-02-10 20:34:26,364 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:34:26,364 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15596 transitions. [2020-02-10 20:34:26,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:34:26,369 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:26,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:34:26,369 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:34:26,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:26,369 INFO L82 PathProgramCache]: Analyzing trace with hash -311967174, now seen corresponding path program 387 times [2020-02-10 20:34:26,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:26,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534843061] [2020-02-10 20:34:26,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:26,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:26,920 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:34:27,054 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:34:27,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:34:27,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534843061] [2020-02-10 20:34:27,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:27,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:34:27,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529796369] [2020-02-10 20:34:27,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:34:27,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:27,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:34:27,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:34:27,064 INFO L87 Difference]: Start difference. First operand 3125 states and 15596 transitions. Second operand 12 states. [2020-02-10 20:34:27,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:27,382 INFO L93 Difference]: Finished difference Result 6043 states and 26891 transitions. [2020-02-10 20:34:27,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:34:27,383 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:34:27,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:27,397 INFO L225 Difference]: With dead ends: 6043 [2020-02-10 20:34:27,398 INFO L226 Difference]: Without dead ends: 6024 [2020-02-10 20:34:27,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:34:27,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6024 states. [2020-02-10 20:34:27,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6024 to 3133. [2020-02-10 20:34:27,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-02-10 20:34:27,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15611 transitions. [2020-02-10 20:34:27,593 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15611 transitions. Word has length 31 [2020-02-10 20:34:27,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:27,594 INFO L479 AbstractCegarLoop]: Abstraction has 3133 states and 15611 transitions. [2020-02-10 20:34:27,594 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:34:27,594 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15611 transitions. [2020-02-10 20:34:27,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:34:27,599 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:27,599 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:34:27,599 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:34:27,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:27,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1579424352, now seen corresponding path program 388 times [2020-02-10 20:34:27,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:27,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552252176] [2020-02-10 20:34:27,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:27,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:28,152 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:34:28,284 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:34:28,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:34:28,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552252176] [2020-02-10 20:34:28,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:28,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:34:28,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366531341] [2020-02-10 20:34:28,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:34:28,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:28,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:34:28,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:34:28,294 INFO L87 Difference]: Start difference. First operand 3133 states and 15611 transitions. Second operand 12 states. [2020-02-10 20:34:28,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:28,600 INFO L93 Difference]: Finished difference Result 6044 states and 26885 transitions. [2020-02-10 20:34:28,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:34:28,600 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:34:28,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:28,614 INFO L225 Difference]: With dead ends: 6044 [2020-02-10 20:34:28,614 INFO L226 Difference]: Without dead ends: 6016 [2020-02-10 20:34:28,614 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:34:28,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6016 states. [2020-02-10 20:34:28,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6016 to 3125. [2020-02-10 20:34:28,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 20:34:28,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15591 transitions. [2020-02-10 20:34:28,800 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15591 transitions. Word has length 31 [2020-02-10 20:34:28,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:28,800 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15591 transitions. [2020-02-10 20:34:28,800 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:34:28,800 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15591 transitions. [2020-02-10 20:34:28,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:34:28,805 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:28,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:34:28,806 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:34:28,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:28,806 INFO L82 PathProgramCache]: Analyzing trace with hash -946608518, now seen corresponding path program 389 times [2020-02-10 20:34:28,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:28,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323463574] [2020-02-10 20:34:28,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:28,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:29,464 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 20:34:29,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:34:29,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323463574] [2020-02-10 20:34:29,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:29,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:34:29,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479716807] [2020-02-10 20:34:29,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:34:29,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:29,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:34:29,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:34:29,473 INFO L87 Difference]: Start difference. First operand 3125 states and 15591 transitions. Second operand 12 states. [2020-02-10 20:34:29,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:29,707 INFO L93 Difference]: Finished difference Result 6034 states and 26865 transitions. [2020-02-10 20:34:29,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:34:29,708 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:34:29,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:29,722 INFO L225 Difference]: With dead ends: 6034 [2020-02-10 20:34:29,722 INFO L226 Difference]: Without dead ends: 6018 [2020-02-10 20:34:29,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:34:29,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6018 states. [2020-02-10 20:34:29,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6018 to 3130. [2020-02-10 20:34:29,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 20:34:29,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15600 transitions. [2020-02-10 20:34:29,910 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15600 transitions. Word has length 31 [2020-02-10 20:34:29,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:29,910 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15600 transitions. [2020-02-10 20:34:29,910 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:34:29,910 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15600 transitions. [2020-02-10 20:34:29,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:34:29,915 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:29,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:34:29,915 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:34:29,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:29,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1791579970, now seen corresponding path program 390 times [2020-02-10 20:34:29,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:29,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360599831] [2020-02-10 20:34:29,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:29,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:30,448 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:34:30,582 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:34:30,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:34:30,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360599831] [2020-02-10 20:34:30,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:30,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:34:30,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731250350] [2020-02-10 20:34:30,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:34:30,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:30,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:34:30,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:34:30,592 INFO L87 Difference]: Start difference. First operand 3130 states and 15600 transitions. Second operand 12 states. [2020-02-10 20:34:30,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:30,898 INFO L93 Difference]: Finished difference Result 6038 states and 26868 transitions. [2020-02-10 20:34:30,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:34:30,899 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:34:30,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:30,912 INFO L225 Difference]: With dead ends: 6038 [2020-02-10 20:34:30,912 INFO L226 Difference]: Without dead ends: 6008 [2020-02-10 20:34:30,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:34:31,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6008 states. [2020-02-10 20:34:31,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6008 to 3120. [2020-02-10 20:34:31,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3120 states. [2020-02-10 20:34:31,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 15577 transitions. [2020-02-10 20:34:31,095 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 15577 transitions. Word has length 31 [2020-02-10 20:34:31,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:31,096 INFO L479 AbstractCegarLoop]: Abstraction has 3120 states and 15577 transitions. [2020-02-10 20:34:31,096 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:34:31,096 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 15577 transitions. [2020-02-10 20:34:31,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:34:31,101 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:31,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:34:31,101 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:34:31,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:31,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1319215212, now seen corresponding path program 391 times [2020-02-10 20:34:31,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:31,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959212396] [2020-02-10 20:34:31,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:31,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:31,651 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:34:31,784 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:34:31,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:34:31,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959212396] [2020-02-10 20:34:31,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:31,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:34:31,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970072901] [2020-02-10 20:34:31,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:34:31,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:31,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:34:31,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:34:31,794 INFO L87 Difference]: Start difference. First operand 3120 states and 15577 transitions. Second operand 12 states. [2020-02-10 20:34:32,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:32,100 INFO L93 Difference]: Finished difference Result 6041 states and 26884 transitions. [2020-02-10 20:34:32,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:34:32,100 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:34:32,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:32,115 INFO L225 Difference]: With dead ends: 6041 [2020-02-10 20:34:32,115 INFO L226 Difference]: Without dead ends: 6022 [2020-02-10 20:34:32,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:34:32,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6022 states. [2020-02-10 20:34:32,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6022 to 3131. [2020-02-10 20:34:32,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 20:34:32,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15608 transitions. [2020-02-10 20:34:32,298 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15608 transitions. Word has length 31 [2020-02-10 20:34:32,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:32,298 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15608 transitions. [2020-02-10 20:34:32,298 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:34:32,298 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15608 transitions. [2020-02-10 20:34:32,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:34:32,303 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:32,304 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:34:32,304 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:34:32,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:32,304 INFO L82 PathProgramCache]: Analyzing trace with hash 896729486, now seen corresponding path program 392 times [2020-02-10 20:34:32,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:32,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541326731] [2020-02-10 20:34:32,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:32,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:32,876 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2020-02-10 20:34:33,016 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:34:33,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:34:33,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541326731] [2020-02-10 20:34:33,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:33,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:34:33,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323851371] [2020-02-10 20:34:33,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:34:33,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:33,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:34:33,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:34:33,028 INFO L87 Difference]: Start difference. First operand 3131 states and 15608 transitions. Second operand 12 states. [2020-02-10 20:34:33,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:33,345 INFO L93 Difference]: Finished difference Result 6038 states and 26873 transitions. [2020-02-10 20:34:33,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:34:33,346 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:34:33,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:33,360 INFO L225 Difference]: With dead ends: 6038 [2020-02-10 20:34:33,361 INFO L226 Difference]: Without dead ends: 6017 [2020-02-10 20:34:33,361 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:34:33,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6017 states. [2020-02-10 20:34:33,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6017 to 3126. [2020-02-10 20:34:33,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 20:34:33,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15594 transitions. [2020-02-10 20:34:33,551 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15594 transitions. Word has length 31 [2020-02-10 20:34:33,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:33,551 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15594 transitions. [2020-02-10 20:34:33,551 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:34:33,551 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15594 transitions. [2020-02-10 20:34:33,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:34:33,556 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:33,556 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:34:33,557 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:34:33,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:33,557 INFO L82 PathProgramCache]: Analyzing trace with hash -590185350, now seen corresponding path program 393 times [2020-02-10 20:34:33,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:33,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253933152] [2020-02-10 20:34:33,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:33,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:34,107 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:34:34,242 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:34:34,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:34:34,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253933152] [2020-02-10 20:34:34,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:34,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:34:34,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675073461] [2020-02-10 20:34:34,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:34:34,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:34,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:34:34,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:34:34,253 INFO L87 Difference]: Start difference. First operand 3126 states and 15594 transitions. Second operand 12 states. [2020-02-10 20:34:34,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:34,531 INFO L93 Difference]: Finished difference Result 6051 states and 26901 transitions. [2020-02-10 20:34:34,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:34:34,532 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:34:34,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:34,546 INFO L225 Difference]: With dead ends: 6051 [2020-02-10 20:34:34,546 INFO L226 Difference]: Without dead ends: 6032 [2020-02-10 20:34:34,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:34:34,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6032 states. [2020-02-10 20:34:34,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6032 to 3135. [2020-02-10 20:34:34,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2020-02-10 20:34:34,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 15611 transitions. [2020-02-10 20:34:34,734 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 15611 transitions. Word has length 31 [2020-02-10 20:34:34,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:34,735 INFO L479 AbstractCegarLoop]: Abstraction has 3135 states and 15611 transitions. [2020-02-10 20:34:34,735 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:34:34,735 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 15611 transitions. [2020-02-10 20:34:34,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:34:34,740 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:34,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:34:34,740 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:34:34,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:34,740 INFO L82 PathProgramCache]: Analyzing trace with hash -520075314, now seen corresponding path program 394 times [2020-02-10 20:34:34,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:34,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114236485] [2020-02-10 20:34:34,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:34,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:35,284 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:34:35,416 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:34:35,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:34:35,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114236485] [2020-02-10 20:34:35,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:35,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:34:35,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962716162] [2020-02-10 20:34:35,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:34:35,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:35,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:34:35,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:34:35,425 INFO L87 Difference]: Start difference. First operand 3135 states and 15611 transitions. Second operand 12 states. [2020-02-10 20:34:35,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:35,695 INFO L93 Difference]: Finished difference Result 6054 states and 26898 transitions. [2020-02-10 20:34:35,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:34:35,695 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:34:35,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:35,710 INFO L225 Difference]: With dead ends: 6054 [2020-02-10 20:34:35,710 INFO L226 Difference]: Without dead ends: 6023 [2020-02-10 20:34:35,710 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:34:35,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6023 states. [2020-02-10 20:34:35,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6023 to 3126. [2020-02-10 20:34:35,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 20:34:35,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15588 transitions. [2020-02-10 20:34:35,893 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15588 transitions. Word has length 31 [2020-02-10 20:34:35,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:35,893 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15588 transitions. [2020-02-10 20:34:35,893 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:34:35,893 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15588 transitions. [2020-02-10 20:34:35,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:34:35,898 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:35,898 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:34:35,898 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:34:35,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:35,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1224826694, now seen corresponding path program 395 times [2020-02-10 20:34:35,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:35,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974169107] [2020-02-10 20:34:35,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:35,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:36,352 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 27 [2020-02-10 20:34:36,481 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2020-02-10 20:34:36,609 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:34:36,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:34:36,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974169107] [2020-02-10 20:34:36,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:36,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:34:36,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059862557] [2020-02-10 20:34:36,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:34:36,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:36,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:34:36,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:34:36,619 INFO L87 Difference]: Start difference. First operand 3126 states and 15588 transitions. Second operand 12 states. [2020-02-10 20:34:36,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:36,977 INFO L93 Difference]: Finished difference Result 6042 states and 26874 transitions. [2020-02-10 20:34:36,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:34:36,977 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:34:36,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:36,991 INFO L225 Difference]: With dead ends: 6042 [2020-02-10 20:34:36,991 INFO L226 Difference]: Without dead ends: 6026 [2020-02-10 20:34:36,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 20:34:37,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6026 states. [2020-02-10 20:34:37,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6026 to 3132. [2020-02-10 20:34:37,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-02-10 20:34:37,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15599 transitions. [2020-02-10 20:34:37,174 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15599 transitions. Word has length 31 [2020-02-10 20:34:37,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:37,174 INFO L479 AbstractCegarLoop]: Abstraction has 3132 states and 15599 transitions. [2020-02-10 20:34:37,174 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:34:37,174 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15599 transitions. [2020-02-10 20:34:37,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:34:37,179 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:37,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:34:37,179 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:34:37,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:37,180 INFO L82 PathProgramCache]: Analyzing trace with hash -732230932, now seen corresponding path program 396 times [2020-02-10 20:34:37,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:37,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569889919] [2020-02-10 20:34:37,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:37,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:37,709 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:34:37,838 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:34:37,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:34:37,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569889919] [2020-02-10 20:34:37,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:37,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:34:37,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432453438] [2020-02-10 20:34:37,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:34:37,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:37,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:34:37,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:34:37,848 INFO L87 Difference]: Start difference. First operand 3132 states and 15599 transitions. Second operand 12 states. [2020-02-10 20:34:38,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:38,171 INFO L93 Difference]: Finished difference Result 6048 states and 26880 transitions. [2020-02-10 20:34:38,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:34:38,171 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:34:38,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:38,186 INFO L225 Difference]: With dead ends: 6048 [2020-02-10 20:34:38,187 INFO L226 Difference]: Without dead ends: 6014 [2020-02-10 20:34:38,187 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:34:38,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6014 states. [2020-02-10 20:34:38,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6014 to 3120. [2020-02-10 20:34:38,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3120 states. [2020-02-10 20:34:38,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 15571 transitions. [2020-02-10 20:34:38,370 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 15571 transitions. Word has length 31 [2020-02-10 20:34:38,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:38,371 INFO L479 AbstractCegarLoop]: Abstraction has 3120 states and 15571 transitions. [2020-02-10 20:34:38,371 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:34:38,371 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 15571 transitions. [2020-02-10 20:34:38,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:34:38,376 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:38,376 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:34:38,376 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:34:38,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:38,376 INFO L82 PathProgramCache]: Analyzing trace with hash 626157548, now seen corresponding path program 397 times [2020-02-10 20:34:38,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:38,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735225072] [2020-02-10 20:34:38,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:38,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:38,929 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:34:39,061 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:34:39,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:34:39,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735225072] [2020-02-10 20:34:39,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:39,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:34:39,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022182048] [2020-02-10 20:34:39,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:34:39,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:39,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:34:39,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:34:39,072 INFO L87 Difference]: Start difference. First operand 3120 states and 15571 transitions. Second operand 12 states. [2020-02-10 20:34:39,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:39,360 INFO L93 Difference]: Finished difference Result 6065 states and 26940 transitions. [2020-02-10 20:34:39,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:34:39,361 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:34:39,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:39,375 INFO L225 Difference]: With dead ends: 6065 [2020-02-10 20:34:39,375 INFO L226 Difference]: Without dead ends: 6046 [2020-02-10 20:34:39,375 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:34:39,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6046 states. [2020-02-10 20:34:39,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6046 to 3139. [2020-02-10 20:34:39,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3139 states. [2020-02-10 20:34:39,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3139 states to 3139 states and 15623 transitions. [2020-02-10 20:34:39,559 INFO L78 Accepts]: Start accepts. Automaton has 3139 states and 15623 transitions. Word has length 31 [2020-02-10 20:34:39,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:39,559 INFO L479 AbstractCegarLoop]: Abstraction has 3139 states and 15623 transitions. [2020-02-10 20:34:39,559 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:34:39,559 INFO L276 IsEmpty]: Start isEmpty. Operand 3139 states and 15623 transitions. [2020-02-10 20:34:39,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:34:39,564 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:39,564 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:34:39,564 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:34:39,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:39,564 INFO L82 PathProgramCache]: Analyzing trace with hash -641299630, now seen corresponding path program 398 times [2020-02-10 20:34:39,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:39,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747796308] [2020-02-10 20:34:39,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:39,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:40,122 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:34:40,252 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:34:40,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:34:40,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747796308] [2020-02-10 20:34:40,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:40,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:34:40,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475093026] [2020-02-10 20:34:40,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:34:40,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:40,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:34:40,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:34:40,262 INFO L87 Difference]: Start difference. First operand 3139 states and 15623 transitions. Second operand 12 states. [2020-02-10 20:34:40,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:40,623 INFO L93 Difference]: Finished difference Result 6066 states and 26934 transitions. [2020-02-10 20:34:40,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:34:40,623 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:34:40,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:40,637 INFO L225 Difference]: With dead ends: 6066 [2020-02-10 20:34:40,637 INFO L226 Difference]: Without dead ends: 6038 [2020-02-10 20:34:40,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:34:40,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6038 states. [2020-02-10 20:34:40,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6038 to 3131. [2020-02-10 20:34:40,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 20:34:40,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15600 transitions. [2020-02-10 20:34:40,824 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15600 transitions. Word has length 31 [2020-02-10 20:34:40,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:40,824 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15600 transitions. [2020-02-10 20:34:40,824 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:34:40,824 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15600 transitions. [2020-02-10 20:34:40,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:34:40,829 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:40,829 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:34:40,829 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:34:40,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:40,830 INFO L82 PathProgramCache]: Analyzing trace with hash -858931778, now seen corresponding path program 399 times [2020-02-10 20:34:40,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:40,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947074481] [2020-02-10 20:34:40,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:40,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:41,375 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:34:41,507 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:34:41,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:34:41,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947074481] [2020-02-10 20:34:41,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:41,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:34:41,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676342810] [2020-02-10 20:34:41,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:34:41,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:41,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:34:41,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:34:41,517 INFO L87 Difference]: Start difference. First operand 3131 states and 15600 transitions. Second operand 12 states. [2020-02-10 20:34:41,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:41,805 INFO L93 Difference]: Finished difference Result 6068 states and 26937 transitions. [2020-02-10 20:34:41,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:34:41,806 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:34:41,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:41,821 INFO L225 Difference]: With dead ends: 6068 [2020-02-10 20:34:41,821 INFO L226 Difference]: Without dead ends: 6049 [2020-02-10 20:34:41,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:34:41,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6049 states. [2020-02-10 20:34:41,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6049 to 3140. [2020-02-10 20:34:41,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3140 states. [2020-02-10 20:34:42,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3140 states to 3140 states and 15617 transitions. [2020-02-10 20:34:42,005 INFO L78 Accepts]: Start accepts. Automaton has 3140 states and 15617 transitions. Word has length 31 [2020-02-10 20:34:42,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:42,005 INFO L479 AbstractCegarLoop]: Abstraction has 3140 states and 15617 transitions. [2020-02-10 20:34:42,005 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:34:42,005 INFO L276 IsEmpty]: Start isEmpty. Operand 3140 states and 15617 transitions. [2020-02-10 20:34:42,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:34:42,010 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:42,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:34:42,010 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:34:42,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:42,010 INFO L82 PathProgramCache]: Analyzing trace with hash -788821742, now seen corresponding path program 400 times [2020-02-10 20:34:42,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:42,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465739791] [2020-02-10 20:34:42,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:42,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:42,578 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 20:34:42,709 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:34:42,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:34:42,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465739791] [2020-02-10 20:34:42,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:42,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:34:42,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334376678] [2020-02-10 20:34:42,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:34:42,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:42,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:34:42,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:34:42,718 INFO L87 Difference]: Start difference. First operand 3140 states and 15617 transitions. Second operand 12 states. [2020-02-10 20:34:42,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:42,908 INFO L93 Difference]: Finished difference Result 6071 states and 26934 transitions. [2020-02-10 20:34:42,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:34:42,908 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:34:42,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:42,923 INFO L225 Difference]: With dead ends: 6071 [2020-02-10 20:34:42,923 INFO L226 Difference]: Without dead ends: 6040 [2020-02-10 20:34:42,923 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:34:43,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6040 states. [2020-02-10 20:34:43,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6040 to 3131. [2020-02-10 20:34:43,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 20:34:43,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15591 transitions. [2020-02-10 20:34:43,106 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15591 transitions. Word has length 31 [2020-02-10 20:34:43,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:43,106 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15591 transitions. [2020-02-10 20:34:43,106 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:34:43,106 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15591 transitions. [2020-02-10 20:34:43,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:34:43,111 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:43,111 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:34:43,111 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:34:43,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:43,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1532111486, now seen corresponding path program 401 times [2020-02-10 20:34:43,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:43,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242860966] [2020-02-10 20:34:43,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:43,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:43,670 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:34:43,799 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:34:43,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:34:43,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242860966] [2020-02-10 20:34:43,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:43,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:34:43,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577787211] [2020-02-10 20:34:43,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:34:43,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:43,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:34:43,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:34:43,809 INFO L87 Difference]: Start difference. First operand 3131 states and 15591 transitions. Second operand 12 states. [2020-02-10 20:34:44,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:44,040 INFO L93 Difference]: Finished difference Result 6072 states and 26936 transitions. [2020-02-10 20:34:44,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:34:44,040 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:34:44,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:44,055 INFO L225 Difference]: With dead ends: 6072 [2020-02-10 20:34:44,055 INFO L226 Difference]: Without dead ends: 6052 [2020-02-10 20:34:44,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:34:44,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6052 states. [2020-02-10 20:34:44,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6052 to 3142. [2020-02-10 20:34:44,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3142 states. [2020-02-10 20:34:44,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3142 states to 3142 states and 15611 transitions. [2020-02-10 20:34:44,287 INFO L78 Accepts]: Start accepts. Automaton has 3142 states and 15611 transitions. Word has length 31 [2020-02-10 20:34:44,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:44,287 INFO L479 AbstractCegarLoop]: Abstraction has 3142 states and 15611 transitions. [2020-02-10 20:34:44,287 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:34:44,287 INFO L276 IsEmpty]: Start isEmpty. Operand 3142 states and 15611 transitions. [2020-02-10 20:34:44,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:34:44,292 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:44,292 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:34:44,292 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:34:44,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:44,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1425288596, now seen corresponding path program 402 times [2020-02-10 20:34:44,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:44,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413985166] [2020-02-10 20:34:44,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:44,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:44,859 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:34:44,988 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:34:44,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:34:44,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413985166] [2020-02-10 20:34:44,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:44,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:34:44,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895172268] [2020-02-10 20:34:44,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:34:44,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:44,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:34:44,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:34:44,997 INFO L87 Difference]: Start difference. First operand 3142 states and 15611 transitions. Second operand 12 states. [2020-02-10 20:34:45,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:45,181 INFO L93 Difference]: Finished difference Result 6074 states and 26930 transitions. [2020-02-10 20:34:45,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:34:45,182 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:34:45,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:45,196 INFO L225 Difference]: With dead ends: 6074 [2020-02-10 20:34:45,196 INFO L226 Difference]: Without dead ends: 6030 [2020-02-10 20:34:45,196 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:34:45,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6030 states. [2020-02-10 20:34:45,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6030 to 3120. [2020-02-10 20:34:45,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3120 states. [2020-02-10 20:34:45,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 15563 transitions. [2020-02-10 20:34:45,382 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 15563 transitions. Word has length 31 [2020-02-10 20:34:45,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:45,382 INFO L479 AbstractCegarLoop]: Abstraction has 3120 states and 15563 transitions. [2020-02-10 20:34:45,382 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:34:45,382 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 15563 transitions. [2020-02-10 20:34:45,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:34:45,387 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:45,387 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:34:45,387 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:34:45,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:45,388 INFO L82 PathProgramCache]: Analyzing trace with hash 2004626638, now seen corresponding path program 403 times [2020-02-10 20:34:45,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:45,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456028234] [2020-02-10 20:34:45,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:45,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:46,045 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:34:46,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:34:46,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456028234] [2020-02-10 20:34:46,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:46,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:34:46,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377840447] [2020-02-10 20:34:46,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:34:46,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:46,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:34:46,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:34:46,054 INFO L87 Difference]: Start difference. First operand 3120 states and 15563 transitions. Second operand 12 states. [2020-02-10 20:34:46,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:46,321 INFO L93 Difference]: Finished difference Result 6043 states and 26874 transitions. [2020-02-10 20:34:46,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:34:46,321 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:34:46,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:46,335 INFO L225 Difference]: With dead ends: 6043 [2020-02-10 20:34:46,336 INFO L226 Difference]: Without dead ends: 6027 [2020-02-10 20:34:46,336 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:34:46,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6027 states. [2020-02-10 20:34:46,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6027 to 3132. [2020-02-10 20:34:46,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-02-10 20:34:46,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15596 transitions. [2020-02-10 20:34:46,522 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15596 transitions. Word has length 31 [2020-02-10 20:34:46,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:46,522 INFO L479 AbstractCegarLoop]: Abstraction has 3132 states and 15596 transitions. [2020-02-10 20:34:46,522 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:34:46,522 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15596 transitions. [2020-02-10 20:34:46,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:34:46,527 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:46,528 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:34:46,528 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:34:46,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:46,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1159655186, now seen corresponding path program 404 times [2020-02-10 20:34:46,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:46,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566649997] [2020-02-10 20:34:46,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:46,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:47,045 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:34:47,178 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:34:47,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:34:47,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566649997] [2020-02-10 20:34:47,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:47,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:34:47,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445893858] [2020-02-10 20:34:47,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:34:47,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:47,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:34:47,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:34:47,187 INFO L87 Difference]: Start difference. First operand 3132 states and 15596 transitions. Second operand 12 states. [2020-02-10 20:34:47,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:47,438 INFO L93 Difference]: Finished difference Result 6047 states and 26877 transitions. [2020-02-10 20:34:47,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:34:47,439 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:34:47,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:47,453 INFO L225 Difference]: With dead ends: 6047 [2020-02-10 20:34:47,453 INFO L226 Difference]: Without dead ends: 6022 [2020-02-10 20:34:47,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:34:47,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6022 states. [2020-02-10 20:34:47,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6022 to 3127. [2020-02-10 20:34:47,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:34:47,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15582 transitions. [2020-02-10 20:34:47,637 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15582 transitions. Word has length 31 [2020-02-10 20:34:47,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:47,637 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15582 transitions. [2020-02-10 20:34:47,637 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:34:47,637 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15582 transitions. [2020-02-10 20:34:47,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:34:47,642 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:47,642 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:34:47,642 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:34:47,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:47,643 INFO L82 PathProgramCache]: Analyzing trace with hash 519537312, now seen corresponding path program 405 times [2020-02-10 20:34:47,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:47,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089474130] [2020-02-10 20:34:47,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:47,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:48,183 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:34:48,316 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:34:48,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:34:48,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089474130] [2020-02-10 20:34:48,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:48,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:34:48,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109993142] [2020-02-10 20:34:48,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:34:48,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:48,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:34:48,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:34:48,326 INFO L87 Difference]: Start difference. First operand 3127 states and 15582 transitions. Second operand 12 states. [2020-02-10 20:34:48,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:48,551 INFO L93 Difference]: Finished difference Result 6046 states and 26874 transitions. [2020-02-10 20:34:48,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:34:48,552 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:34:48,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:48,566 INFO L225 Difference]: With dead ends: 6046 [2020-02-10 20:34:48,566 INFO L226 Difference]: Without dead ends: 6030 [2020-02-10 20:34:48,566 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:34:48,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6030 states. [2020-02-10 20:34:48,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6030 to 3133. [2020-02-10 20:34:48,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-02-10 20:34:48,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15593 transitions. [2020-02-10 20:34:48,749 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15593 transitions. Word has length 31 [2020-02-10 20:34:48,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:48,749 INFO L479 AbstractCegarLoop]: Abstraction has 3133 states and 15593 transitions. [2020-02-10 20:34:48,749 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:34:48,750 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15593 transitions. [2020-02-10 20:34:48,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:34:48,754 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:48,755 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:34:48,755 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:34:48,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:48,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1012133074, now seen corresponding path program 406 times [2020-02-10 20:34:48,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:48,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476540791] [2020-02-10 20:34:48,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:48,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:49,291 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:34:49,419 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 33 [2020-02-10 20:34:49,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:34:49,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476540791] [2020-02-10 20:34:49,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:49,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:34:49,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268972624] [2020-02-10 20:34:49,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:34:49,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:49,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:34:49,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:34:49,429 INFO L87 Difference]: Start difference. First operand 3133 states and 15593 transitions. Second operand 12 states. [2020-02-10 20:34:49,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:49,675 INFO L93 Difference]: Finished difference Result 6052 states and 26880 transitions. [2020-02-10 20:34:49,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:34:49,675 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:34:49,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:49,689 INFO L225 Difference]: With dead ends: 6052 [2020-02-10 20:34:49,689 INFO L226 Difference]: Without dead ends: 6024 [2020-02-10 20:34:49,690 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:34:49,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6024 states. [2020-02-10 20:34:49,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6024 to 3127. [2020-02-10 20:34:49,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:34:49,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15576 transitions. [2020-02-10 20:34:49,873 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15576 transitions. Word has length 31 [2020-02-10 20:34:49,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:49,874 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15576 transitions. [2020-02-10 20:34:49,874 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:34:49,874 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15576 transitions. [2020-02-10 20:34:49,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:34:49,879 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:49,879 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:34:49,879 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:34:49,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:49,879 INFO L82 PathProgramCache]: Analyzing trace with hash -749745376, now seen corresponding path program 407 times [2020-02-10 20:34:49,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:49,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166529016] [2020-02-10 20:34:49,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:49,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:50,438 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:34:50,567 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:34:50,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:34:50,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166529016] [2020-02-10 20:34:50,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:50,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:34:50,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327625749] [2020-02-10 20:34:50,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:34:50,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:50,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:34:50,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:34:50,578 INFO L87 Difference]: Start difference. First operand 3127 states and 15576 transitions. Second operand 12 states. [2020-02-10 20:34:50,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:50,867 INFO L93 Difference]: Finished difference Result 6059 states and 26897 transitions. [2020-02-10 20:34:50,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:34:50,867 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:34:50,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:50,883 INFO L225 Difference]: With dead ends: 6059 [2020-02-10 20:34:50,883 INFO L226 Difference]: Without dead ends: 6039 [2020-02-10 20:34:50,883 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:34:51,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6039 states. [2020-02-10 20:34:51,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6039 to 3138. [2020-02-10 20:34:51,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3138 states. [2020-02-10 20:34:51,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3138 states to 3138 states and 15596 transitions. [2020-02-10 20:34:51,073 INFO L78 Accepts]: Start accepts. Automaton has 3138 states and 15596 transitions. Word has length 31 [2020-02-10 20:34:51,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:51,073 INFO L479 AbstractCegarLoop]: Abstraction has 3138 states and 15596 transitions. [2020-02-10 20:34:51,073 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:34:51,073 INFO L276 IsEmpty]: Start isEmpty. Operand 3138 states and 15596 transitions. [2020-02-10 20:34:51,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:34:51,078 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:51,078 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:34:51,078 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:34:51,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:51,078 INFO L82 PathProgramCache]: Analyzing trace with hash 587821838, now seen corresponding path program 408 times [2020-02-10 20:34:51,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:51,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871318988] [2020-02-10 20:34:51,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:51,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:51,648 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 33 [2020-02-10 20:34:51,782 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:34:51,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:34:51,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871318988] [2020-02-10 20:34:51,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:51,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:34:51,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797791393] [2020-02-10 20:34:51,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:34:51,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:51,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:34:51,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:34:51,791 INFO L87 Difference]: Start difference. First operand 3138 states and 15596 transitions. Second operand 12 states. [2020-02-10 20:34:52,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:52,010 INFO L93 Difference]: Finished difference Result 6061 states and 26891 transitions. [2020-02-10 20:34:52,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:34:52,011 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:34:52,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:52,026 INFO L225 Difference]: With dead ends: 6061 [2020-02-10 20:34:52,026 INFO L226 Difference]: Without dead ends: 6013 [2020-02-10 20:34:52,026 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:34:52,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6013 states. [2020-02-10 20:34:52,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6013 to 3112. [2020-02-10 20:34:52,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3112 states. [2020-02-10 20:34:52,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3112 states to 3112 states and 15541 transitions. [2020-02-10 20:34:52,214 INFO L78 Accepts]: Start accepts. Automaton has 3112 states and 15541 transitions. Word has length 31 [2020-02-10 20:34:52,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:52,214 INFO L479 AbstractCegarLoop]: Abstraction has 3112 states and 15541 transitions. [2020-02-10 20:34:52,214 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:34:52,214 INFO L276 IsEmpty]: Start isEmpty. Operand 3112 states and 15541 transitions. [2020-02-10 20:34:52,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:34:52,219 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:52,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:34:52,219 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:34:52,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:52,219 INFO L82 PathProgramCache]: Analyzing trace with hash 102392958, now seen corresponding path program 409 times [2020-02-10 20:34:52,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:52,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363891609] [2020-02-10 20:34:52,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:52,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:52,750 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:34:52,879 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:34:52,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:34:52,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363891609] [2020-02-10 20:34:52,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:52,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:34:52,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514542963] [2020-02-10 20:34:52,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:34:52,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:52,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:34:52,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:34:52,889 INFO L87 Difference]: Start difference. First operand 3112 states and 15541 transitions. Second operand 12 states. [2020-02-10 20:34:53,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:53,116 INFO L93 Difference]: Finished difference Result 6015 states and 26819 transitions. [2020-02-10 20:34:53,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:34:53,117 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:34:53,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:53,132 INFO L225 Difference]: With dead ends: 6015 [2020-02-10 20:34:53,132 INFO L226 Difference]: Without dead ends: 5996 [2020-02-10 20:34:53,132 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:34:53,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5996 states. [2020-02-10 20:34:53,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5996 to 3128. [2020-02-10 20:34:53,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 20:34:53,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15597 transitions. [2020-02-10 20:34:53,315 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15597 transitions. Word has length 31 [2020-02-10 20:34:53,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:53,315 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15597 transitions. [2020-02-10 20:34:53,316 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:34:53,316 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15597 transitions. [2020-02-10 20:34:53,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:34:53,321 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:53,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:34:53,321 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:34:53,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:53,321 INFO L82 PathProgramCache]: Analyzing trace with hash -320092768, now seen corresponding path program 410 times [2020-02-10 20:34:53,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:53,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636211143] [2020-02-10 20:34:53,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:53,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:53,857 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:34:53,984 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:34:53,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:34:53,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636211143] [2020-02-10 20:34:53,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:53,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:34:53,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359434872] [2020-02-10 20:34:53,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:34:53,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:53,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:34:53,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:34:53,994 INFO L87 Difference]: Start difference. First operand 3128 states and 15597 transitions. Second operand 12 states. [2020-02-10 20:34:54,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:54,222 INFO L93 Difference]: Finished difference Result 6012 states and 26808 transitions. [2020-02-10 20:34:54,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:34:54,222 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:34:54,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:54,235 INFO L225 Difference]: With dead ends: 6012 [2020-02-10 20:34:54,235 INFO L226 Difference]: Without dead ends: 5991 [2020-02-10 20:34:54,235 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:34:54,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5991 states. [2020-02-10 20:34:54,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5991 to 3123. [2020-02-10 20:34:54,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3123 states. [2020-02-10 20:34:54,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 15583 transitions. [2020-02-10 20:34:54,425 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 15583 transitions. Word has length 31 [2020-02-10 20:34:54,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:54,425 INFO L479 AbstractCegarLoop]: Abstraction has 3123 states and 15583 transitions. [2020-02-10 20:34:54,425 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:34:54,425 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 15583 transitions. [2020-02-10 20:34:54,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:34:54,430 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:54,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:34:54,431 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:34:54,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:54,431 INFO L82 PathProgramCache]: Analyzing trace with hash -746229514, now seen corresponding path program 411 times [2020-02-10 20:34:54,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:54,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078148488] [2020-02-10 20:34:54,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:54,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:55,087 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:34:55,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:34:55,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078148488] [2020-02-10 20:34:55,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:55,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:34:55,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093056261] [2020-02-10 20:34:55,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:34:55,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:55,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:34:55,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:34:55,098 INFO L87 Difference]: Start difference. First operand 3123 states and 15583 transitions. Second operand 12 states. [2020-02-10 20:34:55,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:55,330 INFO L93 Difference]: Finished difference Result 6017 states and 26819 transitions. [2020-02-10 20:34:55,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:34:55,330 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:34:55,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:55,345 INFO L225 Difference]: With dead ends: 6017 [2020-02-10 20:34:55,345 INFO L226 Difference]: Without dead ends: 5998 [2020-02-10 20:34:55,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:34:55,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5998 states. [2020-02-10 20:34:55,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5998 to 3129. [2020-02-10 20:34:55,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 20:34:55,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15594 transitions. [2020-02-10 20:34:55,529 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15594 transitions. Word has length 31 [2020-02-10 20:34:55,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:55,529 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15594 transitions. [2020-02-10 20:34:55,529 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:34:55,529 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15594 transitions. [2020-02-10 20:34:55,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:34:55,534 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:55,534 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:34:55,534 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:34:55,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:55,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1436309152, now seen corresponding path program 412 times [2020-02-10 20:34:55,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:55,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590426290] [2020-02-10 20:34:55,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:55,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:56,073 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:34:56,207 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:34:56,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:34:56,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590426290] [2020-02-10 20:34:56,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:56,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:34:56,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149862262] [2020-02-10 20:34:56,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:34:56,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:56,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:34:56,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:34:56,217 INFO L87 Difference]: Start difference. First operand 3129 states and 15594 transitions. Second operand 12 states. [2020-02-10 20:34:56,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:56,455 INFO L93 Difference]: Finished difference Result 6015 states and 26809 transitions. [2020-02-10 20:34:56,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:34:56,456 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:34:56,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:56,469 INFO L225 Difference]: With dead ends: 6015 [2020-02-10 20:34:56,470 INFO L226 Difference]: Without dead ends: 5992 [2020-02-10 20:34:56,470 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:34:56,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5992 states. [2020-02-10 20:34:56,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5992 to 3123. [2020-02-10 20:34:56,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3123 states. [2020-02-10 20:34:56,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 15578 transitions. [2020-02-10 20:34:56,653 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 15578 transitions. Word has length 31 [2020-02-10 20:34:56,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:56,653 INFO L479 AbstractCegarLoop]: Abstraction has 3123 states and 15578 transitions. [2020-02-10 20:34:56,653 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:34:56,653 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 15578 transitions. [2020-02-10 20:34:56,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:34:56,658 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:56,658 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:34:56,659 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:34:56,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:56,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1380870858, now seen corresponding path program 413 times [2020-02-10 20:34:56,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:56,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929554421] [2020-02-10 20:34:56,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:56,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:57,198 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:34:57,330 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:34:57,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:34:57,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929554421] [2020-02-10 20:34:57,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:57,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:34:57,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846213852] [2020-02-10 20:34:57,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:34:57,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:57,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:34:57,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:34:57,340 INFO L87 Difference]: Start difference. First operand 3123 states and 15578 transitions. Second operand 12 states. [2020-02-10 20:34:57,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:57,568 INFO L93 Difference]: Finished difference Result 6010 states and 26799 transitions. [2020-02-10 20:34:57,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:34:57,568 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:34:57,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:57,584 INFO L225 Difference]: With dead ends: 6010 [2020-02-10 20:34:57,584 INFO L226 Difference]: Without dead ends: 5994 [2020-02-10 20:34:57,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:34:57,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5994 states. [2020-02-10 20:34:57,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5994 to 3128. [2020-02-10 20:34:57,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 20:34:57,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15587 transitions. [2020-02-10 20:34:57,768 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15587 transitions. Word has length 31 [2020-02-10 20:34:57,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:57,768 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15587 transitions. [2020-02-10 20:34:57,768 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:34:57,768 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15587 transitions. [2020-02-10 20:34:57,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:34:57,773 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:57,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:34:57,774 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:34:57,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:57,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1224153534, now seen corresponding path program 414 times [2020-02-10 20:34:57,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:57,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783022862] [2020-02-10 20:34:57,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:57,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:58,313 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:34:58,439 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:34:58,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:34:58,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783022862] [2020-02-10 20:34:58,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:58,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:34:58,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819351812] [2020-02-10 20:34:58,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:34:58,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:58,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:34:58,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:34:58,449 INFO L87 Difference]: Start difference. First operand 3128 states and 15587 transitions. Second operand 12 states. [2020-02-10 20:34:58,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:58,727 INFO L93 Difference]: Finished difference Result 6011 states and 26796 transitions. [2020-02-10 20:34:58,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:34:58,727 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:34:58,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:58,742 INFO L225 Difference]: With dead ends: 6011 [2020-02-10 20:34:58,742 INFO L226 Difference]: Without dead ends: 5984 [2020-02-10 20:34:58,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:34:58,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5984 states. [2020-02-10 20:34:58,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5984 to 3118. [2020-02-10 20:34:58,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3118 states. [2020-02-10 20:34:58,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3118 states to 3118 states and 15564 transitions. [2020-02-10 20:34:58,931 INFO L78 Accepts]: Start accepts. Automaton has 3118 states and 15564 transitions. Word has length 31 [2020-02-10 20:34:58,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:34:58,932 INFO L479 AbstractCegarLoop]: Abstraction has 3118 states and 15564 transitions. [2020-02-10 20:34:58,932 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:34:58,932 INFO L276 IsEmpty]: Start isEmpty. Operand 3118 states and 15564 transitions. [2020-02-10 20:34:58,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:34:58,937 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:34:58,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:34:58,937 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:34:58,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:34:58,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1578010536, now seen corresponding path program 415 times [2020-02-10 20:34:58,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:34:58,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062888777] [2020-02-10 20:34:58,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:34:58,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:34:59,389 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 29 [2020-02-10 20:34:59,516 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:34:59,646 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:34:59,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:34:59,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062888777] [2020-02-10 20:34:59,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:34:59,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:34:59,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240131604] [2020-02-10 20:34:59,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:34:59,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:34:59,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:34:59,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:34:59,656 INFO L87 Difference]: Start difference. First operand 3118 states and 15564 transitions. Second operand 12 states. [2020-02-10 20:34:59,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:34:59,885 INFO L93 Difference]: Finished difference Result 6025 states and 26836 transitions. [2020-02-10 20:34:59,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:34:59,885 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:34:59,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:34:59,901 INFO L225 Difference]: With dead ends: 6025 [2020-02-10 20:34:59,901 INFO L226 Difference]: Without dead ends: 6006 [2020-02-10 20:34:59,901 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:35:00,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6006 states. [2020-02-10 20:35:00,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6006 to 3129. [2020-02-10 20:35:00,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 20:35:00,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15595 transitions. [2020-02-10 20:35:00,091 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15595 transitions. Word has length 31 [2020-02-10 20:35:00,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:00,091 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15595 transitions. [2020-02-10 20:35:00,091 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:35:00,091 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15595 transitions. [2020-02-10 20:35:00,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:35:00,096 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:00,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:35:00,097 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:35:00,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:00,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1155524810, now seen corresponding path program 416 times [2020-02-10 20:35:00,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:00,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080060647] [2020-02-10 20:35:00,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:00,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:00,624 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:35:00,759 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:35:00,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:35:00,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080060647] [2020-02-10 20:35:00,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:00,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:35:00,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545675954] [2020-02-10 20:35:00,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:35:00,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:00,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:35:00,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:35:00,769 INFO L87 Difference]: Start difference. First operand 3129 states and 15595 transitions. Second operand 12 states. [2020-02-10 20:35:01,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:01,081 INFO L93 Difference]: Finished difference Result 6022 states and 26825 transitions. [2020-02-10 20:35:01,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:35:01,081 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:35:01,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:01,096 INFO L225 Difference]: With dead ends: 6022 [2020-02-10 20:35:01,096 INFO L226 Difference]: Without dead ends: 6001 [2020-02-10 20:35:01,096 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:35:01,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6001 states. [2020-02-10 20:35:01,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6001 to 3124. [2020-02-10 20:35:01,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:35:01,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15581 transitions. [2020-02-10 20:35:01,290 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15581 transitions. Word has length 31 [2020-02-10 20:35:01,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:01,290 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15581 transitions. [2020-02-10 20:35:01,290 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:35:01,290 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15581 transitions. [2020-02-10 20:35:01,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:35:01,296 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:01,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:35:01,297 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:35:01,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:01,297 INFO L82 PathProgramCache]: Analyzing trace with hash -331390026, now seen corresponding path program 417 times [2020-02-10 20:35:01,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:01,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946928442] [2020-02-10 20:35:01,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:01,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:01,837 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:35:01,965 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:35:01,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:35:01,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946928442] [2020-02-10 20:35:01,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:01,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:35:01,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830170479] [2020-02-10 20:35:01,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:35:01,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:01,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:35:01,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:35:01,975 INFO L87 Difference]: Start difference. First operand 3124 states and 15581 transitions. Second operand 12 states. [2020-02-10 20:35:02,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:02,217 INFO L93 Difference]: Finished difference Result 6035 states and 26853 transitions. [2020-02-10 20:35:02,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:35:02,217 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:35:02,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:02,231 INFO L225 Difference]: With dead ends: 6035 [2020-02-10 20:35:02,231 INFO L226 Difference]: Without dead ends: 6016 [2020-02-10 20:35:02,232 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:35:02,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6016 states. [2020-02-10 20:35:02,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6016 to 3133. [2020-02-10 20:35:02,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-02-10 20:35:02,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15598 transitions. [2020-02-10 20:35:02,416 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15598 transitions. Word has length 31 [2020-02-10 20:35:02,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:02,416 INFO L479 AbstractCegarLoop]: Abstraction has 3133 states and 15598 transitions. [2020-02-10 20:35:02,416 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:35:02,416 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15598 transitions. [2020-02-10 20:35:02,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:35:02,421 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:02,421 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:35:02,422 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:35:02,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:02,422 INFO L82 PathProgramCache]: Analyzing trace with hash -261279990, now seen corresponding path program 418 times [2020-02-10 20:35:02,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:02,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203551752] [2020-02-10 20:35:02,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:02,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:02,961 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:35:03,097 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:35:03,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:35:03,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203551752] [2020-02-10 20:35:03,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:03,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:35:03,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572282742] [2020-02-10 20:35:03,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:35:03,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:03,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:35:03,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:35:03,106 INFO L87 Difference]: Start difference. First operand 3133 states and 15598 transitions. Second operand 12 states. [2020-02-10 20:35:03,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:03,310 INFO L93 Difference]: Finished difference Result 6038 states and 26850 transitions. [2020-02-10 20:35:03,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:35:03,310 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:35:03,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:03,325 INFO L225 Difference]: With dead ends: 6038 [2020-02-10 20:35:03,325 INFO L226 Difference]: Without dead ends: 6007 [2020-02-10 20:35:03,325 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:35:03,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6007 states. [2020-02-10 20:35:03,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6007 to 3124. [2020-02-10 20:35:03,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:35:03,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15575 transitions. [2020-02-10 20:35:03,509 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15575 transitions. Word has length 31 [2020-02-10 20:35:03,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:03,509 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15575 transitions. [2020-02-10 20:35:03,509 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:35:03,510 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15575 transitions. [2020-02-10 20:35:03,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:35:03,515 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:03,515 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:35:03,515 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:35:03,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:03,515 INFO L82 PathProgramCache]: Analyzing trace with hash -966031370, now seen corresponding path program 419 times [2020-02-10 20:35:03,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:03,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961803522] [2020-02-10 20:35:03,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:03,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:04,040 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:35:04,171 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:35:04,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:35:04,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961803522] [2020-02-10 20:35:04,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:04,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:35:04,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978901214] [2020-02-10 20:35:04,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:35:04,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:04,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:35:04,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:35:04,181 INFO L87 Difference]: Start difference. First operand 3124 states and 15575 transitions. Second operand 12 states. [2020-02-10 20:35:04,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:04,489 INFO L93 Difference]: Finished difference Result 6026 states and 26826 transitions. [2020-02-10 20:35:04,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:35:04,490 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:35:04,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:04,504 INFO L225 Difference]: With dead ends: 6026 [2020-02-10 20:35:04,505 INFO L226 Difference]: Without dead ends: 6010 [2020-02-10 20:35:04,505 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:35:04,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6010 states. [2020-02-10 20:35:04,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6010 to 3130. [2020-02-10 20:35:04,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 20:35:04,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15586 transitions. [2020-02-10 20:35:04,695 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15586 transitions. Word has length 31 [2020-02-10 20:35:04,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:04,695 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15586 transitions. [2020-02-10 20:35:04,695 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:35:04,695 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15586 transitions. [2020-02-10 20:35:04,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:35:04,700 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:04,700 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:35:04,700 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:35:04,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:04,701 INFO L82 PathProgramCache]: Analyzing trace with hash -473435608, now seen corresponding path program 420 times [2020-02-10 20:35:04,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:04,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114418412] [2020-02-10 20:35:04,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:04,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:05,240 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:35:05,369 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:35:05,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:35:05,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114418412] [2020-02-10 20:35:05,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:05,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:35:05,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990870495] [2020-02-10 20:35:05,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:35:05,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:05,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:35:05,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:35:05,379 INFO L87 Difference]: Start difference. First operand 3130 states and 15586 transitions. Second operand 12 states. [2020-02-10 20:35:05,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:05,635 INFO L93 Difference]: Finished difference Result 6032 states and 26832 transitions. [2020-02-10 20:35:05,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:35:05,635 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:35:05,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:05,649 INFO L225 Difference]: With dead ends: 6032 [2020-02-10 20:35:05,650 INFO L226 Difference]: Without dead ends: 5998 [2020-02-10 20:35:05,650 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:35:05,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5998 states. [2020-02-10 20:35:05,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5998 to 3118. [2020-02-10 20:35:05,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3118 states. [2020-02-10 20:35:05,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3118 states to 3118 states and 15558 transitions. [2020-02-10 20:35:05,837 INFO L78 Accepts]: Start accepts. Automaton has 3118 states and 15558 transitions. Word has length 31 [2020-02-10 20:35:05,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:05,837 INFO L479 AbstractCegarLoop]: Abstraction has 3118 states and 15558 transitions. [2020-02-10 20:35:05,837 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:35:05,838 INFO L276 IsEmpty]: Start isEmpty. Operand 3118 states and 15558 transitions. [2020-02-10 20:35:05,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:35:05,843 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:05,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:35:05,843 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:35:05,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:05,843 INFO L82 PathProgramCache]: Analyzing trace with hash 191895208, now seen corresponding path program 421 times [2020-02-10 20:35:05,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:05,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393001957] [2020-02-10 20:35:05,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:05,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:06,376 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:35:06,506 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:35:06,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:35:06,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393001957] [2020-02-10 20:35:06,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:06,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:35:06,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595548817] [2020-02-10 20:35:06,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:35:06,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:06,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:35:06,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:35:06,516 INFO L87 Difference]: Start difference. First operand 3118 states and 15558 transitions. Second operand 12 states. [2020-02-10 20:35:06,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:06,742 INFO L93 Difference]: Finished difference Result 6031 states and 26847 transitions. [2020-02-10 20:35:06,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:35:06,743 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:35:06,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:06,758 INFO L225 Difference]: With dead ends: 6031 [2020-02-10 20:35:06,758 INFO L226 Difference]: Without dead ends: 6012 [2020-02-10 20:35:06,758 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:35:06,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6012 states. [2020-02-10 20:35:06,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6012 to 3131. [2020-02-10 20:35:06,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 20:35:06,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15595 transitions. [2020-02-10 20:35:06,941 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15595 transitions. Word has length 31 [2020-02-10 20:35:06,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:06,941 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15595 transitions. [2020-02-10 20:35:06,941 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:35:06,941 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15595 transitions. [2020-02-10 20:35:06,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:35:06,946 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:06,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:35:06,947 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:35:06,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:06,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1920533422, now seen corresponding path program 422 times [2020-02-10 20:35:06,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:06,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468982562] [2020-02-10 20:35:06,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:06,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:07,522 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:35:07,651 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:35:07,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:35:07,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468982562] [2020-02-10 20:35:07,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:07,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:35:07,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592436959] [2020-02-10 20:35:07,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:35:07,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:07,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:35:07,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:35:07,661 INFO L87 Difference]: Start difference. First operand 3131 states and 15595 transitions. Second operand 12 states. [2020-02-10 20:35:07,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:07,896 INFO L93 Difference]: Finished difference Result 6029 states and 26837 transitions. [2020-02-10 20:35:07,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:35:07,896 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:35:07,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:07,911 INFO L225 Difference]: With dead ends: 6029 [2020-02-10 20:35:07,911 INFO L226 Difference]: Without dead ends: 6006 [2020-02-10 20:35:07,911 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:35:08,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6006 states. [2020-02-10 20:35:08,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6006 to 3125. [2020-02-10 20:35:08,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 20:35:08,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15578 transitions. [2020-02-10 20:35:08,095 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15578 transitions. Word has length 31 [2020-02-10 20:35:08,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:08,096 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15578 transitions. [2020-02-10 20:35:08,096 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:35:08,096 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15578 transitions. [2020-02-10 20:35:08,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:35:08,101 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:08,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:35:08,101 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:35:08,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:08,101 INFO L82 PathProgramCache]: Analyzing trace with hash -868882882, now seen corresponding path program 423 times [2020-02-10 20:35:08,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:08,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956398958] [2020-02-10 20:35:08,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:08,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:08,763 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:35:08,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:35:08,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956398958] [2020-02-10 20:35:08,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:08,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:35:08,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922966450] [2020-02-10 20:35:08,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:35:08,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:08,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:35:08,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:35:08,773 INFO L87 Difference]: Start difference. First operand 3125 states and 15578 transitions. Second operand 12 states. [2020-02-10 20:35:09,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:09,022 INFO L93 Difference]: Finished difference Result 6039 states and 26858 transitions. [2020-02-10 20:35:09,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:35:09,022 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:35:09,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:09,037 INFO L225 Difference]: With dead ends: 6039 [2020-02-10 20:35:09,037 INFO L226 Difference]: Without dead ends: 6020 [2020-02-10 20:35:09,037 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:35:09,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6020 states. [2020-02-10 20:35:09,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6020 to 3134. [2020-02-10 20:35:09,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3134 states. [2020-02-10 20:35:09,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3134 states to 3134 states and 15595 transitions. [2020-02-10 20:35:09,220 INFO L78 Accepts]: Start accepts. Automaton has 3134 states and 15595 transitions. Word has length 31 [2020-02-10 20:35:09,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:09,220 INFO L479 AbstractCegarLoop]: Abstraction has 3134 states and 15595 transitions. [2020-02-10 20:35:09,220 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:35:09,220 INFO L276 IsEmpty]: Start isEmpty. Operand 3134 states and 15595 transitions. [2020-02-10 20:35:09,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:35:09,225 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:09,225 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:35:09,225 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:35:09,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:09,226 INFO L82 PathProgramCache]: Analyzing trace with hash -798772846, now seen corresponding path program 424 times [2020-02-10 20:35:09,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:09,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787680191] [2020-02-10 20:35:09,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:09,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:09,766 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-02-10 20:35:09,893 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:35:09,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:35:09,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787680191] [2020-02-10 20:35:09,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:09,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:35:09,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396724175] [2020-02-10 20:35:09,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:35:09,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:09,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:35:09,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:35:09,904 INFO L87 Difference]: Start difference. First operand 3134 states and 15595 transitions. Second operand 12 states. [2020-02-10 20:35:10,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:10,103 INFO L93 Difference]: Finished difference Result 6042 states and 26855 transitions. [2020-02-10 20:35:10,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:35:10,104 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:35:10,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:10,118 INFO L225 Difference]: With dead ends: 6042 [2020-02-10 20:35:10,118 INFO L226 Difference]: Without dead ends: 6011 [2020-02-10 20:35:10,118 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:35:10,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6011 states. [2020-02-10 20:35:10,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6011 to 3125. [2020-02-10 20:35:10,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 20:35:10,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15571 transitions. [2020-02-10 20:35:10,307 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15571 transitions. Word has length 31 [2020-02-10 20:35:10,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:10,307 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15571 transitions. [2020-02-10 20:35:10,307 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:35:10,307 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15571 transitions. [2020-02-10 20:35:10,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:35:10,312 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:10,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 20:35:10,313 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:35:10,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:10,313 INFO L82 PathProgramCache]: Analyzing trace with hash 252877694, now seen corresponding path program 425 times [2020-02-10 20:35:10,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:10,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587311399] [2020-02-10 20:35:10,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:10,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:10,848 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:35:10,980 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:35:10,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:35:10,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587311399] [2020-02-10 20:35:10,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:10,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:35:10,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158668074] [2020-02-10 20:35:10,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:35:10,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:10,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:35:10,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:35:10,991 INFO L87 Difference]: Start difference. First operand 3125 states and 15571 transitions. Second operand 12 states. [2020-02-10 20:35:11,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:11,252 INFO L93 Difference]: Finished difference Result 6033 states and 26837 transitions. [2020-02-10 20:35:11,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:35:11,253 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:35:11,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:11,268 INFO L225 Difference]: With dead ends: 6033 [2020-02-10 20:35:11,268 INFO L226 Difference]: Without dead ends: 6016 [2020-02-10 20:35:11,269 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:35:11,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6016 states. [2020-02-10 20:35:11,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6016 to 3132. [2020-02-10 20:35:11,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-02-10 20:35:11,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15584 transitions. [2020-02-10 20:35:11,457 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15584 transitions. Word has length 31 [2020-02-10 20:35:11,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:11,457 INFO L479 AbstractCegarLoop]: Abstraction has 3132 states and 15584 transitions. [2020-02-10 20:35:11,457 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:35:11,457 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15584 transitions. [2020-02-10 20:35:11,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:35:11,462 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:11,462 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:35:11,462 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:35:11,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:11,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1859550936, now seen corresponding path program 426 times [2020-02-10 20:35:11,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:11,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100477849] [2020-02-10 20:35:11,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:11,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:11,997 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:35:12,125 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:35:12,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:35:12,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100477849] [2020-02-10 20:35:12,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:12,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:35:12,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851358157] [2020-02-10 20:35:12,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:35:12,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:12,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:35:12,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:35:12,135 INFO L87 Difference]: Start difference. First operand 3132 states and 15584 transitions. Second operand 12 states. [2020-02-10 20:35:12,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:12,343 INFO L93 Difference]: Finished difference Result 6038 states and 26840 transitions. [2020-02-10 20:35:12,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:35:12,344 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:35:12,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:12,358 INFO L225 Difference]: With dead ends: 6038 [2020-02-10 20:35:12,359 INFO L226 Difference]: Without dead ends: 6002 [2020-02-10 20:35:12,359 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:35:12,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6002 states. [2020-02-10 20:35:12,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6002 to 3118. [2020-02-10 20:35:12,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3118 states. [2020-02-10 20:35:12,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3118 states to 3118 states and 15552 transitions. [2020-02-10 20:35:12,547 INFO L78 Accepts]: Start accepts. Automaton has 3118 states and 15552 transitions. Word has length 31 [2020-02-10 20:35:12,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:12,547 INFO L479 AbstractCegarLoop]: Abstraction has 3118 states and 15552 transitions. [2020-02-10 20:35:12,548 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:35:12,548 INFO L276 IsEmpty]: Start isEmpty. Operand 3118 states and 15552 transitions. [2020-02-10 20:35:12,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:35:12,553 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:12,553 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:35:12,553 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:35:12,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:12,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1570364298, now seen corresponding path program 427 times [2020-02-10 20:35:12,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:12,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221935467] [2020-02-10 20:35:12,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:12,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:13,088 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:35:13,220 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:35:13,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:35:13,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221935467] [2020-02-10 20:35:13,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:13,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:35:13,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792258637] [2020-02-10 20:35:13,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:35:13,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:13,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:35:13,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:35:13,230 INFO L87 Difference]: Start difference. First operand 3118 states and 15552 transitions. Second operand 12 states. [2020-02-10 20:35:13,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:13,465 INFO L93 Difference]: Finished difference Result 6016 states and 26804 transitions. [2020-02-10 20:35:13,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:35:13,466 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:35:13,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:13,480 INFO L225 Difference]: With dead ends: 6016 [2020-02-10 20:35:13,480 INFO L226 Difference]: Without dead ends: 6000 [2020-02-10 20:35:13,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:35:13,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6000 states. [2020-02-10 20:35:13,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6000 to 3129. [2020-02-10 20:35:13,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 20:35:13,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15583 transitions. [2020-02-10 20:35:13,665 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15583 transitions. Word has length 31 [2020-02-10 20:35:13,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:13,665 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15583 transitions. [2020-02-10 20:35:13,665 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:35:13,665 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15583 transitions. [2020-02-10 20:35:13,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:35:13,670 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:13,671 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:35:13,671 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:35:13,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:13,671 INFO L82 PathProgramCache]: Analyzing trace with hash -119578606, now seen corresponding path program 428 times [2020-02-10 20:35:13,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:13,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130127444] [2020-02-10 20:35:13,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:13,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:14,207 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:35:14,341 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:35:14,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:35:14,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130127444] [2020-02-10 20:35:14,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:14,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:35:14,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991019526] [2020-02-10 20:35:14,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:35:14,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:14,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:35:14,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:35:14,351 INFO L87 Difference]: Start difference. First operand 3129 states and 15583 transitions. Second operand 12 states. [2020-02-10 20:35:14,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:14,592 INFO L93 Difference]: Finished difference Result 6017 states and 26801 transitions. [2020-02-10 20:35:14,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:35:14,592 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:35:14,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:14,607 INFO L225 Difference]: With dead ends: 6017 [2020-02-10 20:35:14,608 INFO L226 Difference]: Without dead ends: 5995 [2020-02-10 20:35:14,608 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:35:14,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5995 states. [2020-02-10 20:35:14,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5995 to 3124. [2020-02-10 20:35:14,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:35:14,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15569 transitions. [2020-02-10 20:35:14,840 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15569 transitions. Word has length 31 [2020-02-10 20:35:14,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:14,840 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15569 transitions. [2020-02-10 20:35:14,840 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:35:14,840 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15569 transitions. [2020-02-10 20:35:14,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:35:14,845 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:14,845 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:35:14,845 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:35:14,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:14,846 INFO L82 PathProgramCache]: Analyzing trace with hash 509586208, now seen corresponding path program 429 times [2020-02-10 20:35:14,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:14,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284783914] [2020-02-10 20:35:14,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:14,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:15,377 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:35:15,505 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:35:15,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:35:15,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284783914] [2020-02-10 20:35:15,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:15,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:35:15,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899193039] [2020-02-10 20:35:15,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:35:15,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:15,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:35:15,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:35:15,515 INFO L87 Difference]: Start difference. First operand 3124 states and 15569 transitions. Second operand 12 states. [2020-02-10 20:35:15,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:15,782 INFO L93 Difference]: Finished difference Result 6022 states and 26810 transitions. [2020-02-10 20:35:15,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:35:15,782 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:35:15,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:15,797 INFO L225 Difference]: With dead ends: 6022 [2020-02-10 20:35:15,797 INFO L226 Difference]: Without dead ends: 6006 [2020-02-10 20:35:15,797 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:35:15,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6006 states. [2020-02-10 20:35:15,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6006 to 3130. [2020-02-10 20:35:15,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 20:35:15,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15580 transitions. [2020-02-10 20:35:15,982 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15580 transitions. Word has length 31 [2020-02-10 20:35:15,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:15,982 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15580 transitions. [2020-02-10 20:35:15,982 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:35:15,982 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15580 transitions. [2020-02-10 20:35:15,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:35:15,987 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:15,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:35:15,987 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:35:15,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:15,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1002181970, now seen corresponding path program 430 times [2020-02-10 20:35:15,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:15,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898270527] [2020-02-10 20:35:15,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:15,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:16,527 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:35:16,659 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:35:16,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:35:16,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898270527] [2020-02-10 20:35:16,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:16,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:35:16,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911331109] [2020-02-10 20:35:16,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:35:16,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:16,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:35:16,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:35:16,668 INFO L87 Difference]: Start difference. First operand 3130 states and 15580 transitions. Second operand 12 states. [2020-02-10 20:35:16,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:16,858 INFO L93 Difference]: Finished difference Result 6028 states and 26816 transitions. [2020-02-10 20:35:16,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:35:16,858 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:35:16,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:16,872 INFO L225 Difference]: With dead ends: 6028 [2020-02-10 20:35:16,872 INFO L226 Difference]: Without dead ends: 6000 [2020-02-10 20:35:16,872 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:35:17,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6000 states. [2020-02-10 20:35:17,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6000 to 3124. [2020-02-10 20:35:17,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:35:17,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15563 transitions. [2020-02-10 20:35:17,061 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15563 transitions. Word has length 31 [2020-02-10 20:35:17,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:17,061 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15563 transitions. [2020-02-10 20:35:17,061 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:35:17,061 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15563 transitions. [2020-02-10 20:35:17,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:35:17,066 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:17,066 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:35:17,066 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:35:17,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:17,067 INFO L82 PathProgramCache]: Analyzing trace with hash -2028979168, now seen corresponding path program 431 times [2020-02-10 20:35:17,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:17,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319812453] [2020-02-10 20:35:17,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:17,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:17,592 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:35:17,724 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:35:17,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:35:17,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319812453] [2020-02-10 20:35:17,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:17,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:35:17,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515445417] [2020-02-10 20:35:17,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:35:17,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:17,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:35:17,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:35:17,734 INFO L87 Difference]: Start difference. First operand 3124 states and 15563 transitions. Second operand 12 states. [2020-02-10 20:35:17,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:17,990 INFO L93 Difference]: Finished difference Result 6025 states and 26811 transitions. [2020-02-10 20:35:17,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:35:17,991 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:35:17,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:18,006 INFO L225 Difference]: With dead ends: 6025 [2020-02-10 20:35:18,006 INFO L226 Difference]: Without dead ends: 6008 [2020-02-10 20:35:18,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 20:35:18,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6008 states. [2020-02-10 20:35:18,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6008 to 3131. [2020-02-10 20:35:18,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 20:35:18,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15576 transitions. [2020-02-10 20:35:18,194 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15576 transitions. Word has length 31 [2020-02-10 20:35:18,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:18,195 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15576 transitions. [2020-02-10 20:35:18,195 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:35:18,195 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15576 transitions. [2020-02-10 20:35:18,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:35:18,200 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:18,200 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:35:18,200 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:35:18,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:18,200 INFO L82 PathProgramCache]: Analyzing trace with hash 153559498, now seen corresponding path program 432 times [2020-02-10 20:35:18,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:18,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488164731] [2020-02-10 20:35:18,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:18,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:18,740 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-02-10 20:35:18,872 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:35:18,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:35:18,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488164731] [2020-02-10 20:35:18,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:18,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:35:18,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926364429] [2020-02-10 20:35:18,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:35:18,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:18,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:35:18,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:35:18,883 INFO L87 Difference]: Start difference. First operand 3131 states and 15576 transitions. Second operand 12 states. [2020-02-10 20:35:19,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:19,077 INFO L93 Difference]: Finished difference Result 6030 states and 26814 transitions. [2020-02-10 20:35:19,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:35:19,078 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:35:19,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:19,092 INFO L225 Difference]: With dead ends: 6030 [2020-02-10 20:35:19,093 INFO L226 Difference]: Without dead ends: 5989 [2020-02-10 20:35:19,093 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:35:19,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5989 states. [2020-02-10 20:35:19,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5989 to 3112. [2020-02-10 20:35:19,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3112 states. [2020-02-10 20:35:19,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3112 states to 3112 states and 15535 transitions. [2020-02-10 20:35:19,276 INFO L78 Accepts]: Start accepts. Automaton has 3112 states and 15535 transitions. Word has length 31 [2020-02-10 20:35:19,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:19,276 INFO L479 AbstractCegarLoop]: Abstraction has 3112 states and 15535 transitions. [2020-02-10 20:35:19,276 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:35:19,276 INFO L276 IsEmpty]: Start isEmpty. Operand 3112 states and 15535 transitions. [2020-02-10 20:35:19,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:35:19,281 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:19,281 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:35:19,281 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:35:19,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:19,282 INFO L82 PathProgramCache]: Analyzing trace with hash -331869382, now seen corresponding path program 433 times [2020-02-10 20:35:19,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:19,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510819764] [2020-02-10 20:35:19,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:19,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:19,817 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:35:19,946 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:35:19,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:35:19,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510819764] [2020-02-10 20:35:19,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:19,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:35:19,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258007343] [2020-02-10 20:35:19,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:35:19,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:19,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:35:19,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:35:19,955 INFO L87 Difference]: Start difference. First operand 3112 states and 15535 transitions. Second operand 12 states. [2020-02-10 20:35:20,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:20,255 INFO L93 Difference]: Finished difference Result 6055 states and 26922 transitions. [2020-02-10 20:35:20,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:35:20,255 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:35:20,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:20,270 INFO L225 Difference]: With dead ends: 6055 [2020-02-10 20:35:20,270 INFO L226 Difference]: Without dead ends: 6036 [2020-02-10 20:35:20,270 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:35:20,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6036 states. [2020-02-10 20:35:20,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6036 to 3135. [2020-02-10 20:35:20,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2020-02-10 20:35:20,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 15611 transitions. [2020-02-10 20:35:20,455 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 15611 transitions. Word has length 31 [2020-02-10 20:35:20,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:20,455 INFO L479 AbstractCegarLoop]: Abstraction has 3135 states and 15611 transitions. [2020-02-10 20:35:20,455 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:35:20,455 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 15611 transitions. [2020-02-10 20:35:20,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:35:20,462 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:20,462 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:35:20,462 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:35:20,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:20,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1599326560, now seen corresponding path program 434 times [2020-02-10 20:35:20,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:20,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567859247] [2020-02-10 20:35:20,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:20,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:21,013 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:35:21,140 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:35:21,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:35:21,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567859247] [2020-02-10 20:35:21,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:21,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:35:21,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709839814] [2020-02-10 20:35:21,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:35:21,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:21,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:35:21,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:35:21,150 INFO L87 Difference]: Start difference. First operand 3135 states and 15611 transitions. Second operand 12 states. [2020-02-10 20:35:21,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:21,395 INFO L93 Difference]: Finished difference Result 6056 states and 26916 transitions. [2020-02-10 20:35:21,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:35:21,396 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:35:21,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:21,410 INFO L225 Difference]: With dead ends: 6056 [2020-02-10 20:35:21,411 INFO L226 Difference]: Without dead ends: 6028 [2020-02-10 20:35:21,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:35:21,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6028 states. [2020-02-10 20:35:21,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6028 to 3127. [2020-02-10 20:35:21,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:35:21,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15590 transitions. [2020-02-10 20:35:21,594 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15590 transitions. Word has length 31 [2020-02-10 20:35:21,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:21,594 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15590 transitions. [2020-02-10 20:35:21,594 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:35:21,594 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15590 transitions. [2020-02-10 20:35:21,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:35:21,599 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:21,599 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:35:21,599 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:35:21,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:21,599 INFO L82 PathProgramCache]: Analyzing trace with hash -756180618, now seen corresponding path program 435 times [2020-02-10 20:35:21,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:21,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655014724] [2020-02-10 20:35:21,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:21,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:22,140 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:35:22,273 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:35:22,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 20:35:22,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655014724] [2020-02-10 20:35:22,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:22,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:35:22,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122798805] [2020-02-10 20:35:22,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:35:22,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:22,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:35:22,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:35:22,283 INFO L87 Difference]: Start difference. First operand 3127 states and 15590 transitions. Second operand 12 states. [2020-02-10 20:35:22,536 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 36 [2020-02-10 20:35:22,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:22,556 INFO L93 Difference]: Finished difference Result 6050 states and 26904 transitions. [2020-02-10 20:35:22,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:35:22,557 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:35:22,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:22,573 INFO L225 Difference]: With dead ends: 6050 [2020-02-10 20:35:22,573 INFO L226 Difference]: Without dead ends: 6031 [2020-02-10 20:35:22,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:35:22,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6031 states. [2020-02-10 20:35:22,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6031 to 3133. [2020-02-10 20:35:22,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-02-10 20:35:22,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15601 transitions. [2020-02-10 20:35:22,755 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15601 transitions. Word has length 31 [2020-02-10 20:35:22,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:22,755 INFO L479 AbstractCegarLoop]: Abstraction has 3133 states and 15601 transitions. [2020-02-10 20:35:22,755 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:35:22,755 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15601 transitions. [2020-02-10 20:35:22,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:35:22,760 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:22,760 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:35:22,760 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:35:22,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:22,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1426358048, now seen corresponding path program 436 times [2020-02-10 20:35:22,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:22,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636029129] [2020-02-10 20:35:22,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:22,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:23,294 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:35:23,425 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:35:23,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:35:23,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636029129] [2020-02-10 20:35:23,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:23,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:35:23,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761687599] [2020-02-10 20:35:23,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:35:23,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:23,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:35:23,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:35:23,435 INFO L87 Difference]: Start difference. First operand 3133 states and 15601 transitions. Second operand 12 states. [2020-02-10 20:35:23,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:23,712 INFO L93 Difference]: Finished difference Result 6048 states and 26894 transitions. [2020-02-10 20:35:23,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:35:23,713 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:35:23,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:23,727 INFO L225 Difference]: With dead ends: 6048 [2020-02-10 20:35:23,728 INFO L226 Difference]: Without dead ends: 6025 [2020-02-10 20:35:23,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:35:23,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6025 states. [2020-02-10 20:35:23,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6025 to 3127. [2020-02-10 20:35:23,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:35:23,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15584 transitions. [2020-02-10 20:35:23,916 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15584 transitions. Word has length 31 [2020-02-10 20:35:23,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:23,916 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15584 transitions. [2020-02-10 20:35:23,916 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:35:23,917 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15584 transitions. [2020-02-10 20:35:23,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:35:23,921 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:23,922 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:35:23,922 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:35:23,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:23,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1634862646, now seen corresponding path program 437 times [2020-02-10 20:35:23,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:23,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521431423] [2020-02-10 20:35:23,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:23,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:24,584 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:35:24,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:35:24,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521431423] [2020-02-10 20:35:24,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:24,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:35:24,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564812613] [2020-02-10 20:35:24,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:35:24,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:24,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:35:24,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:35:24,595 INFO L87 Difference]: Start difference. First operand 3127 states and 15584 transitions. Second operand 12 states. [2020-02-10 20:35:24,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:24,948 INFO L93 Difference]: Finished difference Result 6052 states and 26902 transitions. [2020-02-10 20:35:24,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:35:24,949 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:35:24,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:24,963 INFO L225 Difference]: With dead ends: 6052 [2020-02-10 20:35:24,963 INFO L226 Difference]: Without dead ends: 6032 [2020-02-10 20:35:24,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:35:25,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6032 states. [2020-02-10 20:35:25,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6032 to 3133. [2020-02-10 20:35:25,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-02-10 20:35:25,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15595 transitions. [2020-02-10 20:35:25,152 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15595 transitions. Word has length 31 [2020-02-10 20:35:25,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:25,152 INFO L479 AbstractCegarLoop]: Abstraction has 3133 states and 15595 transitions. [2020-02-10 20:35:25,152 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:35:25,152 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15595 transitions. [2020-02-10 20:35:25,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:35:25,157 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:25,157 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:35:25,157 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:35:25,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:25,157 INFO L82 PathProgramCache]: Analyzing trace with hash 789891194, now seen corresponding path program 438 times [2020-02-10 20:35:25,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:25,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892807718] [2020-02-10 20:35:25,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:25,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:25,699 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:35:25,828 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:35:25,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:35:25,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892807718] [2020-02-10 20:35:25,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:25,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:35:25,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490418865] [2020-02-10 20:35:25,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:35:25,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:25,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:35:25,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:35:25,839 INFO L87 Difference]: Start difference. First operand 3133 states and 15595 transitions. Second operand 12 states. [2020-02-10 20:35:26,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:26,165 INFO L93 Difference]: Finished difference Result 6049 states and 26890 transitions. [2020-02-10 20:35:26,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:35:26,166 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:35:26,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:26,180 INFO L225 Difference]: With dead ends: 6049 [2020-02-10 20:35:26,181 INFO L226 Difference]: Without dead ends: 6020 [2020-02-10 20:35:26,181 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:35:26,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6020 states. [2020-02-10 20:35:26,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6020 to 3121. [2020-02-10 20:35:26,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 20:35:26,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15567 transitions. [2020-02-10 20:35:26,370 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15567 transitions. Word has length 31 [2020-02-10 20:35:26,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:26,370 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15567 transitions. [2020-02-10 20:35:26,370 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:35:26,370 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15567 transitions. [2020-02-10 20:35:26,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:35:26,375 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:26,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:35:26,375 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:35:26,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:26,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1143748196, now seen corresponding path program 439 times [2020-02-10 20:35:26,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:26,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356554835] [2020-02-10 20:35:26,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:26,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:26,938 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:35:27,070 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:35:27,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:35:27,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356554835] [2020-02-10 20:35:27,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:27,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:35:27,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033283126] [2020-02-10 20:35:27,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:35:27,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:27,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:35:27,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:35:27,080 INFO L87 Difference]: Start difference. First operand 3121 states and 15567 transitions. Second operand 12 states. [2020-02-10 20:35:27,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:27,442 INFO L93 Difference]: Finished difference Result 6073 states and 26959 transitions. [2020-02-10 20:35:27,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:35:27,442 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:35:27,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:27,460 INFO L225 Difference]: With dead ends: 6073 [2020-02-10 20:35:27,460 INFO L226 Difference]: Without dead ends: 6054 [2020-02-10 20:35:27,460 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:35:27,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6054 states. [2020-02-10 20:35:27,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6054 to 3140. [2020-02-10 20:35:27,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3140 states. [2020-02-10 20:35:27,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3140 states to 3140 states and 15619 transitions. [2020-02-10 20:35:27,650 INFO L78 Accepts]: Start accepts. Automaton has 3140 states and 15619 transitions. Word has length 31 [2020-02-10 20:35:27,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:27,650 INFO L479 AbstractCegarLoop]: Abstraction has 3140 states and 15619 transitions. [2020-02-10 20:35:27,650 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:35:27,650 INFO L276 IsEmpty]: Start isEmpty. Operand 3140 states and 15619 transitions. [2020-02-10 20:35:27,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:35:27,655 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:27,655 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:35:27,655 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:35:27,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:27,656 INFO L82 PathProgramCache]: Analyzing trace with hash -123708982, now seen corresponding path program 440 times [2020-02-10 20:35:27,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:27,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725893806] [2020-02-10 20:35:27,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:27,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:28,216 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:35:28,351 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:35:28,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:35:28,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725893806] [2020-02-10 20:35:28,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:28,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:35:28,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32863141] [2020-02-10 20:35:28,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:35:28,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:28,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:35:28,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:35:28,361 INFO L87 Difference]: Start difference. First operand 3140 states and 15619 transitions. Second operand 12 states. [2020-02-10 20:35:28,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:28,690 INFO L93 Difference]: Finished difference Result 6074 states and 26953 transitions. [2020-02-10 20:35:28,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:35:28,690 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:35:28,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:28,704 INFO L225 Difference]: With dead ends: 6074 [2020-02-10 20:35:28,705 INFO L226 Difference]: Without dead ends: 6046 [2020-02-10 20:35:28,705 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:35:28,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6046 states. [2020-02-10 20:35:28,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6046 to 3132. [2020-02-10 20:35:28,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-02-10 20:35:28,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15596 transitions. [2020-02-10 20:35:28,887 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15596 transitions. Word has length 31 [2020-02-10 20:35:28,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:28,887 INFO L479 AbstractCegarLoop]: Abstraction has 3132 states and 15596 transitions. [2020-02-10 20:35:28,887 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:35:28,887 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15596 transitions. [2020-02-10 20:35:28,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:35:28,892 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:28,892 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:35:28,892 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:35:28,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:28,893 INFO L82 PathProgramCache]: Analyzing trace with hash -341341130, now seen corresponding path program 441 times [2020-02-10 20:35:28,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:28,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473930323] [2020-02-10 20:35:28,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:28,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:29,448 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:35:29,579 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:35:29,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:35:29,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473930323] [2020-02-10 20:35:29,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:29,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:35:29,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47699085] [2020-02-10 20:35:29,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:35:29,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:29,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:35:29,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:35:29,590 INFO L87 Difference]: Start difference. First operand 3132 states and 15596 transitions. Second operand 12 states. [2020-02-10 20:35:29,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:29,919 INFO L93 Difference]: Finished difference Result 6076 states and 26956 transitions. [2020-02-10 20:35:29,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:35:29,919 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:35:29,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:29,934 INFO L225 Difference]: With dead ends: 6076 [2020-02-10 20:35:29,934 INFO L226 Difference]: Without dead ends: 6057 [2020-02-10 20:35:29,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:35:30,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6057 states. [2020-02-10 20:35:30,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6057 to 3141. [2020-02-10 20:35:30,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3141 states. [2020-02-10 20:35:30,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3141 states to 3141 states and 15613 transitions. [2020-02-10 20:35:30,120 INFO L78 Accepts]: Start accepts. Automaton has 3141 states and 15613 transitions. Word has length 31 [2020-02-10 20:35:30,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:30,120 INFO L479 AbstractCegarLoop]: Abstraction has 3141 states and 15613 transitions. [2020-02-10 20:35:30,120 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:35:30,120 INFO L276 IsEmpty]: Start isEmpty. Operand 3141 states and 15613 transitions. [2020-02-10 20:35:30,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:35:30,125 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:30,125 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:35:30,126 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:35:30,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:30,126 INFO L82 PathProgramCache]: Analyzing trace with hash -271231094, now seen corresponding path program 442 times [2020-02-10 20:35:30,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:30,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495394913] [2020-02-10 20:35:30,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:30,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:30,502 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 28 [2020-02-10 20:35:30,742 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-02-10 20:35:30,872 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:35:30,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:35:30,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495394913] [2020-02-10 20:35:30,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:30,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:35:30,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218498377] [2020-02-10 20:35:30,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:35:30,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:30,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:35:30,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:35:30,882 INFO L87 Difference]: Start difference. First operand 3141 states and 15613 transitions. Second operand 12 states. [2020-02-10 20:35:31,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:31,206 INFO L93 Difference]: Finished difference Result 6079 states and 26953 transitions. [2020-02-10 20:35:31,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:35:31,206 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:35:31,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:31,221 INFO L225 Difference]: With dead ends: 6079 [2020-02-10 20:35:31,221 INFO L226 Difference]: Without dead ends: 6048 [2020-02-10 20:35:31,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:35:31,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6048 states. [2020-02-10 20:35:31,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6048 to 3132. [2020-02-10 20:35:31,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-02-10 20:35:31,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15587 transitions. [2020-02-10 20:35:31,406 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15587 transitions. Word has length 31 [2020-02-10 20:35:31,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:31,406 INFO L479 AbstractCegarLoop]: Abstraction has 3132 states and 15587 transitions. [2020-02-10 20:35:31,406 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:35:31,406 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15587 transitions. [2020-02-10 20:35:31,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:35:31,411 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:31,411 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:35:31,412 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:35:31,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:31,412 INFO L82 PathProgramCache]: Analyzing trace with hash 2049702134, now seen corresponding path program 443 times [2020-02-10 20:35:31,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:31,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911571067] [2020-02-10 20:35:31,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:31,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:31,973 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:35:32,107 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:35:32,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:35:32,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911571067] [2020-02-10 20:35:32,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:32,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:35:32,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131155716] [2020-02-10 20:35:32,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:35:32,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:32,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:35:32,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:35:32,117 INFO L87 Difference]: Start difference. First operand 3132 states and 15587 transitions. Second operand 12 states. [2020-02-10 20:35:32,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:32,391 INFO L93 Difference]: Finished difference Result 6080 states and 26955 transitions. [2020-02-10 20:35:32,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:35:32,391 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:35:32,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:32,405 INFO L225 Difference]: With dead ends: 6080 [2020-02-10 20:35:32,405 INFO L226 Difference]: Without dead ends: 6060 [2020-02-10 20:35:32,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:35:32,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6060 states. [2020-02-10 20:35:32,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6060 to 3143. [2020-02-10 20:35:32,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3143 states. [2020-02-10 20:35:32,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3143 states to 3143 states and 15607 transitions. [2020-02-10 20:35:32,594 INFO L78 Accepts]: Start accepts. Automaton has 3143 states and 15607 transitions. Word has length 31 [2020-02-10 20:35:32,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:32,595 INFO L479 AbstractCegarLoop]: Abstraction has 3143 states and 15607 transitions. [2020-02-10 20:35:32,595 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:35:32,595 INFO L276 IsEmpty]: Start isEmpty. Operand 3143 states and 15607 transitions. [2020-02-10 20:35:32,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:35:32,600 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:32,600 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:35:32,600 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:35:32,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:32,600 INFO L82 PathProgramCache]: Analyzing trace with hash -907697948, now seen corresponding path program 444 times [2020-02-10 20:35:32,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:32,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665700941] [2020-02-10 20:35:32,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:32,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:33,163 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:35:33,294 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:35:33,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:35:33,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665700941] [2020-02-10 20:35:33,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:33,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:35:33,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058906859] [2020-02-10 20:35:33,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:35:33,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:33,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:35:33,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:35:33,303 INFO L87 Difference]: Start difference. First operand 3143 states and 15607 transitions. Second operand 12 states. [2020-02-10 20:35:33,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:33,474 INFO L93 Difference]: Finished difference Result 6082 states and 26949 transitions. [2020-02-10 20:35:33,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:35:33,474 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:35:33,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:33,489 INFO L225 Difference]: With dead ends: 6082 [2020-02-10 20:35:33,489 INFO L226 Difference]: Without dead ends: 6038 [2020-02-10 20:35:33,489 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:35:33,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6038 states. [2020-02-10 20:35:33,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6038 to 3121. [2020-02-10 20:35:33,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 20:35:33,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15558 transitions. [2020-02-10 20:35:33,677 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15558 transitions. Word has length 31 [2020-02-10 20:35:33,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:33,677 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15558 transitions. [2020-02-10 20:35:33,678 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:35:33,678 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15558 transitions. [2020-02-10 20:35:33,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:35:33,683 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:33,683 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:35:33,683 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:35:33,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:33,683 INFO L82 PathProgramCache]: Analyzing trace with hash 450690532, now seen corresponding path program 445 times [2020-02-10 20:35:33,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:33,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815652159] [2020-02-10 20:35:33,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:33,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:34,224 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:35:34,355 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:35:34,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:35:34,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815652159] [2020-02-10 20:35:34,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:34,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:35:34,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775224244] [2020-02-10 20:35:34,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:35:34,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:34,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:35:34,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:35:34,365 INFO L87 Difference]: Start difference. First operand 3121 states and 15558 transitions. Second operand 12 states. [2020-02-10 20:35:34,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:34,590 INFO L93 Difference]: Finished difference Result 6055 states and 26905 transitions. [2020-02-10 20:35:34,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:35:34,590 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:35:34,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:34,605 INFO L225 Difference]: With dead ends: 6055 [2020-02-10 20:35:34,605 INFO L226 Difference]: Without dead ends: 6036 [2020-02-10 20:35: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:35:34,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6036 states. [2020-02-10 20:35:34,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6036 to 3134. [2020-02-10 20:35:34,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3134 states. [2020-02-10 20:35:34,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3134 states to 3134 states and 15595 transitions. [2020-02-10 20:35:34,792 INFO L78 Accepts]: Start accepts. Automaton has 3134 states and 15595 transitions. Word has length 31 [2020-02-10 20:35:34,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:34,792 INFO L479 AbstractCegarLoop]: Abstraction has 3134 states and 15595 transitions. [2020-02-10 20:35:34,792 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:35:34,792 INFO L276 IsEmpty]: Start isEmpty. Operand 3134 states and 15595 transitions. [2020-02-10 20:35:34,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:35:34,797 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:34,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:35:34,797 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:35:34,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:34,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1661738098, now seen corresponding path program 446 times [2020-02-10 20:35:34,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:34,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861000593] [2020-02-10 20:35:34,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:34,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:35,334 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:35:35,467 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:35:35,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:35:35,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861000593] [2020-02-10 20:35:35,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:35,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:35:35,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210469973] [2020-02-10 20:35:35,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:35:35,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:35,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:35:35,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:35:35,477 INFO L87 Difference]: Start difference. First operand 3134 states and 15595 transitions. Second operand 12 states. [2020-02-10 20:35:35,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:35,706 INFO L93 Difference]: Finished difference Result 6053 states and 26895 transitions. [2020-02-10 20:35:35,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:35:35,707 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:35:35,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:35,722 INFO L225 Difference]: With dead ends: 6053 [2020-02-10 20:35:35,722 INFO L226 Difference]: Without dead ends: 6030 [2020-02-10 20:35:35,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:35:35,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6030 states. [2020-02-10 20:35:35,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6030 to 3128. [2020-02-10 20:35:35,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 20:35:35,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15578 transitions. [2020-02-10 20:35:35,903 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15578 transitions. Word has length 31 [2020-02-10 20:35:35,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:35,904 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15578 transitions. [2020-02-10 20:35:35,904 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:35:35,904 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15578 transitions. [2020-02-10 20:35:35,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:35:35,909 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:35,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:35:35,909 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:35:35,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:35,909 INFO L82 PathProgramCache]: Analyzing trace with hash -610087558, now seen corresponding path program 447 times [2020-02-10 20:35:35,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:35,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16127091] [2020-02-10 20:35:35,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:35,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:36,459 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:35:36,590 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:35:36,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:35:36,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16127091] [2020-02-10 20:35:36,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:36,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:35:36,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530287776] [2020-02-10 20:35:36,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:35:36,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:36,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:35:36,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:35:36,600 INFO L87 Difference]: Start difference. First operand 3128 states and 15578 transitions. Second operand 12 states. [2020-02-10 20:35:36,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:36,842 INFO L93 Difference]: Finished difference Result 6063 states and 26916 transitions. [2020-02-10 20:35:36,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:35:36,842 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:35:36,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:36,857 INFO L225 Difference]: With dead ends: 6063 [2020-02-10 20:35:36,858 INFO L226 Difference]: Without dead ends: 6044 [2020-02-10 20:35:36,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:35:36,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6044 states. [2020-02-10 20:35:37,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6044 to 3137. [2020-02-10 20:35:37,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3137 states. [2020-02-10 20:35:37,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3137 states to 3137 states and 15595 transitions. [2020-02-10 20:35:37,040 INFO L78 Accepts]: Start accepts. Automaton has 3137 states and 15595 transitions. Word has length 31 [2020-02-10 20:35:37,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:37,041 INFO L479 AbstractCegarLoop]: Abstraction has 3137 states and 15595 transitions. [2020-02-10 20:35:37,041 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:35:37,041 INFO L276 IsEmpty]: Start isEmpty. Operand 3137 states and 15595 transitions. [2020-02-10 20:35:37,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:35:37,046 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:37,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:35:37,046 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:35:37,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:37,046 INFO L82 PathProgramCache]: Analyzing trace with hash -539977522, now seen corresponding path program 448 times [2020-02-10 20:35:37,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:37,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560415584] [2020-02-10 20:35:37,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:37,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:37,602 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:35:37,737 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:35:37,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:35:37,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560415584] [2020-02-10 20:35:37,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:37,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:35:37,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384431828] [2020-02-10 20:35:37,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:35:37,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:37,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:35:37,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:35:37,746 INFO L87 Difference]: Start difference. First operand 3137 states and 15595 transitions. Second operand 12 states. [2020-02-10 20:35:38,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:38,019 INFO L93 Difference]: Finished difference Result 6066 states and 26913 transitions. [2020-02-10 20:35:38,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:35:38,020 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:35:38,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:38,034 INFO L225 Difference]: With dead ends: 6066 [2020-02-10 20:35:38,035 INFO L226 Difference]: Without dead ends: 6035 [2020-02-10 20:35:38,035 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:35:38,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6035 states. [2020-02-10 20:35:38,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6035 to 3128. [2020-02-10 20:35:38,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 20:35:38,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15571 transitions. [2020-02-10 20:35:38,216 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15571 transitions. Word has length 31 [2020-02-10 20:35:38,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:38,216 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15571 transitions. [2020-02-10 20:35:38,217 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:35:38,217 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15571 transitions. [2020-02-10 20:35:38,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:35:38,222 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:38,222 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:35:38,222 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:35:38,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:38,222 INFO L82 PathProgramCache]: Analyzing trace with hash 511673018, now seen corresponding path program 449 times [2020-02-10 20:35:38,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:38,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976590474] [2020-02-10 20:35:38,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:38,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:38,796 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:35:38,927 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:35:38,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:35:38,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976590474] [2020-02-10 20:35:38,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:38,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:35:38,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123903841] [2020-02-10 20:35:38,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:35:38,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:38,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:35:38,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:35:38,937 INFO L87 Difference]: Start difference. First operand 3128 states and 15571 transitions. Second operand 12 states. [2020-02-10 20:35:39,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:39,240 INFO L93 Difference]: Finished difference Result 6057 states and 26895 transitions. [2020-02-10 20:35:39,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:35:39,240 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:35:39,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:39,254 INFO L225 Difference]: With dead ends: 6057 [2020-02-10 20:35:39,255 INFO L226 Difference]: Without dead ends: 6040 [2020-02-10 20:35:39,255 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:35:39,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6040 states. [2020-02-10 20:35:39,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6040 to 3135. [2020-02-10 20:35:39,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2020-02-10 20:35:39,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 15584 transitions. [2020-02-10 20:35:39,442 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 15584 transitions. Word has length 31 [2020-02-10 20:35:39,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:39,442 INFO L479 AbstractCegarLoop]: Abstraction has 3135 states and 15584 transitions. [2020-02-10 20:35:39,442 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:35:39,442 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 15584 transitions. [2020-02-10 20:35:39,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:35:39,447 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:39,447 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:35:39,447 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:35:39,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:39,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1600755612, now seen corresponding path program 450 times [2020-02-10 20:35:39,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:39,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752967530] [2020-02-10 20:35:39,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:39,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:40,000 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:35:40,129 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:35:40,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:35:40,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752967530] [2020-02-10 20:35:40,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:40,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:35:40,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206717625] [2020-02-10 20:35:40,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:35:40,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:40,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:35:40,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:35:40,139 INFO L87 Difference]: Start difference. First operand 3135 states and 15584 transitions. Second operand 12 states. [2020-02-10 20:35:40,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:40,341 INFO L93 Difference]: Finished difference Result 6062 states and 26898 transitions. [2020-02-10 20:35:40,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:35:40,341 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:35:40,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:40,355 INFO L225 Difference]: With dead ends: 6062 [2020-02-10 20:35:40,355 INFO L226 Difference]: Without dead ends: 6026 [2020-02-10 20:35:40,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:35:40,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6026 states. [2020-02-10 20:35:40,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6026 to 3121. [2020-02-10 20:35:40,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 20:35:40,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15551 transitions. [2020-02-10 20:35:40,545 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15551 transitions. Word has length 31 [2020-02-10 20:35:40,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:40,545 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15551 transitions. [2020-02-10 20:35:40,545 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:35:40,545 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15551 transitions. [2020-02-10 20:35:40,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:35:40,550 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:40,550 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:35:40,550 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:35:40,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:40,551 INFO L82 PathProgramCache]: Analyzing trace with hash 291130506, now seen corresponding path program 451 times [2020-02-10 20:35:40,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:40,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155127605] [2020-02-10 20:35:40,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:40,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:41,096 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:35:41,227 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:35:41,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:35:41,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155127605] [2020-02-10 20:35:41,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:41,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:35:41,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690648815] [2020-02-10 20:35:41,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:35:41,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:41,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:35:41,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:35:41,236 INFO L87 Difference]: Start difference. First operand 3121 states and 15551 transitions. Second operand 12 states. [2020-02-10 20:35:41,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:41,489 INFO L93 Difference]: Finished difference Result 6061 states and 26910 transitions. [2020-02-10 20:35:41,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:35:41,490 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:35:41,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:41,504 INFO L225 Difference]: With dead ends: 6061 [2020-02-10 20:35:41,505 INFO L226 Difference]: Without dead ends: 6041 [2020-02-10 20:35:41,505 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:35:41,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6041 states. [2020-02-10 20:35:41,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6041 to 3135. [2020-02-10 20:35:41,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3135 states. [2020-02-10 20:35:41,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3135 states to 3135 states and 15590 transitions. [2020-02-10 20:35:41,690 INFO L78 Accepts]: Start accepts. Automaton has 3135 states and 15590 transitions. Word has length 31 [2020-02-10 20:35:41,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:41,691 INFO L479 AbstractCegarLoop]: Abstraction has 3135 states and 15590 transitions. [2020-02-10 20:35:41,691 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:35:41,691 INFO L276 IsEmpty]: Start isEmpty. Operand 3135 states and 15590 transitions. [2020-02-10 20:35:41,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:35:41,696 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:41,696 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:35:41,696 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:35:41,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:41,696 INFO L82 PathProgramCache]: Analyzing trace with hash -553840946, now seen corresponding path program 452 times [2020-02-10 20:35:41,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:41,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121916746] [2020-02-10 20:35:41,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:41,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:42,235 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:35:42,368 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:35:42,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:35:42,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121916746] [2020-02-10 20:35:42,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:42,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:35:42,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270727310] [2020-02-10 20:35:42,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:35:42,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:42,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:35:42,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:35:42,379 INFO L87 Difference]: Start difference. First operand 3135 states and 15590 transitions. Second operand 12 states. [2020-02-10 20:35:42,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:42,606 INFO L93 Difference]: Finished difference Result 6058 states and 26898 transitions. [2020-02-10 20:35:42,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:35:42,606 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:35:42,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:42,621 INFO L225 Difference]: With dead ends: 6058 [2020-02-10 20:35:42,621 INFO L226 Difference]: Without dead ends: 6035 [2020-02-10 20:35:42,621 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:35:42,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6035 states. [2020-02-10 20:35:42,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6035 to 3129. [2020-02-10 20:35:42,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 20:35:42,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15573 transitions. [2020-02-10 20:35:42,812 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15573 transitions. Word has length 31 [2020-02-10 20:35:42,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:42,812 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15573 transitions. [2020-02-10 20:35:42,812 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:35:42,812 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15573 transitions. [2020-02-10 20:35:42,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:35:42,817 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:42,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:35:42,817 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:35:42,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:42,817 INFO L82 PathProgramCache]: Analyzing trace with hash -769647584, now seen corresponding path program 453 times [2020-02-10 20:35:42,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:42,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391720966] [2020-02-10 20:35:42,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:42,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:43,381 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:35:43,511 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:35:43,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:35:43,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391720966] [2020-02-10 20:35:43,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:43,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:35:43,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74869881] [2020-02-10 20:35:43,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:35:43,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:43,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:35:43,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:35:43,520 INFO L87 Difference]: Start difference. First operand 3129 states and 15573 transitions. Second operand 12 states. [2020-02-10 20:35:43,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:43,759 INFO L93 Difference]: Finished difference Result 6071 states and 26925 transitions. [2020-02-10 20:35:43,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:35:43,759 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:35:43,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:43,774 INFO L225 Difference]: With dead ends: 6071 [2020-02-10 20:35:43,774 INFO L226 Difference]: Without dead ends: 6051 [2020-02-10 20:35:43,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:35:43,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6051 states. [2020-02-10 20:35:43,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6051 to 3140. [2020-02-10 20:35:43,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3140 states. [2020-02-10 20:35:43,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3140 states to 3140 states and 15593 transitions. [2020-02-10 20:35:43,961 INFO L78 Accepts]: Start accepts. Automaton has 3140 states and 15593 transitions. Word has length 31 [2020-02-10 20:35:43,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:43,961 INFO L479 AbstractCegarLoop]: Abstraction has 3140 states and 15593 transitions. [2020-02-10 20:35:43,961 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:35:43,961 INFO L276 IsEmpty]: Start isEmpty. Operand 3140 states and 15593 transitions. [2020-02-10 20:35:43,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:35:43,966 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:43,966 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:35:43,966 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:35:43,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:43,967 INFO L82 PathProgramCache]: Analyzing trace with hash 567919630, now seen corresponding path program 454 times [2020-02-10 20:35:43,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:43,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347628116] [2020-02-10 20:35:43,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:43,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:44,539 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:35:44,671 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:35:44,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:35:44,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347628116] [2020-02-10 20:35:44,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:44,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:35:44,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931607774] [2020-02-10 20:35:44,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:35:44,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:44,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:35:44,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:35:44,681 INFO L87 Difference]: Start difference. First operand 3140 states and 15593 transitions. Second operand 12 states. [2020-02-10 20:35:44,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:44,908 INFO L93 Difference]: Finished difference Result 6073 states and 26919 transitions. [2020-02-10 20:35:44,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:35:44,909 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:35:44,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:44,923 INFO L225 Difference]: With dead ends: 6073 [2020-02-10 20:35:44,924 INFO L226 Difference]: Without dead ends: 6040 [2020-02-10 20:35:44,924 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:35:45,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6040 states. [2020-02-10 20:35:45,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6040 to 3129. [2020-02-10 20:35:45,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 20:35:45,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15565 transitions. [2020-02-10 20:35:45,107 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15565 transitions. Word has length 31 [2020-02-10 20:35:45,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:45,107 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15565 transitions. [2020-02-10 20:35:45,107 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:35:45,107 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15565 transitions. [2020-02-10 20:35:45,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:35:45,112 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:45,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:35:45,112 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:35:45,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:45,112 INFO L82 PathProgramCache]: Analyzing trace with hash -2038930272, now seen corresponding path program 455 times [2020-02-10 20:35:45,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:45,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532445645] [2020-02-10 20:35:45,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:45,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:45,675 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:35:45,811 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:35:45,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:35:45,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532445645] [2020-02-10 20:35:45,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:45,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:35:45,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371713478] [2020-02-10 20:35:45,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:35:45,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:45,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:35:45,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:35:45,821 INFO L87 Difference]: Start difference. First operand 3129 states and 15565 transitions. Second operand 12 states. [2020-02-10 20:35:46,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:46,095 INFO L93 Difference]: Finished difference Result 6061 states and 26895 transitions. [2020-02-10 20:35:46,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:35:46,095 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:35:46,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:46,109 INFO L225 Difference]: With dead ends: 6061 [2020-02-10 20:35:46,109 INFO L226 Difference]: Without dead ends: 6044 [2020-02-10 20:35:46,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:35:46,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6044 states. [2020-02-10 20:35:46,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6044 to 3136. [2020-02-10 20:35:46,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3136 states. [2020-02-10 20:35:46,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3136 states to 3136 states and 15578 transitions. [2020-02-10 20:35:46,341 INFO L78 Accepts]: Start accepts. Automaton has 3136 states and 15578 transitions. Word has length 31 [2020-02-10 20:35:46,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:46,342 INFO L479 AbstractCegarLoop]: Abstraction has 3136 states and 15578 transitions. [2020-02-10 20:35:46,342 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:35:46,342 INFO L276 IsEmpty]: Start isEmpty. Operand 3136 states and 15578 transitions. [2020-02-10 20:35:46,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:35:46,347 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:46,347 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:35:46,347 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:35:46,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:46,348 INFO L82 PathProgramCache]: Analyzing trace with hash 143608394, now seen corresponding path program 456 times [2020-02-10 20:35:46,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:46,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966445224] [2020-02-10 20:35:46,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:46,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:46,902 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:35:47,038 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:35:47,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:35:47,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966445224] [2020-02-10 20:35:47,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:47,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:35:47,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239692708] [2020-02-10 20:35:47,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:35:47,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:47,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:35:47,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:35:47,048 INFO L87 Difference]: Start difference. First operand 3136 states and 15578 transitions. Second operand 12 states. [2020-02-10 20:35:47,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:47,240 INFO L93 Difference]: Finished difference Result 6066 states and 26898 transitions. [2020-02-10 20:35:47,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:35:47,241 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:35:47,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:47,255 INFO L225 Difference]: With dead ends: 6066 [2020-02-10 20:35:47,255 INFO L226 Difference]: Without dead ends: 6020 [2020-02-10 20:35:47,255 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:35:47,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6020 states. [2020-02-10 20:35:47,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6020 to 3112. [2020-02-10 20:35:47,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3112 states. [2020-02-10 20:35:47,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3112 states to 3112 states and 15527 transitions. [2020-02-10 20:35:47,437 INFO L78 Accepts]: Start accepts. Automaton has 3112 states and 15527 transitions. Word has length 31 [2020-02-10 20:35:47,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:47,437 INFO L479 AbstractCegarLoop]: Abstraction has 3112 states and 15527 transitions. [2020-02-10 20:35:47,437 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:35:47,437 INFO L276 IsEmpty]: Start isEmpty. Operand 3112 states and 15527 transitions. [2020-02-10 20:35:47,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:35:47,442 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:47,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:35:47,442 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:35:47,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:47,443 INFO L82 PathProgramCache]: Analyzing trace with hash -971486278, now seen corresponding path program 457 times [2020-02-10 20:35:47,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:47,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675416968] [2020-02-10 20:35:47,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:47,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:47,974 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:35:48,104 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:35:48,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:35:48,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675416968] [2020-02-10 20:35:48,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:48,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:35:48,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312656473] [2020-02-10 20:35:48,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:35:48,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:48,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:35:48,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:35:48,113 INFO L87 Difference]: Start difference. First operand 3112 states and 15527 transitions. Second operand 12 states. [2020-02-10 20:35:48,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:48,333 INFO L93 Difference]: Finished difference Result 6020 states and 26816 transitions. [2020-02-10 20:35:48,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:35:48,333 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:35:48,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:48,347 INFO L225 Difference]: With dead ends: 6020 [2020-02-10 20:35:48,348 INFO L226 Difference]: Without dead ends: 6004 [2020-02-10 20:35:48,348 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:35:48,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6004 states. [2020-02-10 20:35:48,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6004 to 3129. [2020-02-10 20:35:48,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 20:35:48,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15586 transitions. [2020-02-10 20:35:48,530 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15586 transitions. Word has length 31 [2020-02-10 20:35:48,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:48,530 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15586 transitions. [2020-02-10 20:35:48,530 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:35:48,530 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15586 transitions. [2020-02-10 20:35:48,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:35:48,535 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:48,535 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:35:48,535 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:35:48,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:48,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1816457730, now seen corresponding path program 458 times [2020-02-10 20:35:48,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:48,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23608249] [2020-02-10 20:35:48,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:48,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:49,074 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:35:49,205 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:35:49,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:35:49,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23608249] [2020-02-10 20:35:49,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:49,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:35:49,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046283390] [2020-02-10 20:35:49,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:35:49,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:49,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:35:49,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:35:49,215 INFO L87 Difference]: Start difference. First operand 3129 states and 15586 transitions. Second operand 12 states. [2020-02-10 20:35:49,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:49,445 INFO L93 Difference]: Finished difference Result 6024 states and 26819 transitions. [2020-02-10 20:35:49,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:35:49,445 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:35:49,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:49,460 INFO L225 Difference]: With dead ends: 6024 [2020-02-10 20:35:49,460 INFO L226 Difference]: Without dead ends: 5999 [2020-02-10 20:35:49,460 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:35:49,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5999 states. [2020-02-10 20:35:49,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5999 to 3124. [2020-02-10 20:35:49,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:35:49,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15572 transitions. [2020-02-10 20:35:49,647 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15572 transitions. Word has length 31 [2020-02-10 20:35:49,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:49,647 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15572 transitions. [2020-02-10 20:35:49,647 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:35:49,647 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15572 transitions. [2020-02-10 20:35:49,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:35:49,652 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:49,652 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:35:49,652 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:35:49,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:49,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1395797514, now seen corresponding path program 459 times [2020-02-10 20:35:49,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:49,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398641739] [2020-02-10 20:35:49,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:49,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:50,213 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:35:50,346 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:35:50,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:35:50,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398641739] [2020-02-10 20:35:50,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:50,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:35:50,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713476885] [2020-02-10 20:35:50,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:35:50,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:50,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:35:50,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:35:50,356 INFO L87 Difference]: Start difference. First operand 3124 states and 15572 transitions. Second operand 12 states. [2020-02-10 20:35:50,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:50,592 INFO L93 Difference]: Finished difference Result 6017 states and 26805 transitions. [2020-02-10 20:35:50,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:35:50,592 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:35:50,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:50,607 INFO L225 Difference]: With dead ends: 6017 [2020-02-10 20:35:50,607 INFO L226 Difference]: Without dead ends: 6001 [2020-02-10 20:35:50,607 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:35:50,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6001 states. [2020-02-10 20:35:50,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6001 to 3129. [2020-02-10 20:35:50,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 20:35:50,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15581 transitions. [2020-02-10 20:35:50,799 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15581 transitions. Word has length 31 [2020-02-10 20:35:50,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:50,799 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15581 transitions. [2020-02-10 20:35:50,799 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:35:50,799 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15581 transitions. [2020-02-10 20:35:50,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:35:50,804 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:50,804 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:35:50,804 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:35:50,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:50,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1209226878, now seen corresponding path program 460 times [2020-02-10 20:35:50,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:50,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361250323] [2020-02-10 20:35:50,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:50,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:51,351 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:35:51,484 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:35:51,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:35:51,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361250323] [2020-02-10 20:35:51,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:51,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:35:51,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432948228] [2020-02-10 20:35:51,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:35:51,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:51,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:35:51,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:35:51,494 INFO L87 Difference]: Start difference. First operand 3129 states and 15581 transitions. Second operand 12 states. [2020-02-10 20:35:51,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:51,736 INFO L93 Difference]: Finished difference Result 6018 states and 26802 transitions. [2020-02-10 20:35:51,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:35:51,736 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:35:51,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:51,751 INFO L225 Difference]: With dead ends: 6018 [2020-02-10 20:35:51,751 INFO L226 Difference]: Without dead ends: 5996 [2020-02-10 20:35:51,751 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:35:51,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5996 states. [2020-02-10 20:35:51,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5996 to 3124. [2020-02-10 20:35:51,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:35:51,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15567 transitions. [2020-02-10 20:35:51,939 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15567 transitions. Word has length 31 [2020-02-10 20:35:51,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:51,939 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15567 transitions. [2020-02-10 20:35:51,939 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:35:51,939 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15567 transitions. [2020-02-10 20:35:51,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:35:51,944 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:51,944 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:35:51,944 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:35:51,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:51,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1629887094, now seen corresponding path program 461 times [2020-02-10 20:35:51,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:51,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189319967] [2020-02-10 20:35:51,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:51,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:52,493 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:35:52,628 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:35:52,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:35:52,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189319967] [2020-02-10 20:35:52,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:52,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:35:52,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057805861] [2020-02-10 20:35:52,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:35:52,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:52,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:35:52,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:35:52,638 INFO L87 Difference]: Start difference. First operand 3124 states and 15567 transitions. Second operand 12 states. [2020-02-10 20:35:53,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:53,010 INFO L93 Difference]: Finished difference Result 6026 states and 26819 transitions. [2020-02-10 20:35:53,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:35:53,010 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:35:53,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:53,026 INFO L225 Difference]: With dead ends: 6026 [2020-02-10 20:35:53,026 INFO L226 Difference]: Without dead ends: 6006 [2020-02-10 20:35:53,026 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:35:53,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6006 states. [2020-02-10 20:35:53,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6006 to 3130. [2020-02-10 20:35:53,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 20:35:53,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15578 transitions. [2020-02-10 20:35:53,210 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15578 transitions. Word has length 31 [2020-02-10 20:35:53,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:53,210 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15578 transitions. [2020-02-10 20:35:53,210 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:35:53,210 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15578 transitions. [2020-02-10 20:35:53,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:35:53,215 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:53,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:35:53,215 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:35:53,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:53,216 INFO L82 PathProgramCache]: Analyzing trace with hash 784915642, now seen corresponding path program 462 times [2020-02-10 20:35:53,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:53,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187133751] [2020-02-10 20:35:53,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:53,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:53,764 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:35:53,896 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:35:53,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:35:53,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187133751] [2020-02-10 20:35:53,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:53,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:35:53,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435541346] [2020-02-10 20:35:53,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:35:53,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:53,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:35:53,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:35:53,906 INFO L87 Difference]: Start difference. First operand 3130 states and 15578 transitions. Second operand 12 states. [2020-02-10 20:35:54,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:54,158 INFO L93 Difference]: Finished difference Result 6023 states and 26807 transitions. [2020-02-10 20:35:54,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:35:54,158 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:35:54,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:54,214 INFO L225 Difference]: With dead ends: 6023 [2020-02-10 20:35:54,214 INFO L226 Difference]: Without dead ends: 5995 [2020-02-10 20:35:54,214 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:35:54,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5995 states. [2020-02-10 20:35:54,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5995 to 3119. [2020-02-10 20:35:54,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 20:35:54,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15553 transitions. [2020-02-10 20:35:54,398 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15553 transitions. Word has length 31 [2020-02-10 20:35:54,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:54,399 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15553 transitions. [2020-02-10 20:35:54,399 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:35:54,399 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15553 transitions. [2020-02-10 20:35:54,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:35:54,404 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:54,404 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:35:54,404 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:35:54,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:54,405 INFO L82 PathProgramCache]: Analyzing trace with hash 504131300, now seen corresponding path program 463 times [2020-02-10 20:35:54,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:54,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286543780] [2020-02-10 20:35:54,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:54,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:54,942 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:35:55,066 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:35:55,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:35:55,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286543780] [2020-02-10 20:35:55,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:55,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:35:55,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504040309] [2020-02-10 20:35:55,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:35:55,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:55,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:35:55,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:35:55,076 INFO L87 Difference]: Start difference. First operand 3119 states and 15553 transitions. Second operand 12 states. [2020-02-10 20:35:55,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:55,409 INFO L93 Difference]: Finished difference Result 6033 states and 26839 transitions. [2020-02-10 20:35:55,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:35:55,409 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:35:55,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:55,424 INFO L225 Difference]: With dead ends: 6033 [2020-02-10 20:35:55,425 INFO L226 Difference]: Without dead ends: 6017 [2020-02-10 20:35:55,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:35:55,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6017 states. [2020-02-10 20:35:55,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6017 to 3131. [2020-02-10 20:35:55,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 20:35:55,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15586 transitions. [2020-02-10 20:35:55,607 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15586 transitions. Word has length 31 [2020-02-10 20:35:55,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:55,607 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15586 transitions. [2020-02-10 20:35:55,607 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:35:55,607 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15586 transitions. [2020-02-10 20:35:55,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:35:55,612 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:55,612 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:35:55,613 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:35:55,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:55,613 INFO L82 PathProgramCache]: Analyzing trace with hash -340840152, now seen corresponding path program 464 times [2020-02-10 20:35:55,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:55,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212107228] [2020-02-10 20:35:55,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:55,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:56,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:35:56,281 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:35:56,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:35:56,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212107228] [2020-02-10 20:35:56,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:56,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:35:56,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187735472] [2020-02-10 20:35:56,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:35:56,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:56,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:35:56,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:35:56,291 INFO L87 Difference]: Start difference. First operand 3131 states and 15586 transitions. Second operand 12 states. [2020-02-10 20:35:56,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:56,530 INFO L93 Difference]: Finished difference Result 6037 states and 26842 transitions. [2020-02-10 20:35:56,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:35:56,531 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:35:56,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:56,544 INFO L225 Difference]: With dead ends: 6037 [2020-02-10 20:35:56,544 INFO L226 Difference]: Without dead ends: 6012 [2020-02-10 20:35:56,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:35:56,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6012 states. [2020-02-10 20:35:56,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6012 to 3126. [2020-02-10 20:35:56,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 20:35:56,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15572 transitions. [2020-02-10 20:35:56,732 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15572 transitions. Word has length 31 [2020-02-10 20:35:56,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:56,732 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15572 transitions. [2020-02-10 20:35:56,732 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:35:56,732 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15572 transitions. [2020-02-10 20:35:56,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:35:56,737 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:56,737 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:35:56,737 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:35:56,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:56,738 INFO L82 PathProgramCache]: Analyzing trace with hash -980958026, now seen corresponding path program 465 times [2020-02-10 20:35:56,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:56,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651496489] [2020-02-10 20:35:56,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:56,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:57,411 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 33 [2020-02-10 20:35:57,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:35:57,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651496489] [2020-02-10 20:35:57,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:57,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:35:57,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207156043] [2020-02-10 20:35:57,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:35:57,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:57,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:35:57,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:35:57,421 INFO L87 Difference]: Start difference. First operand 3126 states and 15572 transitions. Second operand 12 states. [2020-02-10 20:35:57,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:57,666 INFO L93 Difference]: Finished difference Result 6036 states and 26839 transitions. [2020-02-10 20:35:57,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:35:57,666 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:35:57,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:57,681 INFO L225 Difference]: With dead ends: 6036 [2020-02-10 20:35:57,681 INFO L226 Difference]: Without dead ends: 6020 [2020-02-10 20:35:57,681 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:35:57,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6020 states. [2020-02-10 20:35:57,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6020 to 3132. [2020-02-10 20:35:57,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-02-10 20:35:57,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15583 transitions. [2020-02-10 20:35:57,864 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15583 transitions. Word has length 31 [2020-02-10 20:35:57,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:57,865 INFO L479 AbstractCegarLoop]: Abstraction has 3132 states and 15583 transitions. [2020-02-10 20:35:57,865 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:35:57,865 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15583 transitions. [2020-02-10 20:35:57,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:35:57,870 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:57,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:35:57,870 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:35:57,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:57,870 INFO L82 PathProgramCache]: Analyzing trace with hash -488362264, now seen corresponding path program 466 times [2020-02-10 20:35:57,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:57,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29285226] [2020-02-10 20:35:57,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:57,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:58,420 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 33 [2020-02-10 20:35:58,554 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:35:58,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:35:58,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29285226] [2020-02-10 20:35:58,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:58,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:35:58,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821865782] [2020-02-10 20:35:58,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:35:58,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:58,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:35:58,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:35:58,563 INFO L87 Difference]: Start difference. First operand 3132 states and 15583 transitions. Second operand 12 states. [2020-02-10 20:35:58,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:58,808 INFO L93 Difference]: Finished difference Result 6042 states and 26845 transitions. [2020-02-10 20:35:58,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:35:58,809 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:35:58,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:58,824 INFO L225 Difference]: With dead ends: 6042 [2020-02-10 20:35:58,824 INFO L226 Difference]: Without dead ends: 6014 [2020-02-10 20:35:58,824 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:35:58,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6014 states. [2020-02-10 20:35:58,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6014 to 3126. [2020-02-10 20:35:58,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 20:35:59,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15566 transitions. [2020-02-10 20:35:59,007 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15566 transitions. Word has length 31 [2020-02-10 20:35:59,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:35:59,007 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15566 transitions. [2020-02-10 20:35:59,007 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:35:59,007 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15566 transitions. [2020-02-10 20:35:59,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:35:59,012 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:35:59,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:35:59,012 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:35:59,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:35:59,012 INFO L82 PathProgramCache]: Analyzing trace with hash 2044726582, now seen corresponding path program 467 times [2020-02-10 20:35:59,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:35:59,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055946748] [2020-02-10 20:35:59,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:35:59,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:35:59,696 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:35:59,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:35:59,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055946748] [2020-02-10 20:35:59,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:35:59,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:35:59,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309112317] [2020-02-10 20:35:59,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:35:59,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:35:59,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:35:59,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:35:59,705 INFO L87 Difference]: Start difference. First operand 3126 states and 15566 transitions. Second operand 12 states. [2020-02-10 20:35:59,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:35:59,985 INFO L93 Difference]: Finished difference Result 6049 states and 26862 transitions. [2020-02-10 20:35:59,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:35:59,985 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:35:59,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:35:59,999 INFO L225 Difference]: With dead ends: 6049 [2020-02-10 20:35:59,999 INFO L226 Difference]: Without dead ends: 6029 [2020-02-10 20:35:59,999 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:36:00,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6029 states. [2020-02-10 20:36:00,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6029 to 3137. [2020-02-10 20:36:00,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3137 states. [2020-02-10 20:36:00,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3137 states to 3137 states and 15586 transitions. [2020-02-10 20:36:00,181 INFO L78 Accepts]: Start accepts. Automaton has 3137 states and 15586 transitions. Word has length 31 [2020-02-10 20:36:00,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:00,182 INFO L479 AbstractCegarLoop]: Abstraction has 3137 states and 15586 transitions. [2020-02-10 20:36:00,182 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:36:00,182 INFO L276 IsEmpty]: Start isEmpty. Operand 3137 states and 15586 transitions. [2020-02-10 20:36:00,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:36:00,187 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:00,187 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:36:00,187 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:36:00,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:00,187 INFO L82 PathProgramCache]: Analyzing trace with hash -912673500, now seen corresponding path program 468 times [2020-02-10 20:36:00,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:00,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412625602] [2020-02-10 20:36:00,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:00,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:00,757 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:36:00,892 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:36:00,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:36:00,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412625602] [2020-02-10 20:36:00,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:00,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:36:00,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901214260] [2020-02-10 20:36:00,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:36:00,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:00,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:36:00,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:36:00,902 INFO L87 Difference]: Start difference. First operand 3137 states and 15586 transitions. Second operand 12 states. [2020-02-10 20:36:01,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:01,120 INFO L93 Difference]: Finished difference Result 6051 states and 26856 transitions. [2020-02-10 20:36:01,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:36:01,121 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:36:01,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:01,134 INFO L225 Difference]: With dead ends: 6051 [2020-02-10 20:36:01,134 INFO L226 Difference]: Without dead ends: 6011 [2020-02-10 20:36:01,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:36:01,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6011 states. [2020-02-10 20:36:01,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6011 to 3119. [2020-02-10 20:36:01,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 20:36:01,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15546 transitions. [2020-02-10 20:36:01,322 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15546 transitions. Word has length 31 [2020-02-10 20:36:01,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:01,322 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15546 transitions. [2020-02-10 20:36:01,322 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:36:01,322 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15546 transitions. [2020-02-10 20:36:01,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:36:01,327 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:01,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:36:01,327 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:36:01,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:01,327 INFO L82 PathProgramCache]: Analyzing trace with hash -188926364, now seen corresponding path program 469 times [2020-02-10 20:36:01,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:01,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032229438] [2020-02-10 20:36:01,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:01,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:01,895 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:36:02,028 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:36:02,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:36:02,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032229438] [2020-02-10 20:36:02,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:02,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:36:02,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324016942] [2020-02-10 20:36:02,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:36:02,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:02,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:36:02,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:36:02,038 INFO L87 Difference]: Start difference. First operand 3119 states and 15546 transitions. Second operand 12 states. [2020-02-10 20:36:02,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:02,362 INFO L93 Difference]: Finished difference Result 6022 states and 26808 transitions. [2020-02-10 20:36:02,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:36:02,363 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:36:02,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:02,378 INFO L225 Difference]: With dead ends: 6022 [2020-02-10 20:36:02,378 INFO L226 Difference]: Without dead ends: 6006 [2020-02-10 20:36:02,378 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:36:02,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6006 states. [2020-02-10 20:36:02,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6006 to 3130. [2020-02-10 20:36:02,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 20:36:02,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15577 transitions. [2020-02-10 20:36:02,567 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15577 transitions. Word has length 31 [2020-02-10 20:36:02,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:02,567 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15577 transitions. [2020-02-10 20:36:02,567 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:36:02,567 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15577 transitions. [2020-02-10 20:36:02,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:36:02,573 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:02,573 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:36:02,573 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:36:02,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:02,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1878869268, now seen corresponding path program 470 times [2020-02-10 20:36:02,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:02,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999077201] [2020-02-10 20:36:02,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:02,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:03,120 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:36:03,251 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:36:03,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:36:03,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999077201] [2020-02-10 20:36:03,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:03,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:36:03,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35992773] [2020-02-10 20:36:03,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:36:03,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:03,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:36:03,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:36:03,261 INFO L87 Difference]: Start difference. First operand 3130 states and 15577 transitions. Second operand 12 states. [2020-02-10 20:36:03,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:03,505 INFO L93 Difference]: Finished difference Result 6023 states and 26805 transitions. [2020-02-10 20:36:03,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:36:03,506 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:36:03,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:03,521 INFO L225 Difference]: With dead ends: 6023 [2020-02-10 20:36:03,521 INFO L226 Difference]: Without dead ends: 6001 [2020-02-10 20:36:03,521 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:36:03,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6001 states. [2020-02-10 20:36:03,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6001 to 3125. [2020-02-10 20:36:03,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 20:36:03,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15563 transitions. [2020-02-10 20:36:03,709 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15563 transitions. Word has length 31 [2020-02-10 20:36:03,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:03,709 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15563 transitions. [2020-02-10 20:36:03,709 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:36:03,709 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15563 transitions. [2020-02-10 20:36:03,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:36:03,714 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:03,714 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:36:03,714 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:36:03,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:03,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1249704454, now seen corresponding path program 471 times [2020-02-10 20:36:03,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:03,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614121728] [2020-02-10 20:36:03,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:03,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:04,269 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:36:04,399 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:36:04,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:36:04,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614121728] [2020-02-10 20:36:04,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:04,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:36:04,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766317385] [2020-02-10 20:36:04,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:36:04,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:04,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:36:04,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:36:04,408 INFO L87 Difference]: Start difference. First operand 3125 states and 15563 transitions. Second operand 12 states. [2020-02-10 20:36:04,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:04,646 INFO L93 Difference]: Finished difference Result 6028 states and 26814 transitions. [2020-02-10 20:36:04,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:36:04,647 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:36:04,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:04,661 INFO L225 Difference]: With dead ends: 6028 [2020-02-10 20:36:04,661 INFO L226 Difference]: Without dead ends: 6012 [2020-02-10 20:36:04,662 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:36:04,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6012 states. [2020-02-10 20:36:04,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6012 to 3131. [2020-02-10 20:36:04,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 20:36:04,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15574 transitions. [2020-02-10 20:36:04,849 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15574 transitions. Word has length 31 [2020-02-10 20:36:04,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:04,849 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15574 transitions. [2020-02-10 20:36:04,850 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:36:04,850 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15574 transitions. [2020-02-10 20:36:04,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:36:04,855 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:04,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:36:04,855 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:36:04,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:04,855 INFO L82 PathProgramCache]: Analyzing trace with hash -757108692, now seen corresponding path program 472 times [2020-02-10 20:36:04,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:04,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568960833] [2020-02-10 20:36:04,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:04,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:05,407 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:36:05,538 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:36:05,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 20:36:05,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568960833] [2020-02-10 20:36:05,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:05,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:36:05,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633243808] [2020-02-10 20:36:05,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:36:05,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:05,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:36:05,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:36:05,547 INFO L87 Difference]: Start difference. First operand 3131 states and 15574 transitions. Second operand 12 states. [2020-02-10 20:36:05,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:05,741 INFO L93 Difference]: Finished difference Result 6034 states and 26820 transitions. [2020-02-10 20:36:05,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:36:05,741 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:36:05,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:05,755 INFO L225 Difference]: With dead ends: 6034 [2020-02-10 20:36:05,755 INFO L226 Difference]: Without dead ends: 6006 [2020-02-10 20:36:05,755 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:36:05,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6006 states. [2020-02-10 20:36:05,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6006 to 3125. [2020-02-10 20:36:05,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 20:36:05,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15557 transitions. [2020-02-10 20:36:05,943 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15557 transitions. Word has length 31 [2020-02-10 20:36:05,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:05,943 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15557 transitions. [2020-02-10 20:36:05,943 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:36:05,943 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15557 transitions. [2020-02-10 20:36:05,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:36:05,948 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:05,948 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:36:05,948 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:36:05,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:05,949 INFO L82 PathProgramCache]: Analyzing trace with hash 506697466, now seen corresponding path program 473 times [2020-02-10 20:36:05,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:05,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895682454] [2020-02-10 20:36:05,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:05,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:06,491 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:36:06,624 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:36:06,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:36:06,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895682454] [2020-02-10 20:36:06,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:06,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:36:06,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773215192] [2020-02-10 20:36:06,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:36:06,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:06,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:36:06,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:36:06,634 INFO L87 Difference]: Start difference. First operand 3125 states and 15557 transitions. Second operand 12 states. [2020-02-10 20:36:06,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:06,951 INFO L93 Difference]: Finished difference Result 6031 states and 26815 transitions. [2020-02-10 20:36:06,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:36:06,952 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:36:06,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:06,967 INFO L225 Difference]: With dead ends: 6031 [2020-02-10 20:36:06,967 INFO L226 Difference]: Without dead ends: 6014 [2020-02-10 20:36:06,967 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:36:07,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6014 states. [2020-02-10 20:36:07,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6014 to 3132. [2020-02-10 20:36:07,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-02-10 20:36:07,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15570 transitions. [2020-02-10 20:36:07,154 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15570 transitions. Word has length 31 [2020-02-10 20:36:07,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:07,154 INFO L479 AbstractCegarLoop]: Abstraction has 3132 states and 15570 transitions. [2020-02-10 20:36:07,154 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:36:07,154 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15570 transitions. [2020-02-10 20:36:07,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:36:07,159 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:07,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 20:36:07,160 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:36:07,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:07,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1605731164, now seen corresponding path program 474 times [2020-02-10 20:36:07,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:07,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143365612] [2020-02-10 20:36:07,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:07,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:07,712 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:36:07,842 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:36:07,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:36:07,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143365612] [2020-02-10 20:36:07,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:07,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:36:07,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126524007] [2020-02-10 20:36:07,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:36:07,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:07,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:36:07,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:36:07,852 INFO L87 Difference]: Start difference. First operand 3132 states and 15570 transitions. Second operand 12 states. [2020-02-10 20:36:08,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:08,053 INFO L93 Difference]: Finished difference Result 6036 states and 26818 transitions. [2020-02-10 20:36:08,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:36:08,054 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:36:08,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:08,069 INFO L225 Difference]: With dead ends: 6036 [2020-02-10 20:36:08,069 INFO L226 Difference]: Without dead ends: 6001 [2020-02-10 20:36:08,069 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:36:08,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6001 states. [2020-02-10 20:36:08,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6001 to 3119. [2020-02-10 20:36:08,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3119 states. [2020-02-10 20:36:08,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 15540 transitions. [2020-02-10 20:36:08,257 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 15540 transitions. Word has length 31 [2020-02-10 20:36:08,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:08,257 INFO L479 AbstractCegarLoop]: Abstraction has 3119 states and 15540 transitions. [2020-02-10 20:36:08,257 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:36:08,257 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 15540 transitions. [2020-02-10 20:36:08,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:36:08,262 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:08,262 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:36:08,262 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:36:08,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:08,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1726955480, now seen corresponding path program 475 times [2020-02-10 20:36:08,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:08,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434589047] [2020-02-10 20:36:08,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:08,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:08,824 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:36:08,957 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:36:08,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:36:08,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434589047] [2020-02-10 20:36:08,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:08,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:36:08,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097799820] [2020-02-10 20:36:08,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:36:08,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:08,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:36:08,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:36:08,968 INFO L87 Difference]: Start difference. First operand 3119 states and 15540 transitions. Second operand 12 states. [2020-02-10 20:36:09,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:09,215 INFO L93 Difference]: Finished difference Result 6043 states and 26851 transitions. [2020-02-10 20:36:09,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:36:09,215 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:36:09,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:09,229 INFO L225 Difference]: With dead ends: 6043 [2020-02-10 20:36:09,230 INFO L226 Difference]: Without dead ends: 6023 [2020-02-10 20:36:09,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:36:09,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6023 states. [2020-02-10 20:36:09,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6023 to 3133. [2020-02-10 20:36:09,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-02-10 20:36:09,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15579 transitions. [2020-02-10 20:36:09,412 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15579 transitions. Word has length 31 [2020-02-10 20:36:09,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:09,412 INFO L479 AbstractCegarLoop]: Abstraction has 3133 states and 15579 transitions. [2020-02-10 20:36:09,412 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:36:09,413 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15579 transitions. [2020-02-10 20:36:09,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:36:09,418 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:09,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 20:36:09,418 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:36:09,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:09,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1723040364, now seen corresponding path program 476 times [2020-02-10 20:36:09,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:09,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421453844] [2020-02-10 20:36:09,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:09,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:10,009 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:36:10,143 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:36:10,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:36:10,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421453844] [2020-02-10 20:36:10,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:10,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:36:10,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564599519] [2020-02-10 20:36:10,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:36:10,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:10,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:36:10,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:36:10,153 INFO L87 Difference]: Start difference. First operand 3133 states and 15579 transitions. Second operand 12 states. [2020-02-10 20:36:10,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:10,385 INFO L93 Difference]: Finished difference Result 6040 states and 26839 transitions. [2020-02-10 20:36:10,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:36:10,386 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:36:10,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:10,400 INFO L225 Difference]: With dead ends: 6040 [2020-02-10 20:36:10,401 INFO L226 Difference]: Without dead ends: 6017 [2020-02-10 20:36:10,401 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:36:10,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6017 states. [2020-02-10 20:36:10,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6017 to 3127. [2020-02-10 20:36:10,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:36:10,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15562 transitions. [2020-02-10 20:36:10,588 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15562 transitions. Word has length 31 [2020-02-10 20:36:10,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:10,588 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15562 transitions. [2020-02-10 20:36:10,588 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:36:10,588 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15562 transitions. [2020-02-10 20:36:10,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:36:10,593 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:10,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:36:10,594 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:36:10,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:10,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1507233726, now seen corresponding path program 477 times [2020-02-10 20:36:10,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:10,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456760432] [2020-02-10 20:36:10,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:10,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:10,944 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 27 [2020-02-10 20:36:11,295 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:36:11,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:36:11,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456760432] [2020-02-10 20:36:11,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:11,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:36:11,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795270372] [2020-02-10 20:36:11,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:36:11,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:11,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:36:11,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:36:11,306 INFO L87 Difference]: Start difference. First operand 3127 states and 15562 transitions. Second operand 12 states. [2020-02-10 20:36:11,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:11,595 INFO L93 Difference]: Finished difference Result 6053 states and 26866 transitions. [2020-02-10 20:36:11,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:36:11,596 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:36:11,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:11,610 INFO L225 Difference]: With dead ends: 6053 [2020-02-10 20:36:11,610 INFO L226 Difference]: Without dead ends: 6033 [2020-02-10 20:36:11,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:36:11,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6033 states. [2020-02-10 20:36:11,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6033 to 3138. [2020-02-10 20:36:11,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3138 states. [2020-02-10 20:36:11,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3138 states to 3138 states and 15582 transitions. [2020-02-10 20:36:11,798 INFO L78 Accepts]: Start accepts. Automaton has 3138 states and 15582 transitions. Word has length 31 [2020-02-10 20:36:11,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:11,798 INFO L479 AbstractCegarLoop]: Abstraction has 3138 states and 15582 transitions. [2020-02-10 20:36:11,798 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:36:11,798 INFO L276 IsEmpty]: Start isEmpty. Operand 3138 states and 15582 transitions. [2020-02-10 20:36:11,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:36:11,803 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:11,803 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:36:11,804 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:36:11,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:11,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1450166356, now seen corresponding path program 478 times [2020-02-10 20:36:11,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:11,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746620856] [2020-02-10 20:36:11,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:11,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:12,371 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:36:12,500 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:36:12,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:36:12,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746620856] [2020-02-10 20:36:12,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:12,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:36:12,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528809639] [2020-02-10 20:36:12,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:36:12,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:12,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:36:12,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:36:12,510 INFO L87 Difference]: Start difference. First operand 3138 states and 15582 transitions. Second operand 12 states. [2020-02-10 20:36:12,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:12,732 INFO L93 Difference]: Finished difference Result 6055 states and 26860 transitions. [2020-02-10 20:36:12,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:36:12,733 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:36:12,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:12,748 INFO L225 Difference]: With dead ends: 6055 [2020-02-10 20:36:12,748 INFO L226 Difference]: Without dead ends: 6022 [2020-02-10 20:36:12,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:36:12,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6022 states. [2020-02-10 20:36:12,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6022 to 3127. [2020-02-10 20:36:12,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:36:12,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15554 transitions. [2020-02-10 20:36:12,932 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15554 transitions. Word has length 31 [2020-02-10 20:36:12,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:12,932 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15554 transitions. [2020-02-10 20:36:12,932 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:36:12,932 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15554 transitions. [2020-02-10 20:36:12,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:36:12,937 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:12,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:36:12,938 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:36:12,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:12,938 INFO L82 PathProgramCache]: Analyzing trace with hash 237951038, now seen corresponding path program 479 times [2020-02-10 20:36:12,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:12,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097568583] [2020-02-10 20:36:12,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:12,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:13,488 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:36:13,618 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:36:13,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:36:13,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097568583] [2020-02-10 20:36:13,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:13,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:36:13,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191895604] [2020-02-10 20:36:13,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:36:13,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:13,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:36:13,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:36:13,628 INFO L87 Difference]: Start difference. First operand 3127 states and 15554 transitions. Second operand 12 states. [2020-02-10 20:36:13,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:13,861 INFO L93 Difference]: Finished difference Result 6043 states and 26836 transitions. [2020-02-10 20:36:13,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:36:13,861 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:36:13,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:13,878 INFO L225 Difference]: With dead ends: 6043 [2020-02-10 20:36:13,878 INFO L226 Difference]: Without dead ends: 6026 [2020-02-10 20:36:13,878 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:36:14,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6026 states. [2020-02-10 20:36:14,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6026 to 3134. [2020-02-10 20:36:14,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3134 states. [2020-02-10 20:36:14,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3134 states to 3134 states and 15567 transitions. [2020-02-10 20:36:14,067 INFO L78 Accepts]: Start accepts. Automaton has 3134 states and 15567 transitions. Word has length 31 [2020-02-10 20:36:14,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:14,067 INFO L479 AbstractCegarLoop]: Abstraction has 3134 states and 15567 transitions. [2020-02-10 20:36:14,067 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:36:14,067 INFO L276 IsEmpty]: Start isEmpty. Operand 3134 states and 15567 transitions. [2020-02-10 20:36:14,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:36:14,072 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:14,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 20:36:14,073 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:36:14,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:14,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1874477592, now seen corresponding path program 480 times [2020-02-10 20:36:14,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:14,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898864442] [2020-02-10 20:36:14,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:14,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:14,633 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:36:14,763 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:36:14,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:36:14,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898864442] [2020-02-10 20:36:14,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:14,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:36:14,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501990817] [2020-02-10 20:36:14,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:36:14,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:14,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:36:14,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:36:14,773 INFO L87 Difference]: Start difference. First operand 3134 states and 15567 transitions. Second operand 12 states. [2020-02-10 20:36:15,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:15,102 INFO L93 Difference]: Finished difference Result 6048 states and 26839 transitions. [2020-02-10 20:36:15,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:36:15,103 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:36:15,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:15,118 INFO L225 Difference]: With dead ends: 6048 [2020-02-10 20:36:15,118 INFO L226 Difference]: Without dead ends: 5996 [2020-02-10 20:36:15,118 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:36:15,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5996 states. [2020-02-10 20:36:15,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5996 to 3104. [2020-02-10 20:36:15,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3104 states. [2020-02-10 20:36:15,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3104 states to 3104 states and 15505 transitions. [2020-02-10 20:36:15,304 INFO L78 Accepts]: Start accepts. Automaton has 3104 states and 15505 transitions. Word has length 31 [2020-02-10 20:36:15,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:15,304 INFO L479 AbstractCegarLoop]: Abstraction has 3104 states and 15505 transitions. [2020-02-10 20:36:15,304 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:36:15,304 INFO L276 IsEmpty]: Start isEmpty. Operand 3104 states and 15505 transitions. [2020-02-10 20:36:15,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:36:15,309 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:15,309 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:36:15,309 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:36:15,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:15,310 INFO L82 PathProgramCache]: Analyzing trace with hash 727124524, now seen corresponding path program 481 times [2020-02-10 20:36:15,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:15,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840628289] [2020-02-10 20:36:15,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:15,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:15,857 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:36:15,986 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:36:15,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:36:15,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840628289] [2020-02-10 20:36:15,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:15,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:36:15,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634918018] [2020-02-10 20:36:15,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:36:15,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:15,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:36:15,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:36:15,995 INFO L87 Difference]: Start difference. First operand 3104 states and 15505 transitions. Second operand 12 states. [2020-02-10 20:36:16,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:16,285 INFO L93 Difference]: Finished difference Result 5985 states and 26750 transitions. [2020-02-10 20:36:16,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:36:16,285 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:36:16,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:16,300 INFO L225 Difference]: With dead ends: 5985 [2020-02-10 20:36:16,300 INFO L226 Difference]: Without dead ends: 5966 [2020-02-10 20:36:16,300 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:36:16,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5966 states. [2020-02-10 20:36:16,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5966 to 3125. [2020-02-10 20:36:16,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 20:36:16,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15591 transitions. [2020-02-10 20:36:16,492 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15591 transitions. Word has length 31 [2020-02-10 20:36:16,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:16,492 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15591 transitions. [2020-02-10 20:36:16,492 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:36:16,492 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15591 transitions. [2020-02-10 20:36:16,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:36:16,497 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:16,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:36:16,497 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:36:16,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:16,498 INFO L82 PathProgramCache]: Analyzing trace with hash 304638798, now seen corresponding path program 482 times [2020-02-10 20:36:16,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:16,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289867230] [2020-02-10 20:36:16,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:16,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:17,026 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:36:17,156 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:36:17,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:36:17,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289867230] [2020-02-10 20:36:17,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:17,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:36:17,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812185528] [2020-02-10 20:36:17,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:36:17,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:17,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:36:17,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:36:17,166 INFO L87 Difference]: Start difference. First operand 3125 states and 15591 transitions. Second operand 12 states. [2020-02-10 20:36:17,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:17,524 INFO L93 Difference]: Finished difference Result 5982 states and 26739 transitions. [2020-02-10 20:36:17,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:36:17,524 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:36:17,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:17,539 INFO L225 Difference]: With dead ends: 5982 [2020-02-10 20:36:17,539 INFO L226 Difference]: Without dead ends: 5961 [2020-02-10 20:36:17,539 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:36:17,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5961 states. [2020-02-10 20:36:17,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5961 to 3120. [2020-02-10 20:36:17,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3120 states. [2020-02-10 20:36:17,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 15577 transitions. [2020-02-10 20:36:17,726 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 15577 transitions. Word has length 31 [2020-02-10 20:36:17,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:17,726 INFO L479 AbstractCegarLoop]: Abstraction has 3120 states and 15577 transitions. [2020-02-10 20:36:17,726 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:36:17,726 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 15577 transitions. [2020-02-10 20:36:17,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:36:17,731 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:17,731 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:36:17,732 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:36:17,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:17,732 INFO L82 PathProgramCache]: Analyzing trace with hash -121497948, now seen corresponding path program 483 times [2020-02-10 20:36:17,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:17,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039633979] [2020-02-10 20:36:17,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:17,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:18,444 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:36:18,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:36:18,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039633979] [2020-02-10 20:36:18,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:18,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:36:18,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690980751] [2020-02-10 20:36:18,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:36:18,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:18,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:36:18,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:36:18,455 INFO L87 Difference]: Start difference. First operand 3120 states and 15577 transitions. Second operand 12 states. [2020-02-10 20:36:18,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:18,806 INFO L93 Difference]: Finished difference Result 5987 states and 26750 transitions. [2020-02-10 20:36:18,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:36:18,806 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:36:18,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:18,820 INFO L225 Difference]: With dead ends: 5987 [2020-02-10 20:36:18,821 INFO L226 Difference]: Without dead ends: 5968 [2020-02-10 20:36:18,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:36:18,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5968 states. [2020-02-10 20:36:18,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5968 to 3126. [2020-02-10 20:36:18,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 20:36:19,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15588 transitions. [2020-02-10 20:36:19,004 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15588 transitions. Word has length 31 [2020-02-10 20:36:19,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:19,004 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15588 transitions. [2020-02-10 20:36:19,004 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:36:19,004 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15588 transitions. [2020-02-10 20:36:19,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:36:19,009 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:19,009 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:36:19,009 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:36:19,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:19,009 INFO L82 PathProgramCache]: Analyzing trace with hash 2061040718, now seen corresponding path program 484 times [2020-02-10 20:36:19,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:19,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630255398] [2020-02-10 20:36:19,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:19,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:19,546 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:36:19,682 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:36:19,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:36:19,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630255398] [2020-02-10 20:36:19,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:19,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:36:19,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368263092] [2020-02-10 20:36:19,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:36:19,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:19,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:36:19,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:36:19,693 INFO L87 Difference]: Start difference. First operand 3126 states and 15588 transitions. Second operand 12 states. [2020-02-10 20:36:20,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:20,052 INFO L93 Difference]: Finished difference Result 5985 states and 26740 transitions. [2020-02-10 20:36:20,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:36:20,052 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:36:20,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:20,067 INFO L225 Difference]: With dead ends: 5985 [2020-02-10 20:36:20,067 INFO L226 Difference]: Without dead ends: 5962 [2020-02-10 20:36:20,067 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:36:20,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5962 states. [2020-02-10 20:36:20,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5962 to 3120. [2020-02-10 20:36:20,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3120 states. [2020-02-10 20:36:20,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 15572 transitions. [2020-02-10 20:36:20,251 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 15572 transitions. Word has length 31 [2020-02-10 20:36:20,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:20,251 INFO L479 AbstractCegarLoop]: Abstraction has 3120 states and 15572 transitions. [2020-02-10 20:36:20,251 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:36:20,251 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 15572 transitions. [2020-02-10 20:36:20,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:36:20,256 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:20,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 20:36:20,256 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:36:20,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:20,256 INFO L82 PathProgramCache]: Analyzing trace with hash -756139292, now seen corresponding path program 485 times [2020-02-10 20:36:20,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:20,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578709748] [2020-02-10 20:36:20,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:20,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:20,811 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:36:20,941 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:36:20,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:36:20,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578709748] [2020-02-10 20:36:20,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:20,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:36:20,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630388813] [2020-02-10 20:36:20,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:36:20,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:20,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:36:20,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:36:20,951 INFO L87 Difference]: Start difference. First operand 3120 states and 15572 transitions. Second operand 12 states. [2020-02-10 20:36:21,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:21,173 INFO L93 Difference]: Finished difference Result 5980 states and 26730 transitions. [2020-02-10 20:36:21,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:36:21,173 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:36:21,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:21,186 INFO L225 Difference]: With dead ends: 5980 [2020-02-10 20:36:21,186 INFO L226 Difference]: Without dead ends: 5964 [2020-02-10 20:36:21,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:36:21,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5964 states. [2020-02-10 20:36:21,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5964 to 3125. [2020-02-10 20:36:21,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 20:36:21,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15581 transitions. [2020-02-10 20:36:21,369 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15581 transitions. Word has length 31 [2020-02-10 20:36:21,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:21,369 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15581 transitions. [2020-02-10 20:36:21,369 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:36:21,369 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15581 transitions. [2020-02-10 20:36:21,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:36:21,374 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:21,374 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:36:21,374 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:36:21,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:21,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1848885100, now seen corresponding path program 486 times [2020-02-10 20:36:21,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:21,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143825712] [2020-02-10 20:36:21,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:21,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:21,943 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:36:22,074 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:36:22,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:36:22,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143825712] [2020-02-10 20:36:22,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:22,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:36:22,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481254735] [2020-02-10 20:36:22,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:36:22,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:22,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:36:22,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:36:22,083 INFO L87 Difference]: Start difference. First operand 3125 states and 15581 transitions. Second operand 12 states. [2020-02-10 20:36:22,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:22,302 INFO L93 Difference]: Finished difference Result 5981 states and 26727 transitions. [2020-02-10 20:36:22,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:36:22,303 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:36:22,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:22,317 INFO L225 Difference]: With dead ends: 5981 [2020-02-10 20:36:22,317 INFO L226 Difference]: Without dead ends: 5954 [2020-02-10 20:36:22,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:36:22,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5954 states. [2020-02-10 20:36:22,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5954 to 3115. [2020-02-10 20:36:22,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3115 states. [2020-02-10 20:36:22,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3115 states to 3115 states and 15558 transitions. [2020-02-10 20:36:22,504 INFO L78 Accepts]: Start accepts. Automaton has 3115 states and 15558 transitions. Word has length 31 [2020-02-10 20:36:22,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:22,504 INFO L479 AbstractCegarLoop]: Abstraction has 3115 states and 15558 transitions. [2020-02-10 20:36:22,504 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:36:22,504 INFO L276 IsEmpty]: Start isEmpty. Operand 3115 states and 15558 transitions. [2020-02-10 20:36:22,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:36:22,509 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:22,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:36:22,509 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:36:22,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:22,510 INFO L82 PathProgramCache]: Analyzing trace with hash 458378096, now seen corresponding path program 487 times [2020-02-10 20:36:22,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:22,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673828994] [2020-02-10 20:36:22,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:22,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:23,061 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:36:23,194 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:36:23,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:36:23,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673828994] [2020-02-10 20:36:23,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:23,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:36:23,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951675000] [2020-02-10 20:36:23,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:36:23,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:23,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:36:23,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:36:23,203 INFO L87 Difference]: Start difference. First operand 3115 states and 15558 transitions. Second operand 12 states. [2020-02-10 20:36:23,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:23,424 INFO L93 Difference]: Finished difference Result 5987 states and 26750 transitions. [2020-02-10 20:36:23,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:36:23,424 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:36:23,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:23,437 INFO L225 Difference]: With dead ends: 5987 [2020-02-10 20:36:23,438 INFO L226 Difference]: Without dead ends: 5968 [2020-02-10 20:36:23,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:36:23,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5968 states. [2020-02-10 20:36:23,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5968 to 3125. [2020-02-10 20:36:23,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 20:36:23,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15586 transitions. [2020-02-10 20:36:23,620 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15586 transitions. Word has length 31 [2020-02-10 20:36:23,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:23,620 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15586 transitions. [2020-02-10 20:36:23,620 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:36:23,620 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15586 transitions. [2020-02-10 20:36:23,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:36:23,625 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:23,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 20:36:23,625 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:36:23,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:23,626 INFO L82 PathProgramCache]: Analyzing trace with hash 35892370, now seen corresponding path program 488 times [2020-02-10 20:36:23,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:23,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605654315] [2020-02-10 20:36:23,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:23,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:24,164 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2020-02-10 20:36:24,296 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:36:24,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:36:24,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605654315] [2020-02-10 20:36:24,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:24,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:36:24,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675796710] [2020-02-10 20:36:24,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:36:24,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:24,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:36:24,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:36:24,306 INFO L87 Difference]: Start difference. First operand 3125 states and 15586 transitions. Second operand 12 states. [2020-02-10 20:36:24,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:24,530 INFO L93 Difference]: Finished difference Result 5984 states and 26739 transitions. [2020-02-10 20:36:24,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:36:24,531 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:36:24,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:24,547 INFO L225 Difference]: With dead ends: 5984 [2020-02-10 20:36:24,548 INFO L226 Difference]: Without dead ends: 5963 [2020-02-10 20:36:24,548 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:36:24,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5963 states. [2020-02-10 20:36:24,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5963 to 3120. [2020-02-10 20:36:24,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3120 states. [2020-02-10 20:36:24,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 15572 transitions. [2020-02-10 20:36:24,738 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 15572 transitions. Word has length 31 [2020-02-10 20:36:24,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:24,738 INFO L479 AbstractCegarLoop]: Abstraction has 3120 states and 15572 transitions. [2020-02-10 20:36:24,738 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:36:24,738 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 15572 transitions. [2020-02-10 20:36:24,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:36:24,743 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:24,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:36:24,743 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:36:24,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:24,743 INFO L82 PathProgramCache]: Analyzing trace with hash -814555612, now seen corresponding path program 489 times [2020-02-10 20:36:24,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:24,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896226811] [2020-02-10 20:36:24,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:24,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:25,287 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:36:25,420 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:36:25,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:36:25,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896226811] [2020-02-10 20:36:25,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:25,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:36:25,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261432727] [2020-02-10 20:36:25,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:36:25,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:25,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:36:25,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:36:25,431 INFO L87 Difference]: Start difference. First operand 3120 states and 15572 transitions. Second operand 12 states. [2020-02-10 20:36:25,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:25,657 INFO L93 Difference]: Finished difference Result 5991 states and 26755 transitions. [2020-02-10 20:36:25,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:36:25,658 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:36:25,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:25,672 INFO L225 Difference]: With dead ends: 5991 [2020-02-10 20:36:25,672 INFO L226 Difference]: Without dead ends: 5972 [2020-02-10 20:36:25,672 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:36:25,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5972 states. [2020-02-10 20:36:25,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5972 to 3127. [2020-02-10 20:36:25,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:36:25,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15585 transitions. [2020-02-10 20:36:25,921 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15585 transitions. Word has length 31 [2020-02-10 20:36:25,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:25,921 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15585 transitions. [2020-02-10 20:36:25,921 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:36:25,921 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15585 transitions. [2020-02-10 20:36:25,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:36:25,927 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:25,927 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:36:25,927 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:36:25,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:25,927 INFO L82 PathProgramCache]: Analyzing trace with hash 523011602, now seen corresponding path program 490 times [2020-02-10 20:36:25,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:25,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216111329] [2020-02-10 20:36:25,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:25,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:26,607 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:36:26,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:36:26,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216111329] [2020-02-10 20:36:26,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:26,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:36:26,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311248946] [2020-02-10 20:36:26,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:36:26,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:26,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:36:26,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:36:26,617 INFO L87 Difference]: Start difference. First operand 3127 states and 15585 transitions. Second operand 12 states. [2020-02-10 20:36:26,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:26,840 INFO L93 Difference]: Finished difference Result 5990 states and 26746 transitions. [2020-02-10 20:36:26,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:36:26,840 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:36:26,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:26,855 INFO L225 Difference]: With dead ends: 5990 [2020-02-10 20:36:26,855 INFO L226 Difference]: Without dead ends: 5965 [2020-02-10 20:36:26,855 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:36:26,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5965 states. [2020-02-10 20:36:27,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5965 to 3120. [2020-02-10 20:36:27,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3120 states. [2020-02-10 20:36:27,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 15567 transitions. [2020-02-10 20:36:27,043 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 15567 transitions. Word has length 31 [2020-02-10 20:36:27,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:27,043 INFO L479 AbstractCegarLoop]: Abstraction has 3120 states and 15567 transitions. [2020-02-10 20:36:27,043 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:36:27,043 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 15567 transitions. [2020-02-10 20:36:27,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:36:27,049 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:27,049 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:36:27,049 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:36:27,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:27,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1449196956, now seen corresponding path program 491 times [2020-02-10 20:36:27,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:27,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942776964] [2020-02-10 20:36:27,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:27,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:27,588 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:36:27,720 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:36:27,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:36:27,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942776964] [2020-02-10 20:36:27,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:27,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:36:27,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867489909] [2020-02-10 20:36:27,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:36:27,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:27,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:36:27,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:36:27,730 INFO L87 Difference]: Start difference. First operand 3120 states and 15567 transitions. Second operand 12 states. [2020-02-10 20:36:27,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:27,959 INFO L93 Difference]: Finished difference Result 5983 states and 26732 transitions. [2020-02-10 20:36:27,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:36:27,960 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:36:27,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:27,974 INFO L225 Difference]: With dead ends: 5983 [2020-02-10 20:36:27,975 INFO L226 Difference]: Without dead ends: 5967 [2020-02-10 20:36:27,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:36:28,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5967 states. [2020-02-10 20:36:28,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5967 to 3125. [2020-02-10 20:36:28,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 20:36:28,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15576 transitions. [2020-02-10 20:36:28,156 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15576 transitions. Word has length 31 [2020-02-10 20:36:28,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:28,156 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15576 transitions. [2020-02-10 20:36:28,156 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:36:28,156 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15576 transitions. [2020-02-10 20:36:28,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:36:28,161 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:28,161 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:36:28,161 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:36:28,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:28,162 INFO L82 PathProgramCache]: Analyzing trace with hash 310855984, now seen corresponding path program 492 times [2020-02-10 20:36:28,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:28,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082738683] [2020-02-10 20:36:28,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:28,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:28,688 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:36:28,819 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:36:28,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:36:28,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082738683] [2020-02-10 20:36:28,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:28,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:36:28,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765713298] [2020-02-10 20:36:28,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:36:28,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:28,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:36:28,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:36:28,829 INFO L87 Difference]: Start difference. First operand 3125 states and 15576 transitions. Second operand 12 states. [2020-02-10 20:36:29,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:29,094 INFO L93 Difference]: Finished difference Result 5985 states and 26731 transitions. [2020-02-10 20:36:29,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:36:29,095 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:36:29,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:29,109 INFO L225 Difference]: With dead ends: 5985 [2020-02-10 20:36:29,109 INFO L226 Difference]: Without dead ends: 5957 [2020-02-10 20:36:29,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:36:29,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5957 states. [2020-02-10 20:36:29,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5957 to 3115. [2020-02-10 20:36:29,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3115 states. [2020-02-10 20:36:29,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3115 states to 3115 states and 15553 transitions. [2020-02-10 20:36:29,292 INFO L78 Accepts]: Start accepts. Automaton has 3115 states and 15553 transitions. Word has length 31 [2020-02-10 20:36:29,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:29,292 INFO L479 AbstractCegarLoop]: Abstraction has 3115 states and 15553 transitions. [2020-02-10 20:36:29,292 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:36:29,292 INFO L276 IsEmpty]: Start isEmpty. Operand 3115 states and 15553 transitions. [2020-02-10 20:36:29,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:36:29,297 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:29,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:36:29,297 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:36:29,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:29,297 INFO L82 PathProgramCache]: Analyzing trace with hash -927737232, now seen corresponding path program 493 times [2020-02-10 20:36:29,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:29,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150128188] [2020-02-10 20:36:29,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:29,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:29,850 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:36:29,979 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:36:29,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:36:29,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150128188] [2020-02-10 20:36:29,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:29,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:36:29,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714280291] [2020-02-10 20:36:29,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:36:29,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:29,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:36:29,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:36:29,989 INFO L87 Difference]: Start difference. First operand 3115 states and 15553 transitions. Second operand 12 states. [2020-02-10 20:36:30,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:30,217 INFO L93 Difference]: Finished difference Result 5993 states and 26762 transitions. [2020-02-10 20:36:30,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:36:30,218 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:36:30,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:30,232 INFO L225 Difference]: With dead ends: 5993 [2020-02-10 20:36:30,232 INFO L226 Difference]: Without dead ends: 5974 [2020-02-10 20:36:30,232 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:36:30,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5974 states. [2020-02-10 20:36:30,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5974 to 3127. [2020-02-10 20:36:30,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:36:30,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15587 transitions. [2020-02-10 20:36:30,419 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15587 transitions. Word has length 31 [2020-02-10 20:36:30,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:30,419 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15587 transitions. [2020-02-10 20:36:30,419 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:36:30,419 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15587 transitions. [2020-02-10 20:36:30,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:36:30,424 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:30,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:36:30,424 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:36:30,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:30,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1254801434, now seen corresponding path program 494 times [2020-02-10 20:36:30,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:30,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577105217] [2020-02-10 20:36:30,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:30,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:30,986 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:36:31,117 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:36:31,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:36:31,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577105217] [2020-02-10 20:36:31,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:31,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:36:31,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085159500] [2020-02-10 20:36:31,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:36:31,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:31,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:36:31,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:36:31,128 INFO L87 Difference]: Start difference. First operand 3127 states and 15587 transitions. Second operand 12 states. [2020-02-10 20:36:31,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:31,353 INFO L93 Difference]: Finished difference Result 5991 states and 26752 transitions. [2020-02-10 20:36:31,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:36:31,353 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:36:31,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:31,369 INFO L225 Difference]: With dead ends: 5991 [2020-02-10 20:36:31,369 INFO L226 Difference]: Without dead ends: 5968 [2020-02-10 20:36:31,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:36:31,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5968 states. [2020-02-10 20:36:31,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5968 to 3121. [2020-02-10 20:36:31,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 20:36:31,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15570 transitions. [2020-02-10 20:36:31,553 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15570 transitions. Word has length 31 [2020-02-10 20:36:31,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:31,553 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15570 transitions. [2020-02-10 20:36:31,553 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:36:31,553 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15570 transitions. [2020-02-10 20:36:31,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:36:31,558 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:31,558 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:36:31,558 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:36:31,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:31,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1352048468, now seen corresponding path program 495 times [2020-02-10 20:36:31,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:31,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942007840] [2020-02-10 20:36:31,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:31,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:32,115 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:36:32,245 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:36:32,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:36:32,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942007840] [2020-02-10 20:36:32,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:32,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:36:32,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293059142] [2020-02-10 20:36:32,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:36:32,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:32,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:36:32,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:36:32,255 INFO L87 Difference]: Start difference. First operand 3121 states and 15570 transitions. Second operand 12 states. [2020-02-10 20:36:32,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:32,509 INFO L93 Difference]: Finished difference Result 5995 states and 26761 transitions. [2020-02-10 20:36:32,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:36:32,510 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:36:32,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:32,524 INFO L225 Difference]: With dead ends: 5995 [2020-02-10 20:36:32,524 INFO L226 Difference]: Without dead ends: 5976 [2020-02-10 20:36:32,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:36:32,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5976 states. [2020-02-10 20:36:32,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5976 to 3128. [2020-02-10 20:36:32,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 20:36:32,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15583 transitions. [2020-02-10 20:36:32,707 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15583 transitions. Word has length 31 [2020-02-10 20:36:32,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:32,707 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15583 transitions. [2020-02-10 20:36:32,707 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:36:32,707 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15583 transitions. [2020-02-10 20:36:32,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:36:32,712 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:32,713 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:36:32,713 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:36:32,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:32,713 INFO L82 PathProgramCache]: Analyzing trace with hash -14481254, now seen corresponding path program 496 times [2020-02-10 20:36:32,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:32,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784164696] [2020-02-10 20:36:32,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:32,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:33,259 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:36:33,390 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:36:33,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:36:33,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784164696] [2020-02-10 20:36:33,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:33,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:36:33,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587612339] [2020-02-10 20:36:33,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:36:33,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:33,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:36:33,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:36:33,400 INFO L87 Difference]: Start difference. First operand 3128 states and 15583 transitions. Second operand 12 states. [2020-02-10 20:36:33,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:33,628 INFO L93 Difference]: Finished difference Result 5994 states and 26752 transitions. [2020-02-10 20:36:33,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:36:33,628 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:36:33,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:33,642 INFO L225 Difference]: With dead ends: 5994 [2020-02-10 20:36:33,642 INFO L226 Difference]: Without dead ends: 5969 [2020-02-10 20:36:33,642 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:36:33,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5969 states. [2020-02-10 20:36:33,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5969 to 3121. [2020-02-10 20:36:33,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 20:36:33,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15564 transitions. [2020-02-10 20:36:33,883 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15564 transitions. Word has length 31 [2020-02-10 20:36:33,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:33,884 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15564 transitions. [2020-02-10 20:36:33,884 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:36:33,884 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15564 transitions. [2020-02-10 20:36:33,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:36:33,889 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:33,889 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:36:33,889 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:36:33,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:33,889 INFO L82 PathProgramCache]: Analyzing trace with hash -230287892, now seen corresponding path program 497 times [2020-02-10 20:36:33,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:33,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592339531] [2020-02-10 20:36:33,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:33,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:34,428 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:36:34,559 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:36:34,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:36:34,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592339531] [2020-02-10 20:36:34,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:34,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:36:34,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633953276] [2020-02-10 20:36:34,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:36:34,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:34,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:36:34,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:36:34,570 INFO L87 Difference]: Start difference. First operand 3121 states and 15564 transitions. Second operand 12 states. [2020-02-10 20:36:34,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:34,788 INFO L93 Difference]: Finished difference Result 5990 states and 26744 transitions. [2020-02-10 20:36:34,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:36:34,789 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:36:34,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:34,804 INFO L225 Difference]: With dead ends: 5990 [2020-02-10 20:36:34,804 INFO L226 Difference]: Without dead ends: 5973 [2020-02-10 20:36:34,804 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:36:34,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5973 states. [2020-02-10 20:36:34,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5973 to 3127. [2020-02-10 20:36:34,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:36:34,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15575 transitions. [2020-02-10 20:36:34,991 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15575 transitions. Word has length 31 [2020-02-10 20:36:34,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:34,992 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15575 transitions. [2020-02-10 20:36:34,992 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:36:34,992 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15575 transitions. [2020-02-10 20:36:34,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:36:34,997 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:34,997 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:36:34,997 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:36:34,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:34,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1075259344, now seen corresponding path program 498 times [2020-02-10 20:36:34,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:34,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148358871] [2020-02-10 20:36:34,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:34,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:35,546 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:36:35,678 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:36:35,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:36:35,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148358871] [2020-02-10 20:36:35,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:35,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:36:35,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485089185] [2020-02-10 20:36:35,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:36:35,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:35,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:36:35,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:36:35,689 INFO L87 Difference]: Start difference. First operand 3127 states and 15575 transitions. Second operand 12 states. [2020-02-10 20:36:35,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:35,919 INFO L93 Difference]: Finished difference Result 5991 states and 26740 transitions. [2020-02-10 20:36:35,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:36:35,919 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:36:35,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:35,934 INFO L225 Difference]: With dead ends: 5991 [2020-02-10 20:36:35,935 INFO L226 Difference]: Without dead ends: 5961 [2020-02-10 20:36:35,935 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:36:36,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5961 states. [2020-02-10 20:36:36,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5961 to 3115. [2020-02-10 20:36:36,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3115 states. [2020-02-10 20:36:36,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3115 states to 3115 states and 15548 transitions. [2020-02-10 20:36:36,116 INFO L78 Accepts]: Start accepts. Automaton has 3115 states and 15548 transitions. Word has length 31 [2020-02-10 20:36:36,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:36,117 INFO L479 AbstractCegarLoop]: Abstraction has 3115 states and 15548 transitions. [2020-02-10 20:36:36,117 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:36:36,117 INFO L276 IsEmpty]: Start isEmpty. Operand 3115 states and 15548 transitions. [2020-02-10 20:36:36,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:36:36,122 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:36,122 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:36:36,122 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:36:36,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:36,122 INFO L82 PathProgramCache]: Analyzing trace with hash 450731858, now seen corresponding path program 499 times [2020-02-10 20:36:36,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:36,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769094894] [2020-02-10 20:36:36,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:36,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:36,687 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:36:36,820 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:36:36,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 20:36:36,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769094894] [2020-02-10 20:36:36,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:36,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:36:36,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991976118] [2020-02-10 20:36:36,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:36:36,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:36,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:36:36,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:36:36,831 INFO L87 Difference]: Start difference. First operand 3115 states and 15548 transitions. Second operand 12 states. [2020-02-10 20:36:37,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:37,086 INFO L93 Difference]: Finished difference Result 5979 states and 26723 transitions. [2020-02-10 20:36:37,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:36:37,086 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:36:37,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:37,100 INFO L225 Difference]: With dead ends: 5979 [2020-02-10 20:36:37,100 INFO L226 Difference]: Without dead ends: 5963 [2020-02-10 20:36:37,100 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:36:37,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5963 states. [2020-02-10 20:36:37,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5963 to 3125. [2020-02-10 20:36:37,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 20:36:37,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15576 transitions. [2020-02-10 20:36:37,287 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15576 transitions. Word has length 31 [2020-02-10 20:36:37,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:37,287 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15576 transitions. [2020-02-10 20:36:37,287 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:36:37,288 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15576 transitions. [2020-02-10 20:36:37,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:36:37,293 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:37,293 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:36:37,293 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:36:37,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:37,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1239211046, now seen corresponding path program 500 times [2020-02-10 20:36:37,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:37,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235837211] [2020-02-10 20:36:37,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:37,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:37,842 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:36:37,974 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:36:37,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:36:37,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235837211] [2020-02-10 20:36:37,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:37,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:36:37,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579345561] [2020-02-10 20:36:37,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:36:37,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:37,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:36:37,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:36:37,985 INFO L87 Difference]: Start difference. First operand 3125 states and 15576 transitions. Second operand 12 states. [2020-02-10 20:36:38,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:38,207 INFO L93 Difference]: Finished difference Result 5980 states and 26720 transitions. [2020-02-10 20:36:38,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:36:38,208 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:36:38,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:38,223 INFO L225 Difference]: With dead ends: 5980 [2020-02-10 20:36:38,223 INFO L226 Difference]: Without dead ends: 5958 [2020-02-10 20:36:38,223 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:36:38,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5958 states. [2020-02-10 20:36:38,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5958 to 3120. [2020-02-10 20:36:38,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3120 states. [2020-02-10 20:36:38,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 15562 transitions. [2020-02-10 20:36:38,410 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 15562 transitions. Word has length 31 [2020-02-10 20:36:38,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:38,410 INFO L479 AbstractCegarLoop]: Abstraction has 3120 states and 15562 transitions. [2020-02-10 20:36:38,410 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:36:38,410 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 15562 transitions. [2020-02-10 20:36:38,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:36:38,415 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:38,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:36:38,415 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:36:38,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:38,415 INFO L82 PathProgramCache]: Analyzing trace with hash 26420622, now seen corresponding path program 501 times [2020-02-10 20:36:38,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:38,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107013371] [2020-02-10 20:36:38,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:38,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:38,957 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:36:39,089 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:36:39,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:36:39,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107013371] [2020-02-10 20:36:39,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:39,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:36:39,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555252809] [2020-02-10 20:36:39,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:36:39,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:39,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:36:39,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:36:39,099 INFO L87 Difference]: Start difference. First operand 3120 states and 15562 transitions. Second operand 12 states. [2020-02-10 20:36:39,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:39,406 INFO L93 Difference]: Finished difference Result 5980 states and 26720 transitions. [2020-02-10 20:36:39,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:36:39,406 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:36:39,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:39,421 INFO L225 Difference]: With dead ends: 5980 [2020-02-10 20:36:39,422 INFO L226 Difference]: Without dead ends: 5964 [2020-02-10 20:36:39,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:36:39,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5964 states. [2020-02-10 20:36:39,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5964 to 3125. [2020-02-10 20:36:39,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 20:36:39,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15571 transitions. [2020-02-10 20:36:39,605 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15571 transitions. Word has length 31 [2020-02-10 20:36:39,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:39,605 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15571 transitions. [2020-02-10 20:36:39,605 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:36:39,606 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15571 transitions. [2020-02-10 20:36:39,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:36:39,611 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:39,611 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:36:39,611 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:36:39,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:39,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1786473562, now seen corresponding path program 502 times [2020-02-10 20:36:39,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:39,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246991710] [2020-02-10 20:36:39,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:39,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:40,161 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:36:40,296 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:36:40,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:36:40,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246991710] [2020-02-10 20:36:40,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:40,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:36:40,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947437103] [2020-02-10 20:36:40,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:36:40,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:40,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:36:40,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:36:40,307 INFO L87 Difference]: Start difference. First operand 3125 states and 15571 transitions. Second operand 12 states. [2020-02-10 20:36:40,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:40,588 INFO L93 Difference]: Finished difference Result 5982 states and 26719 transitions. [2020-02-10 20:36:40,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:36:40,588 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:36:40,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:40,603 INFO L225 Difference]: With dead ends: 5982 [2020-02-10 20:36:40,603 INFO L226 Difference]: Without dead ends: 5959 [2020-02-10 20:36:40,603 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:36:40,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5959 states. [2020-02-10 20:36:40,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5959 to 3120. [2020-02-10 20:36:40,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3120 states. [2020-02-10 20:36:40,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 15557 transitions. [2020-02-10 20:36:40,789 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 15557 transitions. Word has length 31 [2020-02-10 20:36:40,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:40,790 INFO L479 AbstractCegarLoop]: Abstraction has 3120 states and 15557 transitions. [2020-02-10 20:36:40,790 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:36:40,790 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 15557 transitions. [2020-02-10 20:36:40,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:36:40,795 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:40,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:36:40,795 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:36:40,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:40,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1782822542, now seen corresponding path program 503 times [2020-02-10 20:36:40,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:40,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039831738] [2020-02-10 20:36:40,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:40,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:41,343 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:36:41,477 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:36:41,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:36:41,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039831738] [2020-02-10 20:36:41,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:41,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:36:41,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449836685] [2020-02-10 20:36:41,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:36:41,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:41,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:36:41,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:36:41,488 INFO L87 Difference]: Start difference. First operand 3120 states and 15557 transitions. Second operand 12 states. [2020-02-10 20:36:41,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:41,802 INFO L93 Difference]: Finished difference Result 5983 states and 26722 transitions. [2020-02-10 20:36:41,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:36:41,803 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:36:41,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:41,817 INFO L225 Difference]: With dead ends: 5983 [2020-02-10 20:36:41,818 INFO L226 Difference]: Without dead ends: 5966 [2020-02-10 20:36:41,818 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:36:41,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5966 states. [2020-02-10 20:36:42,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5966 to 3126. [2020-02-10 20:36:42,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 20:36:42,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15568 transitions. [2020-02-10 20:36:42,054 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15568 transitions. Word has length 31 [2020-02-10 20:36:42,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:42,054 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15568 transitions. [2020-02-10 20:36:42,054 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:36:42,054 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15568 transitions. [2020-02-10 20:36:42,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:36:42,059 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:42,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:36:42,059 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:36:42,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:42,060 INFO L82 PathProgramCache]: Analyzing trace with hash 937851090, now seen corresponding path program 504 times [2020-02-10 20:36:42,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:42,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630120615] [2020-02-10 20:36:42,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:42,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:42,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:36:42,739 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:36:42,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:36:42,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630120615] [2020-02-10 20:36:42,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:42,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:36:42,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064832104] [2020-02-10 20:36:42,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:36:42,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:42,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:36:42,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:36:42,750 INFO L87 Difference]: Start difference. First operand 3126 states and 15568 transitions. Second operand 12 states. [2020-02-10 20:36:42,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:42,989 INFO L93 Difference]: Finished difference Result 5984 states and 26718 transitions. [2020-02-10 20:36:42,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:36:42,989 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:36:42,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:43,004 INFO L225 Difference]: With dead ends: 5984 [2020-02-10 20:36:43,004 INFO L226 Difference]: Without dead ends: 5950 [2020-02-10 20:36:43,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:36:43,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5950 states. [2020-02-10 20:36:43,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5950 to 3110. [2020-02-10 20:36:43,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3110 states. [2020-02-10 20:36:43,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3110 states to 3110 states and 15534 transitions. [2020-02-10 20:36:43,192 INFO L78 Accepts]: Start accepts. Automaton has 3110 states and 15534 transitions. Word has length 31 [2020-02-10 20:36:43,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:43,192 INFO L479 AbstractCegarLoop]: Abstraction has 3110 states and 15534 transitions. [2020-02-10 20:36:43,192 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:36:43,192 INFO L276 IsEmpty]: Start isEmpty. Operand 3110 states and 15534 transitions. [2020-02-10 20:36:43,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:36:43,197 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:43,197 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:36:43,197 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:36:43,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:43,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1032166138, now seen corresponding path program 505 times [2020-02-10 20:36:43,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:43,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946982676] [2020-02-10 20:36:43,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:43,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:43,721 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:36:43,858 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:36:43,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:36:43,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946982676] [2020-02-10 20:36:43,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:43,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:36:43,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693134875] [2020-02-10 20:36:43,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:36:43,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:43,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:36:43,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:36:43,869 INFO L87 Difference]: Start difference. First operand 3110 states and 15534 transitions. Second operand 12 states. [2020-02-10 20:36:44,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:44,182 INFO L93 Difference]: Finished difference Result 5997 states and 26774 transitions. [2020-02-10 20:36:44,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:36:44,183 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:36:44,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:44,197 INFO L225 Difference]: With dead ends: 5997 [2020-02-10 20:36:44,198 INFO L226 Difference]: Without dead ends: 5978 [2020-02-10 20:36:44,198 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:36:44,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5978 states. [2020-02-10 20:36:44,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5978 to 3126. [2020-02-10 20:36:44,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 20:36:44,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15590 transitions. [2020-02-10 20:36:44,384 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15590 transitions. Word has length 31 [2020-02-10 20:36:44,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:44,384 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15590 transitions. [2020-02-10 20:36:44,384 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:36:44,384 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15590 transitions. [2020-02-10 20:36:44,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:36:44,389 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:44,389 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:36:44,389 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:36:44,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:44,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1454651864, now seen corresponding path program 506 times [2020-02-10 20:36:44,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:44,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471326538] [2020-02-10 20:36:44,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:44,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:44,915 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:36:45,046 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:36:45,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:36:45,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471326538] [2020-02-10 20:36:45,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:45,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:36:45,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404468038] [2020-02-10 20:36:45,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:36:45,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:45,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:36:45,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:36:45,056 INFO L87 Difference]: Start difference. First operand 3126 states and 15590 transitions. Second operand 12 states. [2020-02-10 20:36:45,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:45,302 INFO L93 Difference]: Finished difference Result 5994 states and 26763 transitions. [2020-02-10 20:36:45,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:36:45,303 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:36:45,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:45,317 INFO L225 Difference]: With dead ends: 5994 [2020-02-10 20:36:45,317 INFO L226 Difference]: Without dead ends: 5973 [2020-02-10 20:36:45,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:36:45,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5973 states. [2020-02-10 20:36:45,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5973 to 3121. [2020-02-10 20:36:45,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 20:36:45,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15576 transitions. [2020-02-10 20:36:45,502 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15576 transitions. Word has length 31 [2020-02-10 20:36:45,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:45,502 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15576 transitions. [2020-02-10 20:36:45,502 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:36:45,502 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15576 transitions. [2020-02-10 20:36:45,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:36:45,507 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:45,507 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:36:45,508 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:36:45,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:45,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1880788610, now seen corresponding path program 507 times [2020-02-10 20:36:45,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:45,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615416848] [2020-02-10 20:36:45,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:45,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:46,038 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:36:46,170 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:36:46,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:36:46,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615416848] [2020-02-10 20:36:46,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:46,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:36:46,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894480884] [2020-02-10 20:36:46,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:36:46,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:46,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:36:46,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:36:46,179 INFO L87 Difference]: Start difference. First operand 3121 states and 15576 transitions. Second operand 12 states. [2020-02-10 20:36:46,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:46,441 INFO L93 Difference]: Finished difference Result 5999 states and 26774 transitions. [2020-02-10 20:36:46,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:36:46,441 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:36:46,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:46,456 INFO L225 Difference]: With dead ends: 5999 [2020-02-10 20:36:46,456 INFO L226 Difference]: Without dead ends: 5980 [2020-02-10 20:36:46,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:36:46,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5980 states. [2020-02-10 20:36:46,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5980 to 3127. [2020-02-10 20:36:46,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:36:46,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15587 transitions. [2020-02-10 20:36:46,638 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15587 transitions. Word has length 31 [2020-02-10 20:36:46,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:46,638 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15587 transitions. [2020-02-10 20:36:46,639 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:36:46,639 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15587 transitions. [2020-02-10 20:36:46,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:36:46,644 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:46,644 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:36:46,644 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:36:46,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:46,644 INFO L82 PathProgramCache]: Analyzing trace with hash 301750056, now seen corresponding path program 508 times [2020-02-10 20:36:46,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:46,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966983998] [2020-02-10 20:36:46,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:46,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:47,174 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:36:47,307 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:36:47,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:36:47,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966983998] [2020-02-10 20:36:47,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:47,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:36:47,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255159911] [2020-02-10 20:36:47,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:36:47,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:47,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:36:47,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:36:47,317 INFO L87 Difference]: Start difference. First operand 3127 states and 15587 transitions. Second operand 12 states. [2020-02-10 20:36:47,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:47,598 INFO L93 Difference]: Finished difference Result 5997 states and 26764 transitions. [2020-02-10 20:36:47,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:36:47,598 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:36:47,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:47,612 INFO L225 Difference]: With dead ends: 5997 [2020-02-10 20:36:47,612 INFO L226 Difference]: Without dead ends: 5974 [2020-02-10 20:36:47,612 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:36:47,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5974 states. [2020-02-10 20:36:47,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5974 to 3121. [2020-02-10 20:36:47,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 20:36:47,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15571 transitions. [2020-02-10 20:36:47,796 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15571 transitions. Word has length 31 [2020-02-10 20:36:47,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:47,796 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15571 transitions. [2020-02-10 20:36:47,796 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:36:47,796 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15571 transitions. [2020-02-10 20:36:47,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:36:47,801 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:47,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 20:36:47,801 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:36:47,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:47,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1779537342, now seen corresponding path program 509 times [2020-02-10 20:36:47,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:47,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935958622] [2020-02-10 20:36:47,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:47,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:48,345 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:36:48,478 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:36:48,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:36:48,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935958622] [2020-02-10 20:36:48,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:48,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:36:48,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660060434] [2020-02-10 20:36:48,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:36:48,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:48,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:36:48,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:36:48,488 INFO L87 Difference]: Start difference. First operand 3121 states and 15571 transitions. Second operand 12 states. [2020-02-10 20:36:48,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:48,720 INFO L93 Difference]: Finished difference Result 5992 states and 26754 transitions. [2020-02-10 20:36:48,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:36:48,720 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:36:48,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:48,735 INFO L225 Difference]: With dead ends: 5992 [2020-02-10 20:36:48,735 INFO L226 Difference]: Without dead ends: 5976 [2020-02-10 20:36:48,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:36:48,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5976 states. [2020-02-10 20:36:48,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5976 to 3126. [2020-02-10 20:36:48,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 20:36:48,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15580 transitions. [2020-02-10 20:36:48,923 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15580 transitions. Word has length 31 [2020-02-10 20:36:48,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:48,924 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15580 transitions. [2020-02-10 20:36:48,924 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:36:48,924 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15580 transitions. [2020-02-10 20:36:48,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:36:48,929 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:48,929 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:36:48,929 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:36:48,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:48,929 INFO L82 PathProgramCache]: Analyzing trace with hash 89594438, now seen corresponding path program 510 times [2020-02-10 20:36:48,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:48,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546071971] [2020-02-10 20:36:48,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:48,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:49,472 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:36:49,604 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:36:49,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:36:49,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546071971] [2020-02-10 20:36:49,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:49,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:36:49,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954887321] [2020-02-10 20:36:49,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:36:49,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:49,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:36:49,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:36:49,614 INFO L87 Difference]: Start difference. First operand 3126 states and 15580 transitions. Second operand 12 states. [2020-02-10 20:36:49,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:49,845 INFO L93 Difference]: Finished difference Result 5993 states and 26751 transitions. [2020-02-10 20:36:49,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:36:49,846 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:36:49,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:49,860 INFO L225 Difference]: With dead ends: 5993 [2020-02-10 20:36:49,860 INFO L226 Difference]: Without dead ends: 5966 [2020-02-10 20:36:49,861 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:36:50,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5966 states. [2020-02-10 20:36:50,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5966 to 3116. [2020-02-10 20:36:50,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3116 states. [2020-02-10 20:36:50,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3116 states to 3116 states and 15557 transitions. [2020-02-10 20:36:50,092 INFO L78 Accepts]: Start accepts. Automaton has 3116 states and 15557 transitions. Word has length 31 [2020-02-10 20:36:50,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:50,093 INFO L479 AbstractCegarLoop]: Abstraction has 3116 states and 15557 transitions. [2020-02-10 20:36:50,093 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:36:50,093 INFO L276 IsEmpty]: Start isEmpty. Operand 3116 states and 15557 transitions. [2020-02-10 20:36:50,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:36:50,098 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:50,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:36:50,098 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:36:50,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:50,098 INFO L82 PathProgramCache]: Analyzing trace with hash 443451440, now seen corresponding path program 511 times [2020-02-10 20:36:50,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:50,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666113335] [2020-02-10 20:36:50,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:50,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:50,740 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:36:50,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:36:50,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666113335] [2020-02-10 20:36:50,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:50,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:36:50,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237562150] [2020-02-10 20:36:50,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:36:50,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:50,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:36:50,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:36:50,750 INFO L87 Difference]: Start difference. First operand 3116 states and 15557 transitions. Second operand 12 states. [2020-02-10 20:36:50,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:50,986 INFO L93 Difference]: Finished difference Result 6007 states and 26791 transitions. [2020-02-10 20:36:50,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:36:50,987 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:36:50,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:51,002 INFO L225 Difference]: With dead ends: 6007 [2020-02-10 20:36:51,002 INFO L226 Difference]: Without dead ends: 5988 [2020-02-10 20:36:51,002 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:36:51,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5988 states. [2020-02-10 20:36:51,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5988 to 3127. [2020-02-10 20:36:51,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:36:51,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15588 transitions. [2020-02-10 20:36:51,190 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15588 transitions. Word has length 31 [2020-02-10 20:36:51,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:51,190 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15588 transitions. [2020-02-10 20:36:51,190 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:36:51,190 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15588 transitions. [2020-02-10 20:36:51,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:36:51,196 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:51,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:36:51,196 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:36:51,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:51,196 INFO L82 PathProgramCache]: Analyzing trace with hash 20965714, now seen corresponding path program 512 times [2020-02-10 20:36:51,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:51,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586100069] [2020-02-10 20:36:51,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:51,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:51,718 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:36:51,842 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:36:51,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:36:51,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586100069] [2020-02-10 20:36:51,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:51,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:36:51,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167385939] [2020-02-10 20:36:51,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:36:51,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:51,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:36:51,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:36:51,852 INFO L87 Difference]: Start difference. First operand 3127 states and 15588 transitions. Second operand 12 states. [2020-02-10 20:36:52,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:52,199 INFO L93 Difference]: Finished difference Result 6004 states and 26780 transitions. [2020-02-10 20:36:52,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:36:52,199 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:36:52,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:52,213 INFO L225 Difference]: With dead ends: 6004 [2020-02-10 20:36:52,213 INFO L226 Difference]: Without dead ends: 5983 [2020-02-10 20:36: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:36:52,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5983 states. [2020-02-10 20:36:52,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5983 to 3122. [2020-02-10 20:36:52,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-02-10 20:36:52,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15574 transitions. [2020-02-10 20:36:52,393 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15574 transitions. Word has length 31 [2020-02-10 20:36:52,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:52,393 INFO L479 AbstractCegarLoop]: Abstraction has 3122 states and 15574 transitions. [2020-02-10 20:36:52,394 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:36:52,394 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15574 transitions. [2020-02-10 20:36:52,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:36:52,399 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:52,399 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:36:52,399 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:36:52,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:52,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1465949122, now seen corresponding path program 513 times [2020-02-10 20:36:52,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:52,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617569692] [2020-02-10 20:36:52,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:52,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:52,927 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:36:53,058 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:36:53,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:36:53,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617569692] [2020-02-10 20:36:53,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:53,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:36:53,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607548341] [2020-02-10 20:36:53,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:36:53,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:53,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:36:53,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:36:53,068 INFO L87 Difference]: Start difference. First operand 3122 states and 15574 transitions. Second operand 12 states. [2020-02-10 20:36:53,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:53,334 INFO L93 Difference]: Finished difference Result 6017 states and 26808 transitions. [2020-02-10 20:36:53,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:36:53,334 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:36:53,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:53,349 INFO L225 Difference]: With dead ends: 6017 [2020-02-10 20:36:53,349 INFO L226 Difference]: Without dead ends: 5998 [2020-02-10 20:36:53,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:36:53,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5998 states. [2020-02-10 20:36:53,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5998 to 3131. [2020-02-10 20:36:53,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 20:36:53,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15591 transitions. [2020-02-10 20:36:53,535 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15591 transitions. Word has length 31 [2020-02-10 20:36:53,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:53,536 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15591 transitions. [2020-02-10 20:36:53,536 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:36:53,536 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15591 transitions. [2020-02-10 20:36:53,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:36:53,541 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:53,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:36:53,541 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:36:53,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:53,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1395839086, now seen corresponding path program 514 times [2020-02-10 20:36:53,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:53,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908463421] [2020-02-10 20:36:53,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:53,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:54,084 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:36:54,215 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:36:54,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:36:54,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908463421] [2020-02-10 20:36:54,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:54,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:36:54,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753373498] [2020-02-10 20:36:54,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:36:54,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:54,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:36:54,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:36:54,225 INFO L87 Difference]: Start difference. First operand 3131 states and 15591 transitions. Second operand 12 states. [2020-02-10 20:36:54,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:54,428 INFO L93 Difference]: Finished difference Result 6020 states and 26805 transitions. [2020-02-10 20:36:54,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:36:54,429 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:36:54,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:54,443 INFO L225 Difference]: With dead ends: 6020 [2020-02-10 20:36:54,443 INFO L226 Difference]: Without dead ends: 5989 [2020-02-10 20:36:54,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:36:54,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5989 states. [2020-02-10 20:36:54,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5989 to 3122. [2020-02-10 20:36:54,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-02-10 20:36:54,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15568 transitions. [2020-02-10 20:36:54,624 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15568 transitions. Word has length 31 [2020-02-10 20:36:54,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:54,625 INFO L479 AbstractCegarLoop]: Abstraction has 3122 states and 15568 transitions. [2020-02-10 20:36:54,625 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:36:54,625 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15568 transitions. [2020-02-10 20:36:54,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:36:54,630 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:54,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:36:54,630 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:36:54,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:54,630 INFO L82 PathProgramCache]: Analyzing trace with hash -2100590466, now seen corresponding path program 515 times [2020-02-10 20:36:54,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:54,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955269955] [2020-02-10 20:36:54,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:54,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:55,156 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:36:55,288 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:36:55,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:36:55,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955269955] [2020-02-10 20:36:55,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:55,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:36:55,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958972138] [2020-02-10 20:36:55,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:36:55,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:55,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:36:55,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:36:55,298 INFO L87 Difference]: Start difference. First operand 3122 states and 15568 transitions. Second operand 12 states. [2020-02-10 20:36:55,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:55,583 INFO L93 Difference]: Finished difference Result 6008 states and 26781 transitions. [2020-02-10 20:36:55,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:36:55,584 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:36:55,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:55,598 INFO L225 Difference]: With dead ends: 6008 [2020-02-10 20:36:55,598 INFO L226 Difference]: Without dead ends: 5992 [2020-02-10 20:36:55,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 20:36:55,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5992 states. [2020-02-10 20:36:55,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5992 to 3128. [2020-02-10 20:36:55,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 20:36:55,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15579 transitions. [2020-02-10 20:36:55,781 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15579 transitions. Word has length 31 [2020-02-10 20:36:55,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:55,781 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15579 transitions. [2020-02-10 20:36:55,781 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:36:55,781 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15579 transitions. [2020-02-10 20:36:55,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:36:55,786 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:55,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:36:55,786 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:36:55,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:55,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1607994704, now seen corresponding path program 516 times [2020-02-10 20:36:55,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:55,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524418845] [2020-02-10 20:36:55,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:55,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:56,317 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:36:56,450 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:36:56,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:36:56,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524418845] [2020-02-10 20:36:56,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:56,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:36:56,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456088379] [2020-02-10 20:36:56,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:36:56,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:56,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:36:56,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:36:56,460 INFO L87 Difference]: Start difference. First operand 3128 states and 15579 transitions. Second operand 12 states. [2020-02-10 20:36:56,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:56,669 INFO L93 Difference]: Finished difference Result 6014 states and 26787 transitions. [2020-02-10 20:36:56,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:36:56,670 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:36:56,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:56,684 INFO L225 Difference]: With dead ends: 6014 [2020-02-10 20:36:56,685 INFO L226 Difference]: Without dead ends: 5980 [2020-02-10 20:36:56,685 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:36:56,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5980 states. [2020-02-10 20:36:56,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5980 to 3116. [2020-02-10 20:36:56,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3116 states. [2020-02-10 20:36:56,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3116 states to 3116 states and 15551 transitions. [2020-02-10 20:36:56,867 INFO L78 Accepts]: Start accepts. Automaton has 3116 states and 15551 transitions. Word has length 31 [2020-02-10 20:36:56,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:56,867 INFO L479 AbstractCegarLoop]: Abstraction has 3116 states and 15551 transitions. [2020-02-10 20:36:56,867 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:36:56,867 INFO L276 IsEmpty]: Start isEmpty. Operand 3116 states and 15551 transitions. [2020-02-10 20:36:56,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:36:56,872 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:56,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:36:56,872 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:36:56,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:56,872 INFO L82 PathProgramCache]: Analyzing trace with hash -942663888, now seen corresponding path program 517 times [2020-02-10 20:36:56,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:56,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827303584] [2020-02-10 20:36:56,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:56,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:57,414 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:36:57,547 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:36:57,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 20:36:57,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827303584] [2020-02-10 20:36:57,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:57,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:36:57,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937031315] [2020-02-10 20:36:57,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:36:57,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:57,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:36:57,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:36:57,558 INFO L87 Difference]: Start difference. First operand 3116 states and 15551 transitions. Second operand 12 states. [2020-02-10 20:36:57,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:57,796 INFO L93 Difference]: Finished difference Result 6013 states and 26802 transitions. [2020-02-10 20:36:57,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:36:57,797 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:36:57,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:57,812 INFO L225 Difference]: With dead ends: 6013 [2020-02-10 20:36:57,812 INFO L226 Difference]: Without dead ends: 5994 [2020-02-10 20:36:57,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:36:57,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5994 states. [2020-02-10 20:36:58,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5994 to 3129. [2020-02-10 20:36:58,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 20:36:58,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15588 transitions. [2020-02-10 20:36:58,040 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15588 transitions. Word has length 31 [2020-02-10 20:36:58,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:58,040 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15588 transitions. [2020-02-10 20:36:58,040 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:36:58,040 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15588 transitions. [2020-02-10 20:36:58,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:36:58,045 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:58,045 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:36:58,046 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:36:58,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:58,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1239874778, now seen corresponding path program 518 times [2020-02-10 20:36:58,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:58,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263414034] [2020-02-10 20:36:58,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:58,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:58,572 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:36:58,704 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:36:58,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:36:58,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263414034] [2020-02-10 20:36:58,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:58,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:36:58,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392658447] [2020-02-10 20:36:58,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:36:58,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:58,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:36:58,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:36:58,714 INFO L87 Difference]: Start difference. First operand 3129 states and 15588 transitions. Second operand 12 states. [2020-02-10 20:36:58,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:36:58,955 INFO L93 Difference]: Finished difference Result 6011 states and 26792 transitions. [2020-02-10 20:36:58,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:36:58,955 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:36:58,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:36:58,970 INFO L225 Difference]: With dead ends: 6011 [2020-02-10 20:36:58,970 INFO L226 Difference]: Without dead ends: 5988 [2020-02-10 20:36:58,970 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:36:59,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5988 states. [2020-02-10 20:36:59,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5988 to 3123. [2020-02-10 20:36:59,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3123 states. [2020-02-10 20:36:59,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 15571 transitions. [2020-02-10 20:36:59,154 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 15571 transitions. Word has length 31 [2020-02-10 20:36:59,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:36:59,154 INFO L479 AbstractCegarLoop]: Abstraction has 3123 states and 15571 transitions. [2020-02-10 20:36:59,154 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:36:59,154 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 15571 transitions. [2020-02-10 20:36:59,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:36:59,159 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:36:59,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 20:36:59,160 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:36:59,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:36:59,160 INFO L82 PathProgramCache]: Analyzing trace with hash -2003441978, now seen corresponding path program 519 times [2020-02-10 20:36:59,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:36:59,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16509623] [2020-02-10 20:36:59,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:36:59,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:36:59,700 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:36:59,831 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:36:59,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:36:59,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16509623] [2020-02-10 20:36:59,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:36:59,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:36:59,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205728096] [2020-02-10 20:36:59,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:36:59,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:36:59,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:36:59,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:36:59,841 INFO L87 Difference]: Start difference. First operand 3123 states and 15571 transitions. Second operand 12 states. [2020-02-10 20:37:00,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:00,104 INFO L93 Difference]: Finished difference Result 6021 states and 26813 transitions. [2020-02-10 20:37:00,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:37:00,104 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:37:00,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:00,119 INFO L225 Difference]: With dead ends: 6021 [2020-02-10 20:37:00,119 INFO L226 Difference]: Without dead ends: 6002 [2020-02-10 20:37:00,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:37:00,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6002 states. [2020-02-10 20:37:00,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6002 to 3132. [2020-02-10 20:37:00,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-02-10 20:37:00,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15588 transitions. [2020-02-10 20:37:00,306 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15588 transitions. Word has length 31 [2020-02-10 20:37:00,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:00,306 INFO L479 AbstractCegarLoop]: Abstraction has 3132 states and 15588 transitions. [2020-02-10 20:37:00,306 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:37:00,306 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15588 transitions. [2020-02-10 20:37:00,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:37:00,311 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:00,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:37:00,311 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:37:00,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:00,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1933331942, now seen corresponding path program 520 times [2020-02-10 20:37:00,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:00,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750718234] [2020-02-10 20:37:00,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:00,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:00,855 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:37:00,986 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:37:00,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:37:00,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750718234] [2020-02-10 20:37:00,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:00,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:37:00,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198256280] [2020-02-10 20:37:00,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:37:00,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:00,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:37:00,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:37:00,995 INFO L87 Difference]: Start difference. First operand 3132 states and 15588 transitions. Second operand 12 states. [2020-02-10 20:37:01,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:01,241 INFO L93 Difference]: Finished difference Result 6024 states and 26810 transitions. [2020-02-10 20:37:01,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:37:01,242 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:37:01,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:01,257 INFO L225 Difference]: With dead ends: 6024 [2020-02-10 20:37:01,257 INFO L226 Difference]: Without dead ends: 5993 [2020-02-10 20:37:01,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:37:01,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5993 states. [2020-02-10 20:37:01,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5993 to 3123. [2020-02-10 20:37:01,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3123 states. [2020-02-10 20:37:01,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 15564 transitions. [2020-02-10 20:37:01,440 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 15564 transitions. Word has length 31 [2020-02-10 20:37:01,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:01,440 INFO L479 AbstractCegarLoop]: Abstraction has 3123 states and 15564 transitions. [2020-02-10 20:37:01,440 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:37:01,440 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 15564 transitions. [2020-02-10 20:37:01,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:37:01,445 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:01,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:37:01,446 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:37:01,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:01,446 INFO L82 PathProgramCache]: Analyzing trace with hash -881681402, now seen corresponding path program 521 times [2020-02-10 20:37:01,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:01,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427719241] [2020-02-10 20:37:01,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:01,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:01,976 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:37:02,109 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:37:02,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:37:02,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427719241] [2020-02-10 20:37:02,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:02,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:37:02,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624019370] [2020-02-10 20:37:02,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:37:02,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:02,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:37:02,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:37:02,119 INFO L87 Difference]: Start difference. First operand 3123 states and 15564 transitions. Second operand 12 states. [2020-02-10 20:37:02,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:02,388 INFO L93 Difference]: Finished difference Result 6015 states and 26792 transitions. [2020-02-10 20:37:02,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:37:02,388 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:37:02,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:02,404 INFO L225 Difference]: With dead ends: 6015 [2020-02-10 20:37:02,405 INFO L226 Difference]: Without dead ends: 5998 [2020-02-10 20:37:02,405 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:37:02,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5998 states. [2020-02-10 20:37:02,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5998 to 3130. [2020-02-10 20:37:02,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 20:37:02,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15577 transitions. [2020-02-10 20:37:02,593 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15577 transitions. Word has length 31 [2020-02-10 20:37:02,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:02,594 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15577 transitions. [2020-02-10 20:37:02,594 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:37:02,594 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15577 transitions. [2020-02-10 20:37:02,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:37:02,599 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:02,599 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:37:02,599 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:37:02,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:02,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1300857264, now seen corresponding path program 522 times [2020-02-10 20:37:02,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:02,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079974604] [2020-02-10 20:37:02,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:02,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:03,143 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:37:03,275 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:37:03,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:37:03,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079974604] [2020-02-10 20:37:03,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:03,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:37:03,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597122948] [2020-02-10 20:37:03,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:37:03,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:03,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:37:03,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:37:03,284 INFO L87 Difference]: Start difference. First operand 3130 states and 15577 transitions. Second operand 12 states. [2020-02-10 20:37:03,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:03,561 INFO L93 Difference]: Finished difference Result 6020 states and 26795 transitions. [2020-02-10 20:37:03,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:37:03,562 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:37:03,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:03,576 INFO L225 Difference]: With dead ends: 6020 [2020-02-10 20:37:03,577 INFO L226 Difference]: Without dead ends: 5984 [2020-02-10 20:37:03,577 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:37:03,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5984 states. [2020-02-10 20:37:03,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5984 to 3116. [2020-02-10 20:37:03,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3116 states. [2020-02-10 20:37:03,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3116 states to 3116 states and 15545 transitions. [2020-02-10 20:37:03,760 INFO L78 Accepts]: Start accepts. Automaton has 3116 states and 15545 transitions. Word has length 31 [2020-02-10 20:37:03,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:03,760 INFO L479 AbstractCegarLoop]: Abstraction has 3116 states and 15545 transitions. [2020-02-10 20:37:03,760 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:37:03,760 INFO L276 IsEmpty]: Start isEmpty. Operand 3116 states and 15545 transitions. [2020-02-10 20:37:03,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:37:03,765 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:03,765 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:37:03,765 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:37:03,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:03,765 INFO L82 PathProgramCache]: Analyzing trace with hash 435805202, now seen corresponding path program 523 times [2020-02-10 20:37:03,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:03,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774200960] [2020-02-10 20:37:03,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:03,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:04,308 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:37:04,441 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:37:04,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:37:04,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774200960] [2020-02-10 20:37:04,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:04,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:37:04,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26965036] [2020-02-10 20:37:04,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:37:04,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:04,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:37:04,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:37:04,450 INFO L87 Difference]: Start difference. First operand 3116 states and 15545 transitions. Second operand 12 states. [2020-02-10 20:37:04,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:04,711 INFO L93 Difference]: Finished difference Result 5998 states and 26759 transitions. [2020-02-10 20:37:04,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:37:04,711 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:37:04,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:04,726 INFO L225 Difference]: With dead ends: 5998 [2020-02-10 20:37:04,726 INFO L226 Difference]: Without dead ends: 5982 [2020-02-10 20:37:04,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 20:37:04,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5982 states. [2020-02-10 20:37:04,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5982 to 3127. [2020-02-10 20:37:04,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:37:04,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15576 transitions. [2020-02-10 20:37:04,908 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15576 transitions. Word has length 31 [2020-02-10 20:37:04,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:04,908 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15576 transitions. [2020-02-10 20:37:04,909 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:37:04,909 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15576 transitions. [2020-02-10 20:37:04,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:37:04,913 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:04,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:37:04,914 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:37:04,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:04,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1254137702, now seen corresponding path program 524 times [2020-02-10 20:37:04,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:04,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230207479] [2020-02-10 20:37:04,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:04,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:05,459 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:37:05,592 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:37:05,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:37:05,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230207479] [2020-02-10 20:37:05,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:05,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:37:05,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83709310] [2020-02-10 20:37:05,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:37:05,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:05,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:37:05,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:37:05,602 INFO L87 Difference]: Start difference. First operand 3127 states and 15576 transitions. Second operand 12 states. [2020-02-10 20:37:05,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:05,959 INFO L93 Difference]: Finished difference Result 5999 states and 26756 transitions. [2020-02-10 20:37:05,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:37:05,960 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:37:05,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:05,974 INFO L225 Difference]: With dead ends: 5999 [2020-02-10 20:37:05,974 INFO L226 Difference]: Without dead ends: 5977 [2020-02-10 20:37:05,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 20:37:06,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5977 states. [2020-02-10 20:37:06,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5977 to 3122. [2020-02-10 20:37:06,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-02-10 20:37:06,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15562 transitions. [2020-02-10 20:37:06,202 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15562 transitions. Word has length 31 [2020-02-10 20:37:06,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:06,203 INFO L479 AbstractCegarLoop]: Abstraction has 3122 states and 15562 transitions. [2020-02-10 20:37:06,203 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:37:06,203 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15562 transitions. [2020-02-10 20:37:06,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:37:06,208 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:06,208 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:37:06,208 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:37:06,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:06,209 INFO L82 PathProgramCache]: Analyzing trace with hash -624972888, now seen corresponding path program 525 times [2020-02-10 20:37:06,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:06,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106528399] [2020-02-10 20:37:06,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:06,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:06,743 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:37:06,874 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:37:06,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:37:06,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106528399] [2020-02-10 20:37:06,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:06,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:37:06,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889811988] [2020-02-10 20:37:06,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:37:06,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:06,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:37:06,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:37:06,884 INFO L87 Difference]: Start difference. First operand 3122 states and 15562 transitions. Second operand 12 states. [2020-02-10 20:37:07,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:07,239 INFO L93 Difference]: Finished difference Result 6004 states and 26765 transitions. [2020-02-10 20:37:07,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:37:07,240 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:37:07,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:07,254 INFO L225 Difference]: With dead ends: 6004 [2020-02-10 20:37:07,254 INFO L226 Difference]: Without dead ends: 5988 [2020-02-10 20:37:07,254 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:37:07,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5988 states. [2020-02-10 20:37:07,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5988 to 3128. [2020-02-10 20:37:07,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 20:37:07,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15573 transitions. [2020-02-10 20:37:07,437 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15573 transitions. Word has length 31 [2020-02-10 20:37:07,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:07,437 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15573 transitions. [2020-02-10 20:37:07,437 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:37:07,437 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15573 transitions. [2020-02-10 20:37:07,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:37:07,442 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:07,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:37:07,442 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:37:07,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:07,443 INFO L82 PathProgramCache]: Analyzing trace with hash -132377126, now seen corresponding path program 526 times [2020-02-10 20:37:07,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:07,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557947851] [2020-02-10 20:37:07,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:07,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:07,969 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:37:08,099 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:37:08,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:37:08,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557947851] [2020-02-10 20:37:08,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:08,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:37:08,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127780443] [2020-02-10 20:37:08,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:37:08,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:08,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:37:08,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:37:08,108 INFO L87 Difference]: Start difference. First operand 3128 states and 15573 transitions. Second operand 12 states. [2020-02-10 20:37:08,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:08,420 INFO L93 Difference]: Finished difference Result 6010 states and 26771 transitions. [2020-02-10 20:37:08,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:37:08,420 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:37:08,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:08,435 INFO L225 Difference]: With dead ends: 6010 [2020-02-10 20:37:08,435 INFO L226 Difference]: Without dead ends: 5982 [2020-02-10 20:37:08,435 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:37:08,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5982 states. [2020-02-10 20:37:08,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5982 to 3122. [2020-02-10 20:37:08,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-02-10 20:37:08,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15556 transitions. [2020-02-10 20:37:08,616 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15556 transitions. Word has length 31 [2020-02-10 20:37:08,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:08,616 INFO L479 AbstractCegarLoop]: Abstraction has 3122 states and 15556 transitions. [2020-02-10 20:37:08,616 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:37:08,616 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15556 transitions. [2020-02-10 20:37:08,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:37:08,621 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:08,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:37:08,621 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:37:08,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:08,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1131429032, now seen corresponding path program 527 times [2020-02-10 20:37:08,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:08,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657627639] [2020-02-10 20:37:08,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:08,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:09,153 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:37:09,284 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:37: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:37:09,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657627639] [2020-02-10 20:37:09,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:09,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:37:09,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987878260] [2020-02-10 20:37:09,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:37:09,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:09,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:37:09,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:37:09,294 INFO L87 Difference]: Start difference. First operand 3122 states and 15556 transitions. Second operand 12 states. [2020-02-10 20:37:09,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:09,650 INFO L93 Difference]: Finished difference Result 6007 states and 26766 transitions. [2020-02-10 20:37:09,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:37:09,650 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:37:09,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:09,665 INFO L225 Difference]: With dead ends: 6007 [2020-02-10 20:37:09,665 INFO L226 Difference]: Without dead ends: 5990 [2020-02-10 20:37:09,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 20:37:09,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5990 states. [2020-02-10 20:37:09,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5990 to 3129. [2020-02-10 20:37:09,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 20:37:09,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15569 transitions. [2020-02-10 20:37:09,848 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15569 transitions. Word has length 31 [2020-02-10 20:37:09,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:09,848 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15569 transitions. [2020-02-10 20:37:09,848 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:37:09,849 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15569 transitions. [2020-02-10 20:37:09,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:37:09,854 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:09,854 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:37:09,854 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:37:09,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:09,854 INFO L82 PathProgramCache]: Analyzing trace with hash -980999598, now seen corresponding path program 528 times [2020-02-10 20:37:09,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:09,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620852235] [2020-02-10 20:37:09,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:09,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:10,390 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:37:10,521 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:37:10,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:37:10,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620852235] [2020-02-10 20:37:10,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:10,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:37:10,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999415321] [2020-02-10 20:37:10,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:37:10,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:10,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:37:10,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:37:10,531 INFO L87 Difference]: Start difference. First operand 3129 states and 15569 transitions. Second operand 12 states. [2020-02-10 20:37:10,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:10,736 INFO L93 Difference]: Finished difference Result 6012 states and 26769 transitions. [2020-02-10 20:37:10,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:37:10,736 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:37:10,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:10,750 INFO L225 Difference]: With dead ends: 6012 [2020-02-10 20:37:10,751 INFO L226 Difference]: Without dead ends: 5971 [2020-02-10 20:37:10,751 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:37:10,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5971 states. [2020-02-10 20:37:10,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5971 to 3110. [2020-02-10 20:37:10,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3110 states. [2020-02-10 20:37:10,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3110 states to 3110 states and 15528 transitions. [2020-02-10 20:37:10,933 INFO L78 Accepts]: Start accepts. Automaton has 3110 states and 15528 transitions. Word has length 31 [2020-02-10 20:37:10,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:10,933 INFO L479 AbstractCegarLoop]: Abstraction has 3110 states and 15528 transitions. [2020-02-10 20:37:10,933 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:37:10,933 INFO L276 IsEmpty]: Start isEmpty. Operand 3110 states and 15528 transitions. [2020-02-10 20:37:10,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:37:10,938 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:10,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:37:10,939 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:37:10,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:10,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1042117242, now seen corresponding path program 529 times [2020-02-10 20:37:10,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:10,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121205591] [2020-02-10 20:37:10,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:10,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:11,478 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:37:11,611 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:37:11,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:37:11,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121205591] [2020-02-10 20:37:11,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:11,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:37:11,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749249304] [2020-02-10 20:37:11,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:37:11,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:11,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:37:11,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:37:11,620 INFO L87 Difference]: Start difference. First operand 3110 states and 15528 transitions. Second operand 12 states. [2020-02-10 20:37:11,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:11,841 INFO L93 Difference]: Finished difference Result 6003 states and 26785 transitions. [2020-02-10 20:37:11,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:37:11,842 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:37:11,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:11,856 INFO L225 Difference]: With dead ends: 6003 [2020-02-10 20:37:11,857 INFO L226 Difference]: Without dead ends: 5984 [2020-02-10 20:37:11,857 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:37:11,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5984 states. [2020-02-10 20:37:12,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5984 to 3126. [2020-02-10 20:37:12,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 20:37:12,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15584 transitions. [2020-02-10 20:37:12,039 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15584 transitions. Word has length 31 [2020-02-10 20:37:12,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:12,039 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15584 transitions. [2020-02-10 20:37:12,039 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:37:12,039 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15584 transitions. [2020-02-10 20:37:12,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:37:12,044 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:12,044 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:37:12,044 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:37:12,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:12,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1464602968, now seen corresponding path program 530 times [2020-02-10 20:37:12,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:12,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364515030] [2020-02-10 20:37:12,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:12,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:12,585 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:37:12,715 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:37:12,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:37:12,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364515030] [2020-02-10 20:37:12,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:12,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:37:12,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60749117] [2020-02-10 20:37:12,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:37:12,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:12,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:37:12,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:37:12,724 INFO L87 Difference]: Start difference. First operand 3126 states and 15584 transitions. Second operand 12 states. [2020-02-10 20:37:12,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:12,948 INFO L93 Difference]: Finished difference Result 6000 states and 26774 transitions. [2020-02-10 20:37:12,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:37:12,948 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:37:12,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:12,963 INFO L225 Difference]: With dead ends: 6000 [2020-02-10 20:37:12,963 INFO L226 Difference]: Without dead ends: 5979 [2020-02-10 20:37:12,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:37:13,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5979 states. [2020-02-10 20:37:13,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5979 to 3121. [2020-02-10 20:37:13,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 20:37:13,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15570 transitions. [2020-02-10 20:37:13,151 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15570 transitions. Word has length 31 [2020-02-10 20:37:13,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:13,151 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15570 transitions. [2020-02-10 20:37:13,151 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:37:13,151 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15570 transitions. [2020-02-10 20:37:13,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:37:13,156 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:13,156 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:37:13,156 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:37:13,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:13,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1979916346, now seen corresponding path program 531 times [2020-02-10 20:37:13,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:13,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146429294] [2020-02-10 20:37:13,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:13,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:13,694 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:37:13,823 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:37:13,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:37:13,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146429294] [2020-02-10 20:37:13,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:13,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:37:13,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913661567] [2020-02-10 20:37:13,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:37:13,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:13,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:37:13,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:37:13,833 INFO L87 Difference]: Start difference. First operand 3121 states and 15570 transitions. Second operand 12 states. [2020-02-10 20:37:14,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:14,057 INFO L93 Difference]: Finished difference Result 6007 states and 26790 transitions. [2020-02-10 20:37:14,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:37:14,058 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:37:14,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:14,073 INFO L225 Difference]: With dead ends: 6007 [2020-02-10 20:37:14,073 INFO L226 Difference]: Without dead ends: 5988 [2020-02-10 20:37:14,073 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:37:14,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5988 states. [2020-02-10 20:37:14,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5988 to 3128. [2020-02-10 20:37:14,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 20:37:14,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15583 transitions. [2020-02-10 20:37:14,303 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15583 transitions. Word has length 31 [2020-02-10 20:37:14,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:14,303 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15583 transitions. [2020-02-10 20:37:14,303 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:37:14,304 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15583 transitions. [2020-02-10 20:37:14,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:37:14,309 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:14,309 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:37:14,309 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:37:14,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:14,309 INFO L82 PathProgramCache]: Analyzing trace with hash -977483736, now seen corresponding path program 532 times [2020-02-10 20:37:14,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:14,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949426524] [2020-02-10 20:37:14,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:14,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:14,849 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:37:14,982 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:37:14,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:37:14,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949426524] [2020-02-10 20:37:14,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:14,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:37:14,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953500720] [2020-02-10 20:37:14,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:37:14,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:14,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:37:14,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:37:14,993 INFO L87 Difference]: Start difference. First operand 3128 states and 15583 transitions. Second operand 12 states. [2020-02-10 20:37:15,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:15,218 INFO L93 Difference]: Finished difference Result 6006 states and 26781 transitions. [2020-02-10 20:37:15,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:37:15,218 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:37:15,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:15,233 INFO L225 Difference]: With dead ends: 6006 [2020-02-10 20:37:15,233 INFO L226 Difference]: Without dead ends: 5981 [2020-02-10 20:37:15,233 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:37:15,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5981 states. [2020-02-10 20:37:15,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5981 to 3121. [2020-02-10 20:37:15,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 20:37:15,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15565 transitions. [2020-02-10 20:37:15,415 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15565 transitions. Word has length 31 [2020-02-10 20:37:15,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:15,415 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15565 transitions. [2020-02-10 20:37:15,415 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:37:15,415 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15565 transitions. [2020-02-10 20:37:15,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:37:15,420 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:15,420 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:37:15,420 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:37:15,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:15,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1345275002, now seen corresponding path program 533 times [2020-02-10 20:37:15,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:15,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298707787] [2020-02-10 20:37:15,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:15,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:15,957 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:37:16,086 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:37:16,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:37:16,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298707787] [2020-02-10 20:37:16,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:16,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:37:16,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197802455] [2020-02-10 20:37:16,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:37:16,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:16,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:37:16,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:37:16,096 INFO L87 Difference]: Start difference. First operand 3121 states and 15565 transitions. Second operand 12 states. [2020-02-10 20:37:16,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:16,364 INFO L93 Difference]: Finished difference Result 5999 states and 26767 transitions. [2020-02-10 20:37:16,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:37:16,365 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:37:16,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:16,379 INFO L225 Difference]: With dead ends: 5999 [2020-02-10 20:37:16,380 INFO L226 Difference]: Without dead ends: 5983 [2020-02-10 20:37:16,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:37:16,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5983 states. [2020-02-10 20:37:16,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5983 to 3126. [2020-02-10 20:37:16,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 20:37:16,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15574 transitions. [2020-02-10 20:37:16,565 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15574 transitions. Word has length 31 [2020-02-10 20:37:16,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:16,565 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15574 transitions. [2020-02-10 20:37:16,566 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:37:16,566 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15574 transitions. [2020-02-10 20:37:16,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:37:16,571 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:16,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 20:37:16,571 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:37:16,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:16,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1189639354, now seen corresponding path program 534 times [2020-02-10 20:37:16,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:16,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408264924] [2020-02-10 20:37:16,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:16,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:17,091 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:37:17,225 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:37:17,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 20:37:17,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408264924] [2020-02-10 20:37:17,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:17,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:37:17,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903322695] [2020-02-10 20:37:17,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:37:17,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:17,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:37:17,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:37:17,235 INFO L87 Difference]: Start difference. First operand 3126 states and 15574 transitions. Second operand 12 states. [2020-02-10 20:37:17,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:17,462 INFO L93 Difference]: Finished difference Result 6001 states and 26766 transitions. [2020-02-10 20:37:17,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:37:17,462 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:37:17,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:17,477 INFO L225 Difference]: With dead ends: 6001 [2020-02-10 20:37:17,477 INFO L226 Difference]: Without dead ends: 5973 [2020-02-10 20:37:17,477 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:37:17,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5973 states. [2020-02-10 20:37:17,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5973 to 3116. [2020-02-10 20:37:17,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3116 states. [2020-02-10 20:37:17,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3116 states to 3116 states and 15551 transitions. [2020-02-10 20:37:17,670 INFO L78 Accepts]: Start accepts. Automaton has 3116 states and 15551 transitions. Word has length 31 [2020-02-10 20:37:17,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:17,670 INFO L479 AbstractCegarLoop]: Abstraction has 3116 states and 15551 transitions. [2020-02-10 20:37:17,670 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:37:17,670 INFO L276 IsEmpty]: Start isEmpty. Operand 3116 states and 15551 transitions. [2020-02-10 20:37:17,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:37:17,675 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:17,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:37:17,675 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:37:17,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:17,676 INFO L82 PathProgramCache]: Analyzing trace with hash 702246764, now seen corresponding path program 535 times [2020-02-10 20:37:17,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:17,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240409932] [2020-02-10 20:37:17,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:17,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:18,213 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:37:18,347 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:37:18,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:37:18,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240409932] [2020-02-10 20:37:18,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:18,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:37:18,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717681383] [2020-02-10 20:37:18,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:37:18,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:18,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:37:18,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:37:18,357 INFO L87 Difference]: Start difference. First operand 3116 states and 15551 transitions. Second operand 12 states. [2020-02-10 20:37:18,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:18,626 INFO L93 Difference]: Finished difference Result 6011 states and 26797 transitions. [2020-02-10 20:37:18,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:37:18,626 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:37:18,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:18,641 INFO L225 Difference]: With dead ends: 6011 [2020-02-10 20:37:18,641 INFO L226 Difference]: Without dead ends: 5992 [2020-02-10 20:37:18,641 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:37:18,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5992 states. [2020-02-10 20:37:18,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5992 to 3127. [2020-02-10 20:37:18,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:37:18,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15582 transitions. [2020-02-10 20:37:18,828 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15582 transitions. Word has length 31 [2020-02-10 20:37:18,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:18,828 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15582 transitions. [2020-02-10 20:37:18,828 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:37:18,828 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15582 transitions. [2020-02-10 20:37:18,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:37:18,833 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:18,833 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:37:18,834 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:37:18,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:18,834 INFO L82 PathProgramCache]: Analyzing trace with hash 279761038, now seen corresponding path program 536 times [2020-02-10 20:37:18,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:18,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10953314] [2020-02-10 20:37:18,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:18,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:19,359 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:37:19,493 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:37:19,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:37:19,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10953314] [2020-02-10 20:37:19,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:19,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:37:19,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447001083] [2020-02-10 20:37:19,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:37:19,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:19,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:37:19,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:37:19,504 INFO L87 Difference]: Start difference. First operand 3127 states and 15582 transitions. Second operand 12 states. [2020-02-10 20:37:19,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:19,734 INFO L93 Difference]: Finished difference Result 6008 states and 26786 transitions. [2020-02-10 20:37:19,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:37:19,735 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:37:19,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:19,750 INFO L225 Difference]: With dead ends: 6008 [2020-02-10 20:37:19,750 INFO L226 Difference]: Without dead ends: 5987 [2020-02-10 20:37:19,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:37:19,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5987 states. [2020-02-10 20:37:19,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5987 to 3122. [2020-02-10 20:37:19,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-02-10 20:37:19,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15568 transitions. [2020-02-10 20:37:19,937 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15568 transitions. Word has length 31 [2020-02-10 20:37:19,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:19,937 INFO L479 AbstractCegarLoop]: Abstraction has 3122 states and 15568 transitions. [2020-02-10 20:37:19,937 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:37:19,937 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15568 transitions. [2020-02-10 20:37:19,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:37:19,942 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:19,943 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:37:19,943 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:37:19,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:19,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1207153798, now seen corresponding path program 537 times [2020-02-10 20:37:19,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:19,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014059479] [2020-02-10 20:37:19,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:19,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:20,483 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:37:20,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:37:20,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:37:20,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014059479] [2020-02-10 20:37:20,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:20,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:37:20,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136252296] [2020-02-10 20:37:20,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:37:20,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:20,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:37:20,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:37:20,622 INFO L87 Difference]: Start difference. First operand 3122 states and 15568 transitions. Second operand 12 states. [2020-02-10 20:37:20,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:20,923 INFO L93 Difference]: Finished difference Result 6021 states and 26814 transitions. [2020-02-10 20:37:20,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:37:20,923 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:37:20,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:20,938 INFO L225 Difference]: With dead ends: 6021 [2020-02-10 20:37:20,939 INFO L226 Difference]: Without dead ends: 6002 [2020-02-10 20:37:20,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:37:21,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6002 states. [2020-02-10 20:37:21,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6002 to 3131. [2020-02-10 20:37:21,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 20:37:21,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15585 transitions. [2020-02-10 20:37:21,126 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15585 transitions. Word has length 31 [2020-02-10 20:37:21,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:21,126 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15585 transitions. [2020-02-10 20:37:21,126 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:37:21,126 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15585 transitions. [2020-02-10 20:37:21,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:37:21,131 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:21,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:37:21,132 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:37:21,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:21,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1137043762, now seen corresponding path program 538 times [2020-02-10 20:37:21,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:21,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11125302] [2020-02-10 20:37:21,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:21,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:21,686 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-02-10 20:37:21,819 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:37:21,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:37:21,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11125302] [2020-02-10 20:37:21,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:21,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:37:21,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494079536] [2020-02-10 20:37:21,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:37:21,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:21,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:37:21,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:37:21,828 INFO L87 Difference]: Start difference. First operand 3131 states and 15585 transitions. Second operand 12 states. [2020-02-10 20:37:22,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:22,020 INFO L93 Difference]: Finished difference Result 6024 states and 26811 transitions. [2020-02-10 20:37:22,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:37:22,021 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:37:22,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:22,035 INFO L225 Difference]: With dead ends: 6024 [2020-02-10 20:37:22,035 INFO L226 Difference]: Without dead ends: 5993 [2020-02-10 20:37:22,036 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:37:22,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5993 states. [2020-02-10 20:37:22,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5993 to 3122. [2020-02-10 20:37:22,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-02-10 20:37:22,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15562 transitions. [2020-02-10 20:37:22,282 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15562 transitions. Word has length 31 [2020-02-10 20:37:22,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:22,283 INFO L479 AbstractCegarLoop]: Abstraction has 3122 states and 15562 transitions. [2020-02-10 20:37:22,283 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:37:22,283 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15562 transitions. [2020-02-10 20:37:22,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:37:22,288 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:22,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:37:22,288 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:37:22,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:22,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1841795142, now seen corresponding path program 539 times [2020-02-10 20:37:22,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:22,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619110604] [2020-02-10 20:37:22,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:22,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:22,816 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2020-02-10 20:37:22,949 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:37:22,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:37:22,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619110604] [2020-02-10 20:37:22,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:22,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:37:22,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372657155] [2020-02-10 20:37:22,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:37:22,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:22,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:37:22,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:37:22,959 INFO L87 Difference]: Start difference. First operand 3122 states and 15562 transitions. Second operand 12 states. [2020-02-10 20:37:23,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:23,215 INFO L93 Difference]: Finished difference Result 6012 states and 26787 transitions. [2020-02-10 20:37:23,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:37:23,216 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:37:23,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:23,229 INFO L225 Difference]: With dead ends: 6012 [2020-02-10 20:37:23,230 INFO L226 Difference]: Without dead ends: 5996 [2020-02-10 20:37:23,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:37:23,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5996 states. [2020-02-10 20:37:23,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5996 to 3128. [2020-02-10 20:37:23,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 20:37:23,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15573 transitions. [2020-02-10 20:37:23,413 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15573 transitions. Word has length 31 [2020-02-10 20:37:23,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:23,413 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15573 transitions. [2020-02-10 20:37:23,413 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:37:23,413 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15573 transitions. [2020-02-10 20:37:23,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:37:23,418 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:23,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 20:37:23,418 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:37:23,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:23,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1349199380, now seen corresponding path program 540 times [2020-02-10 20:37:23,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:23,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750981743] [2020-02-10 20:37:23,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:23,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:23,957 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:37:24,092 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:37:24,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:37:24,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750981743] [2020-02-10 20:37:24,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:24,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:37:24,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466909862] [2020-02-10 20:37:24,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:37:24,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:24,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:37:24,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:37:24,102 INFO L87 Difference]: Start difference. First operand 3128 states and 15573 transitions. Second operand 12 states. [2020-02-10 20:37:24,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:24,292 INFO L93 Difference]: Finished difference Result 6018 states and 26793 transitions. [2020-02-10 20:37:24,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:37:24,292 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:37:24,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:24,306 INFO L225 Difference]: With dead ends: 6018 [2020-02-10 20:37:24,306 INFO L226 Difference]: Without dead ends: 5984 [2020-02-10 20:37:24,306 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:37:24,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5984 states. [2020-02-10 20:37:24,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5984 to 3116. [2020-02-10 20:37:24,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3116 states. [2020-02-10 20:37:24,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3116 states to 3116 states and 15545 transitions. [2020-02-10 20:37:24,493 INFO L78 Accepts]: Start accepts. Automaton has 3116 states and 15545 transitions. Word has length 31 [2020-02-10 20:37:24,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:24,493 INFO L479 AbstractCegarLoop]: Abstraction has 3116 states and 15545 transitions. [2020-02-10 20:37:24,493 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:37:24,493 INFO L276 IsEmpty]: Start isEmpty. Operand 3116 states and 15545 transitions. [2020-02-10 20:37:24,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:37:24,498 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:24,498 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:37:24,498 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:37:24,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:24,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1376926228, now seen corresponding path program 541 times [2020-02-10 20:37:24,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:24,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085970332] [2020-02-10 20:37:24,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:24,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:25,044 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:37:25,178 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:37:25,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:37:25,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085970332] [2020-02-10 20:37:25,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:25,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:37:25,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94752765] [2020-02-10 20:37:25,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:37:25,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:25,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:37:25,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:37:25,188 INFO L87 Difference]: Start difference. First operand 3116 states and 15545 transitions. Second operand 12 states. [2020-02-10 20:37:25,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:25,423 INFO L93 Difference]: Finished difference Result 6023 states and 26825 transitions. [2020-02-10 20:37:25,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:37:25,424 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:37:25,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:25,439 INFO L225 Difference]: With dead ends: 6023 [2020-02-10 20:37:25,439 INFO L226 Difference]: Without dead ends: 6004 [2020-02-10 20:37:25,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:37:25,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6004 states. [2020-02-10 20:37:25,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6004 to 3131. [2020-02-10 20:37:25,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 20:37:25,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15588 transitions. [2020-02-10 20:37:25,622 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15588 transitions. Word has length 31 [2020-02-10 20:37:25,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:25,623 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15588 transitions. [2020-02-10 20:37:25,623 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:37:25,623 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15588 transitions. [2020-02-10 20:37:25,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:37:25,628 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:25,628 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:37:25,628 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:37:25,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:25,628 INFO L82 PathProgramCache]: Analyzing trace with hash -39359014, now seen corresponding path program 542 times [2020-02-10 20:37:25,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:25,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893708404] [2020-02-10 20:37:25,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:25,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:26,186 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:37:26,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:37:26,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:37:26,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893708404] [2020-02-10 20:37:26,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:26,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:37:26,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167044093] [2020-02-10 20:37:26,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:37:26,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:26,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:37:26,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:37:26,328 INFO L87 Difference]: Start difference. First operand 3131 states and 15588 transitions. Second operand 12 states. [2020-02-10 20:37:26,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:26,583 INFO L93 Difference]: Finished difference Result 6022 states and 26816 transitions. [2020-02-10 20:37:26,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:37:26,583 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:37:26,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:26,597 INFO L225 Difference]: With dead ends: 6022 [2020-02-10 20:37:26,597 INFO L226 Difference]: Without dead ends: 5997 [2020-02-10 20:37:26,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 20:37:26,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5997 states. [2020-02-10 20:37:26,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5997 to 3124. [2020-02-10 20:37:26,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:37:26,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15568 transitions. [2020-02-10 20:37:26,782 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15568 transitions. Word has length 31 [2020-02-10 20:37:26,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:26,782 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15568 transitions. [2020-02-10 20:37:26,782 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:37:26,782 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15568 transitions. [2020-02-10 20:37:26,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:37:26,787 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:26,787 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:37:26,787 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:37:26,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:26,787 INFO L82 PathProgramCache]: Analyzing trace with hash -2013393082, now seen corresponding path program 543 times [2020-02-10 20:37:26,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:26,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751400036] [2020-02-10 20:37:26,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:26,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:27,341 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:37:27,477 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2020-02-10 20:37:27,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:37:27,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751400036] [2020-02-10 20:37:27,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:27,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:37:27,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042246206] [2020-02-10 20:37:27,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:37:27,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:27,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:37:27,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:37:27,487 INFO L87 Difference]: Start difference. First operand 3124 states and 15568 transitions. Second operand 12 states. [2020-02-10 20:37:27,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:27,710 INFO L93 Difference]: Finished difference Result 6029 states and 26830 transitions. [2020-02-10 20:37:27,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:37:27,710 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:37:27,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:27,724 INFO L225 Difference]: With dead ends: 6029 [2020-02-10 20:37:27,724 INFO L226 Difference]: Without dead ends: 6010 [2020-02-10 20:37:27,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:37:27,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6010 states. [2020-02-10 20:37:27,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6010 to 3133. [2020-02-10 20:37:27,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-02-10 20:37:27,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15585 transitions. [2020-02-10 20:37:27,912 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15585 transitions. Word has length 31 [2020-02-10 20:37:27,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:27,912 INFO L479 AbstractCegarLoop]: Abstraction has 3133 states and 15585 transitions. [2020-02-10 20:37:27,912 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:37:27,912 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15585 transitions. [2020-02-10 20:37:27,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:37:27,917 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:27,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:37:27,917 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:37:27,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:27,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1943283046, now seen corresponding path program 544 times [2020-02-10 20:37:27,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:27,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103192202] [2020-02-10 20:37:27,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:27,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:28,477 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 35 [2020-02-10 20:37:28,609 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:37:28,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:37:28,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103192202] [2020-02-10 20:37:28,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:28,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:37:28,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403580378] [2020-02-10 20:37:28,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:37:28,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:28,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:37:28,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:37:28,619 INFO L87 Difference]: Start difference. First operand 3133 states and 15585 transitions. Second operand 12 states. [2020-02-10 20:37:28,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:28,925 INFO L93 Difference]: Finished difference Result 6032 states and 26827 transitions. [2020-02-10 20:37:28,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:37:28,925 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:37:28,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:28,940 INFO L225 Difference]: With dead ends: 6032 [2020-02-10 20:37:28,940 INFO L226 Difference]: Without dead ends: 6001 [2020-02-10 20:37:28,940 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:37:29,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6001 states. [2020-02-10 20:37:29,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6001 to 3124. [2020-02-10 20:37:29,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:37:29,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15560 transitions. [2020-02-10 20:37:29,129 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15560 transitions. Word has length 31 [2020-02-10 20:37:29,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:29,129 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15560 transitions. [2020-02-10 20:37:29,129 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:37:29,129 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15560 transitions. [2020-02-10 20:37:29,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:37:29,134 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:29,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:37:29,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:37:29,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:29,135 INFO L82 PathProgramCache]: Analyzing trace with hash 2134052102, now seen corresponding path program 545 times [2020-02-10 20:37:29,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:29,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962759982] [2020-02-10 20:37:29,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:29,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:29,702 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:37:29,834 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:37:29,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:37:29,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962759982] [2020-02-10 20:37:29,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:29,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:37:29,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980294952] [2020-02-10 20:37:29,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:37:29,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:29,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:37:29,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:37:29,845 INFO L87 Difference]: Start difference. First operand 3124 states and 15560 transitions. Second operand 12 states. [2020-02-10 20:37:30,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:30,090 INFO L93 Difference]: Finished difference Result 6026 states and 26815 transitions. [2020-02-10 20:37:30,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:37:30,090 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:37:30,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:30,105 INFO L225 Difference]: With dead ends: 6026 [2020-02-10 20:37:30,105 INFO L226 Difference]: Without dead ends: 6008 [2020-02-10 20:37:30,105 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:37:30,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6008 states. [2020-02-10 20:37:30,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6008 to 3132. [2020-02-10 20:37:30,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-02-10 20:37:30,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15575 transitions. [2020-02-10 20:37:30,292 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15575 transitions. Word has length 31 [2020-02-10 20:37:30,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:30,292 INFO L479 AbstractCegarLoop]: Abstraction has 3132 states and 15575 transitions. [2020-02-10 20:37:30,292 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:37:30,292 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15575 transitions. [2020-02-10 20:37:30,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:37:30,298 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:30,298 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:37:30,298 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:37:30,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:30,298 INFO L82 PathProgramCache]: Analyzing trace with hash 866594924, now seen corresponding path program 546 times [2020-02-10 20:37:30,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:30,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954484952] [2020-02-10 20:37:30,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:30,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:30,883 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 34 [2020-02-10 20:37:31,016 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:37:31,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:37:31,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954484952] [2020-02-10 20:37:31,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:31,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:37:31,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334288039] [2020-02-10 20:37:31,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:37:31,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:31,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:37:31,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:37:31,026 INFO L87 Difference]: Start difference. First operand 3132 states and 15575 transitions. Second operand 12 states. [2020-02-10 20:37:31,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:31,228 INFO L93 Difference]: Finished difference Result 6030 states and 26815 transitions. [2020-02-10 20:37:31,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:37:31,229 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:37:31,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:31,244 INFO L225 Difference]: With dead ends: 6030 [2020-02-10 20:37:31,244 INFO L226 Difference]: Without dead ends: 5992 [2020-02-10 20:37:31,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:37:31,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5992 states. [2020-02-10 20:37:31,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5992 to 3116. [2020-02-10 20:37:31,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3116 states. [2020-02-10 20:37:31,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3116 states to 3116 states and 15539 transitions. [2020-02-10 20:37:31,431 INFO L78 Accepts]: Start accepts. Automaton has 3116 states and 15539 transitions. Word has length 31 [2020-02-10 20:37:31,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:31,432 INFO L479 AbstractCegarLoop]: Abstraction has 3116 states and 15539 transitions. [2020-02-10 20:37:31,432 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:37:31,432 INFO L276 IsEmpty]: Start isEmpty. Operand 3116 states and 15539 transitions. [2020-02-10 20:37:31,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:37:31,437 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:31,437 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:37:31,437 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:37:31,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:31,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1542862, now seen corresponding path program 547 times [2020-02-10 20:37:31,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:31,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023085081] [2020-02-10 20:37:31,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:31,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:31,963 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:37:32,097 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:37:32,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:37:32,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023085081] [2020-02-10 20:37:32,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:32,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:37:32,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676853988] [2020-02-10 20:37:32,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:37:32,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:32,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:37:32,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:37:32,106 INFO L87 Difference]: Start difference. First operand 3116 states and 15539 transitions. Second operand 12 states. [2020-02-10 20:37:32,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:32,345 INFO L93 Difference]: Finished difference Result 6005 states and 26772 transitions. [2020-02-10 20:37:32,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:37:32,345 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:37:32,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:32,360 INFO L225 Difference]: With dead ends: 6005 [2020-02-10 20:37:32,360 INFO L226 Difference]: Without dead ends: 5989 [2020-02-10 20:37:32,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 20:37:32,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5989 states. [2020-02-10 20:37:32,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5989 to 3127. [2020-02-10 20:37:32,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:37:32,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15570 transitions. [2020-02-10 20:37:32,548 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15570 transitions. Word has length 31 [2020-02-10 20:37:32,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:32,548 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15570 transitions. [2020-02-10 20:37:32,548 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:37:32,548 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15570 transitions. [2020-02-10 20:37:32,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:37:32,553 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:32,554 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:37:32,554 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:37:32,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:32,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1761595802, now seen corresponding path program 548 times [2020-02-10 20:37:32,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:32,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801785825] [2020-02-10 20:37:32,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:32,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:33,074 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:37:33,206 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:37:33,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:37:33,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801785825] [2020-02-10 20:37:33,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:33,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:37:33,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958446525] [2020-02-10 20:37:33,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:37:33,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:33,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:37:33,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:37:33,215 INFO L87 Difference]: Start difference. First operand 3127 states and 15570 transitions. Second operand 12 states. [2020-02-10 20:37:33,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:33,450 INFO L93 Difference]: Finished difference Result 6007 states and 26771 transitions. [2020-02-10 20:37:33,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:37:33,450 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:37:33,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:33,465 INFO L225 Difference]: With dead ends: 6007 [2020-02-10 20:37:33,465 INFO L226 Difference]: Without dead ends: 5984 [2020-02-10 20:37:33,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:37:33,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5984 states. [2020-02-10 20:37:33,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5984 to 3122. [2020-02-10 20:37:33,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-02-10 20:37:33,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15556 transitions. [2020-02-10 20:37:33,648 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15556 transitions. Word has length 31 [2020-02-10 20:37:33,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:33,648 INFO L479 AbstractCegarLoop]: Abstraction has 3122 states and 15556 transitions. [2020-02-10 20:37:33,648 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:37:33,648 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15556 transitions. [2020-02-10 20:37:33,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:37:33,653 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:33,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:37:33,653 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:37:33,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:33,653 INFO L82 PathProgramCache]: Analyzing trace with hash -634923992, now seen corresponding path program 549 times [2020-02-10 20:37:33,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:33,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526746353] [2020-02-10 20:37:33,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:33,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:34,174 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:37:34,306 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:37:34,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:37:34,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526746353] [2020-02-10 20:37:34,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:34,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:37:34,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341569837] [2020-02-10 20:37:34,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:37:34,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:34,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:37:34,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:37:34,316 INFO L87 Difference]: Start difference. First operand 3122 states and 15556 transitions. Second operand 12 states. [2020-02-10 20:37:34,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:34,559 INFO L93 Difference]: Finished difference Result 6010 states and 26776 transitions. [2020-02-10 20:37:34,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:37:34,559 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:37:34,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:34,573 INFO L225 Difference]: With dead ends: 6010 [2020-02-10 20:37:34,573 INFO L226 Difference]: Without dead ends: 5994 [2020-02-10 20:37:34,574 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:37:34,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5994 states. [2020-02-10 20:37:34,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5994 to 3128. [2020-02-10 20:37:34,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 20:37:34,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15567 transitions. [2020-02-10 20:37:34,761 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15567 transitions. Word has length 31 [2020-02-10 20:37:34,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:34,761 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15567 transitions. [2020-02-10 20:37:34,761 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:37:34,761 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15567 transitions. [2020-02-10 20:37:34,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:37:34,766 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:34,766 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:37:34,766 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:37:34,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:34,766 INFO L82 PathProgramCache]: Analyzing trace with hash -142328230, now seen corresponding path program 550 times [2020-02-10 20:37:34,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:34,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172855700] [2020-02-10 20:37:34,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:34,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:35,303 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:37:35,431 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:37:35,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:37:35,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172855700] [2020-02-10 20:37:35,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:35,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:37:35,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031726773] [2020-02-10 20:37:35,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:37:35,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:35,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:37:35,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:37:35,440 INFO L87 Difference]: Start difference. First operand 3128 states and 15567 transitions. Second operand 12 states. [2020-02-10 20:37:35,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:35,630 INFO L93 Difference]: Finished difference Result 6016 states and 26782 transitions. [2020-02-10 20:37:35,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:37:35,631 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:37:35,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:35,644 INFO L225 Difference]: With dead ends: 6016 [2020-02-10 20:37:35,644 INFO L226 Difference]: Without dead ends: 5988 [2020-02-10 20:37:35,644 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:37:35,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5988 states. [2020-02-10 20:37:35,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5988 to 3122. [2020-02-10 20:37:35,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-02-10 20:37:35,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15550 transitions. [2020-02-10 20:37:35,829 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15550 transitions. Word has length 31 [2020-02-10 20:37:35,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:35,829 INFO L479 AbstractCegarLoop]: Abstraction has 3122 states and 15550 transitions. [2020-02-10 20:37:35,829 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:37:35,829 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15550 transitions. [2020-02-10 20:37:35,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:37:35,834 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:35,834 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:37:35,834 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:37:35,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:35,834 INFO L82 PathProgramCache]: Analyzing trace with hash -147804760, now seen corresponding path program 551 times [2020-02-10 20:37:35,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:35,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067168399] [2020-02-10 20:37:35,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:35,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:36,362 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:37:36,494 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:37:36,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:37:36,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067168399] [2020-02-10 20:37:36,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:36,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:37:36,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767242234] [2020-02-10 20:37:36,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:37:36,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:36,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:37:36,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:37:36,503 INFO L87 Difference]: Start difference. First operand 3122 states and 15550 transitions. Second operand 12 states. [2020-02-10 20:37:36,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:36,783 INFO L93 Difference]: Finished difference Result 6016 states and 26784 transitions. [2020-02-10 20:37:36,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:37:36,783 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:37:36,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:36,797 INFO L225 Difference]: With dead ends: 6016 [2020-02-10 20:37:36,797 INFO L226 Difference]: Without dead ends: 5998 [2020-02-10 20:37:36,798 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:37:36,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5998 states. [2020-02-10 20:37:36,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5998 to 3130. [2020-02-10 20:37:36,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 20:37:36,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15565 transitions. [2020-02-10 20:37:36,980 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15565 transitions. Word has length 31 [2020-02-10 20:37:36,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:36,980 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15565 transitions. [2020-02-10 20:37:36,980 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:37:36,980 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15565 transitions. [2020-02-10 20:37:36,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:37:36,985 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:36,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 20:37:36,985 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:37:36,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:36,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1415261938, now seen corresponding path program 552 times [2020-02-10 20:37:36,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:36,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397427712] [2020-02-10 20:37:36,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:36,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:37,539 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:37:37,672 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:37:37,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:37:37,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397427712] [2020-02-10 20:37:37,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:37,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:37:37,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566582499] [2020-02-10 20:37:37,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:37:37,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:37,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:37:37,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:37:37,683 INFO L87 Difference]: Start difference. First operand 3130 states and 15565 transitions. Second operand 12 states. [2020-02-10 20:37:37,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:37,895 INFO L93 Difference]: Finished difference Result 6020 states and 26784 transitions. [2020-02-10 20:37:37,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:37:37,895 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:37:37,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:37,910 INFO L225 Difference]: With dead ends: 6020 [2020-02-10 20:37:37,910 INFO L226 Difference]: Without dead ends: 5978 [2020-02-10 20:37:37,910 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:37:38,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5978 states. [2020-02-10 20:37:38,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5978 to 3110. [2020-02-10 20:37:38,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3110 states. [2020-02-10 20:37:38,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3110 states to 3110 states and 15522 transitions. [2020-02-10 20:37:38,095 INFO L78 Accepts]: Start accepts. Automaton has 3110 states and 15522 transitions. Word has length 31 [2020-02-10 20:37:38,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:38,095 INFO L479 AbstractCegarLoop]: Abstraction has 3110 states and 15522 transitions. [2020-02-10 20:37:38,095 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:37:38,095 INFO L276 IsEmpty]: Start isEmpty. Operand 3110 states and 15522 transitions. [2020-02-10 20:37:38,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:37:38,100 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:38,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:37:38,100 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:37:38,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:38,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1910641922, now seen corresponding path program 553 times [2020-02-10 20:37:38,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:38,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377158927] [2020-02-10 20:37:38,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:38,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:38,473 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 26 [2020-02-10 20:37:38,695 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:37:38,828 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:37:38,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:37:38,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377158927] [2020-02-10 20:37:38,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:38,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:37:38,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533500161] [2020-02-10 20:37:38,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:37:38,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:38,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:37:38,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:37:38,837 INFO L87 Difference]: Start difference. First operand 3110 states and 15522 transitions. Second operand 12 states. [2020-02-10 20:37:39,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:39,109 INFO L93 Difference]: Finished difference Result 6017 states and 26824 transitions. [2020-02-10 20:37:39,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:37:39,110 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:37:39,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:39,124 INFO L225 Difference]: With dead ends: 6017 [2020-02-10 20:37:39,124 INFO L226 Difference]: Without dead ends: 5998 [2020-02-10 20:37:39,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:37:39,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5998 states. [2020-02-10 20:37:39,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5998 to 3129. [2020-02-10 20:37:39,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 20:37:39,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15589 transitions. [2020-02-10 20:37:39,307 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15589 transitions. Word has length 31 [2020-02-10 20:37:39,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:39,307 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15589 transitions. [2020-02-10 20:37:39,307 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:37:39,307 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15589 transitions. [2020-02-10 20:37:39,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:37:39,313 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:39,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:37:39,313 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:37:39,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:39,313 INFO L82 PathProgramCache]: Analyzing trace with hash 271896744, now seen corresponding path program 554 times [2020-02-10 20:37:39,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:39,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205394509] [2020-02-10 20:37:39,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:39,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:39,853 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:37:39,982 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:37:39,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:37:39,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205394509] [2020-02-10 20:37:39,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:39,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:37:39,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559702709] [2020-02-10 20:37:39,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:37:39,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:39,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:37:39,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:37:39,992 INFO L87 Difference]: Start difference. First operand 3129 states and 15589 transitions. Second operand 12 states. [2020-02-10 20:37:40,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:40,251 INFO L93 Difference]: Finished difference Result 6015 states and 26814 transitions. [2020-02-10 20:37:40,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:37:40,251 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:37:40,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:40,266 INFO L225 Difference]: With dead ends: 6015 [2020-02-10 20:37:40,266 INFO L226 Difference]: Without dead ends: 5992 [2020-02-10 20:37:40,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:37:40,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5992 states. [2020-02-10 20:37:40,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5992 to 3123. [2020-02-10 20:37:40,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3123 states. [2020-02-10 20:37:40,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 15572 transitions. [2020-02-10 20:37:40,454 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 15572 transitions. Word has length 31 [2020-02-10 20:37:40,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:40,454 INFO L479 AbstractCegarLoop]: Abstraction has 3123 states and 15572 transitions. [2020-02-10 20:37:40,454 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:37:40,454 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 15572 transitions. [2020-02-10 20:37:40,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:37:40,459 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:40,459 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:37:40,459 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:37:40,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:40,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1960014138, now seen corresponding path program 555 times [2020-02-10 20:37:40,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:40,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308501865] [2020-02-10 20:37:40,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:40,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:41,010 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:37:41,144 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:37:41,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:37:41,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308501865] [2020-02-10 20:37:41,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:41,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:37:41,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985638187] [2020-02-10 20:37:41,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:37:41,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:41,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:37:41,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:37:41,154 INFO L87 Difference]: Start difference. First operand 3123 states and 15572 transitions. Second operand 12 states. [2020-02-10 20:37:41,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:41,446 INFO L93 Difference]: Finished difference Result 6019 states and 26823 transitions. [2020-02-10 20:37:41,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:37:41,447 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:37:41,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:41,461 INFO L225 Difference]: With dead ends: 6019 [2020-02-10 20:37:41,461 INFO L226 Difference]: Without dead ends: 6000 [2020-02-10 20:37:41,461 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:37:41,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6000 states. [2020-02-10 20:37:41,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6000 to 3130. [2020-02-10 20:37:41,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 20:37:41,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15585 transitions. [2020-02-10 20:37:41,646 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15585 transitions. Word has length 31 [2020-02-10 20:37:41,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:41,646 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15585 transitions. [2020-02-10 20:37:41,646 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:37:41,647 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15585 transitions. [2020-02-10 20:37:41,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:37:41,652 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:41,652 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:37:41,652 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:37:41,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:41,652 INFO L82 PathProgramCache]: Analyzing trace with hash -997385944, now seen corresponding path program 556 times [2020-02-10 20:37:41,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:41,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110229730] [2020-02-10 20:37:41,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:41,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:42,194 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:37:42,329 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:37:42,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:37:42,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110229730] [2020-02-10 20:37:42,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:42,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:37:42,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579306220] [2020-02-10 20:37:42,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:37:42,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:42,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:37:42,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:37:42,338 INFO L87 Difference]: Start difference. First operand 3130 states and 15585 transitions. Second operand 12 states. [2020-02-10 20:37:42,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:42,582 INFO L93 Difference]: Finished difference Result 6018 states and 26814 transitions. [2020-02-10 20:37:42,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:37:42,583 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:37:42,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:42,597 INFO L225 Difference]: With dead ends: 6018 [2020-02-10 20:37:42,597 INFO L226 Difference]: Without dead ends: 5993 [2020-02-10 20:37:42,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:37:42,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5993 states. [2020-02-10 20:37:42,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5993 to 3123. [2020-02-10 20:37:42,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3123 states. [2020-02-10 20:37:42,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 15566 transitions. [2020-02-10 20:37:42,780 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 15566 transitions. Word has length 31 [2020-02-10 20:37:42,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:42,780 INFO L479 AbstractCegarLoop]: Abstraction has 3123 states and 15566 transitions. [2020-02-10 20:37:42,780 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:37:42,781 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 15566 transitions. [2020-02-10 20:37:42,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:37:42,785 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:42,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:37:42,786 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:37:42,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:42,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1213192582, now seen corresponding path program 557 times [2020-02-10 20:37:42,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:42,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262062242] [2020-02-10 20:37:42,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:42,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:43,343 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:37:43,470 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:37: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:37:43,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262062242] [2020-02-10 20:37:43,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:43,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:37:43,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718328560] [2020-02-10 20:37:43,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:37:43,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:43,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:37:43,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:37:43,481 INFO L87 Difference]: Start difference. First operand 3123 states and 15566 transitions. Second operand 12 states. [2020-02-10 20:37:43,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:43,736 INFO L93 Difference]: Finished difference Result 6014 states and 26806 transitions. [2020-02-10 20:37:43,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:37:43,736 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:37:43,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:43,750 INFO L225 Difference]: With dead ends: 6014 [2020-02-10 20:37:43,750 INFO L226 Difference]: Without dead ends: 5997 [2020-02-10 20:37:43,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:37:43,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5997 states. [2020-02-10 20:37:43,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5997 to 3129. [2020-02-10 20:37:43,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 20:37:43,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15577 transitions. [2020-02-10 20:37:43,936 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15577 transitions. Word has length 31 [2020-02-10 20:37:43,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:43,937 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15577 transitions. [2020-02-10 20:37:43,937 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:37:43,937 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15577 transitions. [2020-02-10 20:37:43,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:37:43,942 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:43,942 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:37:43,942 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:37:43,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:43,942 INFO L82 PathProgramCache]: Analyzing trace with hash -2058164034, now seen corresponding path program 558 times [2020-02-10 20:37:43,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:43,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217230215] [2020-02-10 20:37:43,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:43,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:44,488 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:37:44,619 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:37:44,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:37:44,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217230215] [2020-02-10 20:37:44,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:44,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:37:44,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441615035] [2020-02-10 20:37:44,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:37:44,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:44,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:37:44,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:37:44,629 INFO L87 Difference]: Start difference. First operand 3129 states and 15577 transitions. Second operand 12 states. [2020-02-10 20:37:44,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:44,880 INFO L93 Difference]: Finished difference Result 6015 states and 26802 transitions. [2020-02-10 20:37:44,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:37:44,880 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:37:44,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:44,895 INFO L225 Difference]: With dead ends: 6015 [2020-02-10 20:37:44,896 INFO L226 Difference]: Without dead ends: 5985 [2020-02-10 20:37:44,896 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:37:45,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5985 states. [2020-02-10 20:37:45,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5985 to 3117. [2020-02-10 20:37:45,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3117 states. [2020-02-10 20:37:45,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3117 states to 3117 states and 15549 transitions. [2020-02-10 20:37:45,078 INFO L78 Accepts]: Start accepts. Automaton has 3117 states and 15549 transitions. Word has length 31 [2020-02-10 20:37:45,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:45,078 INFO L479 AbstractCegarLoop]: Abstraction has 3117 states and 15549 transitions. [2020-02-10 20:37:45,079 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:37:45,079 INFO L276 IsEmpty]: Start isEmpty. Operand 3117 states and 15549 transitions. [2020-02-10 20:37:45,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:37:45,084 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:45,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:37:45,084 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:37:45,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:45,084 INFO L82 PathProgramCache]: Analyzing trace with hash -166277916, now seen corresponding path program 559 times [2020-02-10 20:37:45,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:45,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986157003] [2020-02-10 20:37:45,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:45,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:45,624 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:37:45,753 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:37:45,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:37:45,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986157003] [2020-02-10 20:37:45,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:45,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:37:45,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641402093] [2020-02-10 20:37:45,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:37:45,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:45,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:37:45,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:37:45,763 INFO L87 Difference]: Start difference. First operand 3117 states and 15549 transitions. Second operand 12 states. [2020-02-10 20:37:46,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:46,055 INFO L93 Difference]: Finished difference Result 6025 states and 26835 transitions. [2020-02-10 20:37:46,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:37:46,056 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:37:46,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:46,070 INFO L225 Difference]: With dead ends: 6025 [2020-02-10 20:37:46,070 INFO L226 Difference]: Without dead ends: 6006 [2020-02-10 20:37:46,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:37:46,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6006 states. [2020-02-10 20:37:46,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6006 to 3130. [2020-02-10 20:37:46,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 20:37:46,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15586 transitions. [2020-02-10 20:37:46,252 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15586 transitions. Word has length 31 [2020-02-10 20:37:46,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:46,252 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15586 transitions. [2020-02-10 20:37:46,252 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:37:46,253 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15586 transitions. [2020-02-10 20:37:46,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:37:46,257 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:46,258 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:37:46,258 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:37:46,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:46,258 INFO L82 PathProgramCache]: Analyzing trace with hash 2016260750, now seen corresponding path program 560 times [2020-02-10 20:37:46,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:46,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774417765] [2020-02-10 20:37:46,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:46,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:46,836 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-02-10 20:37:46,969 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:37:46,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:37:46,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774417765] [2020-02-10 20:37:46,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:46,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:37:46,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182714772] [2020-02-10 20:37:46,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:37:46,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:46,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:37:46,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:37:46,979 INFO L87 Difference]: Start difference. First operand 3130 states and 15586 transitions. Second operand 12 states. [2020-02-10 20:37:47,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:47,255 INFO L93 Difference]: Finished difference Result 6023 states and 26825 transitions. [2020-02-10 20:37:47,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:37:47,256 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:37:47,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:47,271 INFO L225 Difference]: With dead ends: 6023 [2020-02-10 20:37:47,271 INFO L226 Difference]: Without dead ends: 6000 [2020-02-10 20:37:47,271 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:37:47,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6000 states. [2020-02-10 20:37:47,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6000 to 3124. [2020-02-10 20:37:47,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:37:47,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15569 transitions. [2020-02-10 20:37:47,455 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15569 transitions. Word has length 31 [2020-02-10 20:37:47,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:47,455 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15569 transitions. [2020-02-10 20:37:47,455 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:37:47,455 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15569 transitions. [2020-02-10 20:37:47,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:37:47,460 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:47,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:37:47,461 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:37:47,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:47,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1227056006, now seen corresponding path program 561 times [2020-02-10 20:37:47,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:47,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251002670] [2020-02-10 20:37:47,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:47,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:48,008 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:37:48,141 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:37:48,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:37:48,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251002670] [2020-02-10 20:37:48,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:48,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:37:48,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056620592] [2020-02-10 20:37:48,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:37:48,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:48,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:37:48,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:37:48,150 INFO L87 Difference]: Start difference. First operand 3124 states and 15569 transitions. Second operand 12 states. [2020-02-10 20:37:48,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:48,389 INFO L93 Difference]: Finished difference Result 6033 states and 26846 transitions. [2020-02-10 20:37:48,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:37:48,389 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:37:48,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:48,404 INFO L225 Difference]: With dead ends: 6033 [2020-02-10 20:37:48,404 INFO L226 Difference]: Without dead ends: 6014 [2020-02-10 20:37:48,404 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:37:48,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6014 states. [2020-02-10 20:37:48,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6014 to 3133. [2020-02-10 20:37:48,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-02-10 20:37:48,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15586 transitions. [2020-02-10 20:37:48,591 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15586 transitions. Word has length 31 [2020-02-10 20:37:48,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:48,591 INFO L479 AbstractCegarLoop]: Abstraction has 3133 states and 15586 transitions. [2020-02-10 20:37:48,591 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:37:48,591 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15586 transitions. [2020-02-10 20:37:48,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:37:48,596 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:48,596 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:37:48,596 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:37:48,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:48,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1156945970, now seen corresponding path program 562 times [2020-02-10 20:37:48,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:48,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925028395] [2020-02-10 20:37:48,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:48,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:49,153 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:37:49,284 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:37:49,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:37:49,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925028395] [2020-02-10 20:37:49,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:49,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:37:49,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757393770] [2020-02-10 20:37:49,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:37:49,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:49,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:37:49,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:37:49,294 INFO L87 Difference]: Start difference. First operand 3133 states and 15586 transitions. Second operand 12 states. [2020-02-10 20:37:49,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:49,535 INFO L93 Difference]: Finished difference Result 6036 states and 26843 transitions. [2020-02-10 20:37:49,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:37:49,536 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:37:49,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:49,550 INFO L225 Difference]: With dead ends: 6036 [2020-02-10 20:37:49,550 INFO L226 Difference]: Without dead ends: 6005 [2020-02-10 20:37:49,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:37:49,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6005 states. [2020-02-10 20:37:49,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6005 to 3124. [2020-02-10 20:37:49,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:37:49,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15562 transitions. [2020-02-10 20:37:49,738 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15562 transitions. Word has length 31 [2020-02-10 20:37:49,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:49,738 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15562 transitions. [2020-02-10 20:37:49,738 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:37:49,738 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15562 transitions. [2020-02-10 20:37:49,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:37:49,743 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:49,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:37:49,743 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:37:49,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:49,743 INFO L82 PathProgramCache]: Analyzing trace with hash -105295430, now seen corresponding path program 563 times [2020-02-10 20:37:49,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:49,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037150887] [2020-02-10 20:37:49,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:49,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:50,277 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:37:50,406 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:37:50,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:37:50,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037150887] [2020-02-10 20:37:50,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:50,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:37:50,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34377123] [2020-02-10 20:37:50,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:37:50,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:50,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:37:50,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:37:50,416 INFO L87 Difference]: Start difference. First operand 3124 states and 15562 transitions. Second operand 12 states. [2020-02-10 20:37:50,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:50,680 INFO L93 Difference]: Finished difference Result 6027 states and 26825 transitions. [2020-02-10 20:37:50,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:37:50,681 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:37:50,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:50,695 INFO L225 Difference]: With dead ends: 6027 [2020-02-10 20:37:50,695 INFO L226 Difference]: Without dead ends: 6010 [2020-02-10 20:37:50,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:37:50,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6010 states. [2020-02-10 20:37:50,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6010 to 3131. [2020-02-10 20:37:50,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 20:37:50,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15575 transitions. [2020-02-10 20:37:50,877 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15575 transitions. Word has length 31 [2020-02-10 20:37:50,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:50,878 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15575 transitions. [2020-02-10 20:37:50,878 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:37:50,878 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15575 transitions. [2020-02-10 20:37:50,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:37:50,883 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:50,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:37:50,883 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:37:50,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:50,883 INFO L82 PathProgramCache]: Analyzing trace with hash 2077243236, now seen corresponding path program 564 times [2020-02-10 20:37:50,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:50,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349019172] [2020-02-10 20:37:50,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:50,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:51,427 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:37:51,560 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:37:51,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:37:51,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349019172] [2020-02-10 20:37:51,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:51,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:37:51,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420397814] [2020-02-10 20:37:51,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:37:51,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:51,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:37:51,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:37:51,570 INFO L87 Difference]: Start difference. First operand 3131 states and 15575 transitions. Second operand 12 states. [2020-02-10 20:37:51,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:51,790 INFO L93 Difference]: Finished difference Result 6032 states and 26828 transitions. [2020-02-10 20:37:51,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:37:51,790 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:37:51,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:51,806 INFO L225 Difference]: With dead ends: 6032 [2020-02-10 20:37:51,806 INFO L226 Difference]: Without dead ends: 5996 [2020-02-10 20:37:51,806 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:37:51,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5996 states. [2020-02-10 20:37:51,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5996 to 3117. [2020-02-10 20:37:51,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3117 states. [2020-02-10 20:37:51,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3117 states to 3117 states and 15542 transitions. [2020-02-10 20:37:51,989 INFO L78 Accepts]: Start accepts. Automaton has 3117 states and 15542 transitions. Word has length 31 [2020-02-10 20:37:51,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:51,990 INFO L479 AbstractCegarLoop]: Abstraction has 3117 states and 15542 transitions. [2020-02-10 20:37:51,990 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:37:51,990 INFO L276 IsEmpty]: Start isEmpty. Operand 3117 states and 15542 transitions. [2020-02-10 20:37:51,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:37:51,995 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:51,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:37:51,995 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:37:51,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:51,995 INFO L82 PathProgramCache]: Analyzing trace with hash -859335580, now seen corresponding path program 565 times [2020-02-10 20:37:51,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:51,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703909995] [2020-02-10 20:37:51,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:51,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:52,558 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:37:52,693 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:37: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:37:52,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703909995] [2020-02-10 20:37:52,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:52,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:37:52,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769865533] [2020-02-10 20:37:52,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:37:52,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:52,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:37:52,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:37:52,703 INFO L87 Difference]: Start difference. First operand 3117 states and 15542 transitions. Second operand 12 states. [2020-02-10 20:37:53,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:53,061 INFO L93 Difference]: Finished difference Result 6031 states and 26845 transitions. [2020-02-10 20:37:53,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:37:53,061 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:37:53,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:53,077 INFO L225 Difference]: With dead ends: 6031 [2020-02-10 20:37:53,077 INFO L226 Difference]: Without dead ends: 6012 [2020-02-10 20:37:53,077 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:37:53,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6012 states. [2020-02-10 20:37:53,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6012 to 3132. [2020-02-10 20:37:53,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-02-10 20:37:53,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15585 transitions. [2020-02-10 20:37:53,260 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15585 transitions. Word has length 31 [2020-02-10 20:37:53,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:53,260 INFO L479 AbstractCegarLoop]: Abstraction has 3132 states and 15585 transitions. [2020-02-10 20:37:53,260 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:37:53,260 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15585 transitions. [2020-02-10 20:37:53,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:37:53,265 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:53,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:37:53,265 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:37:53,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:53,266 INFO L82 PathProgramCache]: Analyzing trace with hash 478231634, now seen corresponding path program 566 times [2020-02-10 20:37:53,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:53,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077017351] [2020-02-10 20:37:53,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:53,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:53,821 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:37:53,953 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:37:53,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:37:53,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077017351] [2020-02-10 20:37:53,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:53,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:37:53,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689731382] [2020-02-10 20:37:53,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:37:53,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:53,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:37:53,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:37:53,963 INFO L87 Difference]: Start difference. First operand 3132 states and 15585 transitions. Second operand 12 states. [2020-02-10 20:37:54,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:54,213 INFO L93 Difference]: Finished difference Result 6030 states and 26836 transitions. [2020-02-10 20:37:54,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:37:54,213 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:37:54,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:54,228 INFO L225 Difference]: With dead ends: 6030 [2020-02-10 20:37:54,228 INFO L226 Difference]: Without dead ends: 6005 [2020-02-10 20:37:54,228 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:37:54,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6005 states. [2020-02-10 20:37:54,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6005 to 3125. [2020-02-10 20:37:54,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 20:37:54,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15565 transitions. [2020-02-10 20:37:54,417 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15565 transitions. Word has length 31 [2020-02-10 20:37:54,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:54,417 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15565 transitions. [2020-02-10 20:37:54,417 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:37:54,417 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15565 transitions. [2020-02-10 20:37:54,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:37:54,422 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:54,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:37:54,423 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:37:54,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:54,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1495802434, now seen corresponding path program 567 times [2020-02-10 20:37:54,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:54,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290716644] [2020-02-10 20:37:54,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:54,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:54,971 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:37:55,155 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2020-02-10 20:37:55,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:37:55,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290716644] [2020-02-10 20:37:55,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:55,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:37:55,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113268484] [2020-02-10 20:37:55,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:37:55,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:55,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:37:55,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:37:55,166 INFO L87 Difference]: Start difference. First operand 3125 states and 15565 transitions. Second operand 12 states. [2020-02-10 20:37:55,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:55,527 INFO L93 Difference]: Finished difference Result 6037 states and 26850 transitions. [2020-02-10 20:37:55,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:37:55,528 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:37:55,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:55,542 INFO L225 Difference]: With dead ends: 6037 [2020-02-10 20:37:55,542 INFO L226 Difference]: Without dead ends: 6018 [2020-02-10 20:37:55,543 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:37:55,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6018 states. [2020-02-10 20:37:55,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6018 to 3134. [2020-02-10 20:37:55,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3134 states. [2020-02-10 20:37:55,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3134 states to 3134 states and 15582 transitions. [2020-02-10 20:37:55,726 INFO L78 Accepts]: Start accepts. Automaton has 3134 states and 15582 transitions. Word has length 31 [2020-02-10 20:37:55,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:55,726 INFO L479 AbstractCegarLoop]: Abstraction has 3134 states and 15582 transitions. [2020-02-10 20:37:55,726 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:37:55,727 INFO L276 IsEmpty]: Start isEmpty. Operand 3134 states and 15582 transitions. [2020-02-10 20:37:55,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:37:55,731 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:55,732 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:37:55,732 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:37:55,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:55,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1425692398, now seen corresponding path program 568 times [2020-02-10 20:37:55,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:55,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860803965] [2020-02-10 20:37:55,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:55,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:56,284 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 36 [2020-02-10 20:37:56,412 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:37:56,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:37:56,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860803965] [2020-02-10 20:37:56,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:56,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:37:56,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395975512] [2020-02-10 20:37:56,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:37:56,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:56,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:37:56,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:37:56,422 INFO L87 Difference]: Start difference. First operand 3134 states and 15582 transitions. Second operand 12 states. [2020-02-10 20:37:56,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:56,746 INFO L93 Difference]: Finished difference Result 6040 states and 26847 transitions. [2020-02-10 20:37:56,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:37:56,747 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:37:56,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:56,761 INFO L225 Difference]: With dead ends: 6040 [2020-02-10 20:37:56,761 INFO L226 Difference]: Without dead ends: 6009 [2020-02-10 20:37:56,761 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:37:56,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6009 states. [2020-02-10 20:37:56,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6009 to 3125. [2020-02-10 20:37:56,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2020-02-10 20:37:56,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 15557 transitions. [2020-02-10 20:37:56,946 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 15557 transitions. Word has length 31 [2020-02-10 20:37:56,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:56,946 INFO L479 AbstractCegarLoop]: Abstraction has 3125 states and 15557 transitions. [2020-02-10 20:37:56,946 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:37:56,946 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 15557 transitions. [2020-02-10 20:37:56,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:37:56,951 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:56,951 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:37:56,951 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:37:56,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:56,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1643324546, now seen corresponding path program 569 times [2020-02-10 20:37:56,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:56,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288579528] [2020-02-10 20:37:56,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:56,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:57,500 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:37:57,631 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:37:57,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:37:57,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288579528] [2020-02-10 20:37:57,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:57,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:37:57,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898905965] [2020-02-10 20:37:57,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:37:57,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:57,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:37:57,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:37:57,640 INFO L87 Difference]: Start difference. First operand 3125 states and 15557 transitions. Second operand 12 states. [2020-02-10 20:37:58,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:58,021 INFO L93 Difference]: Finished difference Result 6034 states and 26835 transitions. [2020-02-10 20:37:58,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:37:58,022 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:37:58,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:58,036 INFO L225 Difference]: With dead ends: 6034 [2020-02-10 20:37:58,036 INFO L226 Difference]: Without dead ends: 6016 [2020-02-10 20:37:58,036 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:37:58,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6016 states. [2020-02-10 20:37:58,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6016 to 3133. [2020-02-10 20:37:58,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2020-02-10 20:37:58,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 15572 transitions. [2020-02-10 20:37:58,223 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 15572 transitions. Word has length 31 [2020-02-10 20:37:58,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:58,224 INFO L479 AbstractCegarLoop]: Abstraction has 3133 states and 15572 transitions. [2020-02-10 20:37:58,224 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:37:58,224 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 15572 transitions. [2020-02-10 20:37:58,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:37:58,229 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:58,229 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:37:58,229 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:37:58,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:58,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1384185572, now seen corresponding path program 570 times [2020-02-10 20:37:58,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:58,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813301547] [2020-02-10 20:37:58,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:58,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:58,792 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 35 [2020-02-10 20:37:58,926 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:37:58,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:37:58,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813301547] [2020-02-10 20:37:58,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:37:58,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:37:58,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457000074] [2020-02-10 20:37:58,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:37:58,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:37:58,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:37:58,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:37:58,936 INFO L87 Difference]: Start difference. First operand 3133 states and 15572 transitions. Second operand 12 states. [2020-02-10 20:37:59,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:37:59,165 INFO L93 Difference]: Finished difference Result 6038 states and 26835 transitions. [2020-02-10 20:37:59,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:37:59,166 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:37:59,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:37:59,181 INFO L225 Difference]: With dead ends: 6038 [2020-02-10 20:37:59,181 INFO L226 Difference]: Without dead ends: 6000 [2020-02-10 20:37:59,181 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:37:59,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6000 states. [2020-02-10 20:37:59,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6000 to 3117. [2020-02-10 20:37:59,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3117 states. [2020-02-10 20:37:59,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3117 states to 3117 states and 15535 transitions. [2020-02-10 20:37:59,364 INFO L78 Accepts]: Start accepts. Automaton has 3117 states and 15535 transitions. Word has length 31 [2020-02-10 20:37:59,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:37:59,364 INFO L479 AbstractCegarLoop]: Abstraction has 3117 states and 15535 transitions. [2020-02-10 20:37:59,364 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:37:59,364 INFO L276 IsEmpty]: Start isEmpty. Operand 3117 states and 15535 transitions. [2020-02-10 20:37:59,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:37:59,369 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:37:59,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:37:59,370 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:37:59,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:37:59,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1738042574, now seen corresponding path program 571 times [2020-02-10 20:37:59,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:37:59,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205157559] [2020-02-10 20:37:59,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:37:59,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:37:59,921 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:38:00,051 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:38: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:38:00,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205157559] [2020-02-10 20:38:00,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:38:00,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:38:00,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289374338] [2020-02-10 20:38:00,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:38:00,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:38:00,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:38:00,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:38:00,062 INFO L87 Difference]: Start difference. First operand 3117 states and 15535 transitions. Second operand 12 states. [2020-02-10 20:38:00,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:38:00,324 INFO L93 Difference]: Finished difference Result 6020 states and 26810 transitions. [2020-02-10 20:38:00,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:38:00,324 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:38:00,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:38:00,339 INFO L225 Difference]: With dead ends: 6020 [2020-02-10 20:38:00,339 INFO L226 Difference]: Without dead ends: 6003 [2020-02-10 20:38:00,339 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:38:00,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6003 states. [2020-02-10 20:38:00,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6003 to 3130. [2020-02-10 20:38:00,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 20:38:00,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15572 transitions. [2020-02-10 20:38:00,521 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15572 transitions. Word has length 31 [2020-02-10 20:38:00,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:38:00,521 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15572 transitions. [2020-02-10 20:38:00,521 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:38:00,521 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15572 transitions. [2020-02-10 20:38:00,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:38:00,526 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:38:00,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:38:00,526 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:38:00,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:38:00,526 INFO L82 PathProgramCache]: Analyzing trace with hash 893071122, now seen corresponding path program 572 times [2020-02-10 20:38:00,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:38:00,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391358883] [2020-02-10 20:38:00,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:38:00,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:38:01,076 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:38:01,208 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:38:01,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:38:01,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391358883] [2020-02-10 20:38:01,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:38:01,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:38:01,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144943097] [2020-02-10 20:38:01,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:38:01,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:38:01,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:38:01,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:38:01,218 INFO L87 Difference]: Start difference. First operand 3130 states and 15572 transitions. Second operand 12 states. [2020-02-10 20:38:01,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:38:01,442 INFO L93 Difference]: Finished difference Result 6021 states and 26806 transitions. [2020-02-10 20:38:01,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:38:01,442 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:38:01,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:38:01,457 INFO L225 Difference]: With dead ends: 6021 [2020-02-10 20:38:01,457 INFO L226 Difference]: Without dead ends: 5997 [2020-02-10 20:38:01,457 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:38:01,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5997 states. [2020-02-10 20:38:01,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5997 to 3124. [2020-02-10 20:38:01,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:38:01,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15555 transitions. [2020-02-10 20:38:01,654 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15555 transitions. Word has length 31 [2020-02-10 20:38:01,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:38:01,654 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15555 transitions. [2020-02-10 20:38:01,654 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:38:01,654 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15555 transitions. [2020-02-10 20:38:01,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:38:01,660 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:38:01,660 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:38:01,661 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:38:01,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:38:01,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1101575720, now seen corresponding path program 573 times [2020-02-10 20:38:01,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:38:01,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847266041] [2020-02-10 20:38:01,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:38:01,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:38:02,200 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:38:02,326 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:38:02,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:38:02,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847266041] [2020-02-10 20:38:02,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:38:02,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:38:02,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382779510] [2020-02-10 20:38:02,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:38:02,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:38:02,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:38:02,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:38:02,336 INFO L87 Difference]: Start difference. First operand 3124 states and 15555 transitions. Second operand 12 states. [2020-02-10 20:38:02,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:38:02,587 INFO L93 Difference]: Finished difference Result 6025 states and 26813 transitions. [2020-02-10 20:38:02,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:38:02,588 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:38:02,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:38:02,602 INFO L225 Difference]: With dead ends: 6025 [2020-02-10 20:38:02,603 INFO L226 Difference]: Without dead ends: 6008 [2020-02-10 20:38:02,603 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:38:02,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6008 states. [2020-02-10 20:38:02,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6008 to 3131. [2020-02-10 20:38:02,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 20:38:02,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15568 transitions. [2020-02-10 20:38:02,785 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15568 transitions. Word has length 31 [2020-02-10 20:38:02,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:38:02,785 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15568 transitions. [2020-02-10 20:38:02,785 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:38:02,785 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15568 transitions. [2020-02-10 20:38:02,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:38:02,790 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:38:02,790 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:38:02,790 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:38:02,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:38:02,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1010852910, now seen corresponding path program 574 times [2020-02-10 20:38:02,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:38:02,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434621342] [2020-02-10 20:38:02,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:38:02,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:38:03,336 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:38:03,469 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:38:03,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:38:03,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434621342] [2020-02-10 20:38:03,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:38:03,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:38:03,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337824844] [2020-02-10 20:38:03,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:38:03,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:38:03,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:38:03,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:38:03,478 INFO L87 Difference]: Start difference. First operand 3131 states and 15568 transitions. Second operand 12 states. [2020-02-10 20:38:03,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:38:03,688 INFO L93 Difference]: Finished difference Result 6030 states and 26816 transitions. [2020-02-10 20:38:03,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:38:03,689 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:38:03,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:38:03,703 INFO L225 Difference]: With dead ends: 6030 [2020-02-10 20:38:03,703 INFO L226 Difference]: Without dead ends: 6001 [2020-02-10 20:38:03,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:38:03,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6001 states. [2020-02-10 20:38:03,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6001 to 3124. [2020-02-10 20:38:03,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2020-02-10 20:38:03,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 15548 transitions. [2020-02-10 20:38:03,898 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 15548 transitions. Word has length 31 [2020-02-10 20:38:03,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:38:03,899 INFO L479 AbstractCegarLoop]: Abstraction has 3124 states and 15548 transitions. [2020-02-10 20:38:03,899 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:38:03,899 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 15548 transitions. [2020-02-10 20:38:03,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:38:03,904 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:38:03,904 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:38:03,904 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:38:03,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:38:03,905 INFO L82 PathProgramCache]: Analyzing trace with hash -167706968, now seen corresponding path program 575 times [2020-02-10 20:38:03,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:38:03,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829191512] [2020-02-10 20:38:03,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:38:03,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:38:04,441 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:38:04,569 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:38:04,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:38:04,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829191512] [2020-02-10 20:38:04,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:38:04,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:38:04,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017141354] [2020-02-10 20:38:04,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:38:04,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:38:04,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:38:04,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:38:04,579 INFO L87 Difference]: Start difference. First operand 3124 states and 15548 transitions. Second operand 12 states. [2020-02-10 20:38:04,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:38:04,821 INFO L93 Difference]: Finished difference Result 6028 states and 26813 transitions. [2020-02-10 20:38:04,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:38:04,821 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:38:04,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:38:04,835 INFO L225 Difference]: With dead ends: 6028 [2020-02-10 20:38:04,836 INFO L226 Difference]: Without dead ends: 6010 [2020-02-10 20:38:04,836 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:38:04,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6010 states. [2020-02-10 20:38:05,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6010 to 3132. [2020-02-10 20:38:05,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3132 states. [2020-02-10 20:38:05,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 15563 transitions. [2020-02-10 20:38:05,017 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 15563 transitions. Word has length 31 [2020-02-10 20:38:05,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:38:05,018 INFO L479 AbstractCegarLoop]: Abstraction has 3132 states and 15563 transitions. [2020-02-10 20:38:05,018 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:38:05,018 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 15563 transitions. [2020-02-10 20:38:05,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:38:05,023 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:38:05,023 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:38:05,023 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:38:05,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:38:05,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1435164146, now seen corresponding path program 576 times [2020-02-10 20:38:05,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:38:05,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664769031] [2020-02-10 20:38:05,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:38:05,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:38:05,577 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:38:05,706 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:38:05,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:38:05,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664769031] [2020-02-10 20:38:05,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:38:05,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:38:05,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882094612] [2020-02-10 20:38:05,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:38:05,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:38:05,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:38:05,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:38:05,715 INFO L87 Difference]: Start difference. First operand 3132 states and 15563 transitions. Second operand 12 states. [2020-02-10 20:38:05,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:38:05,937 INFO L93 Difference]: Finished difference Result 6032 states and 26813 transitions. [2020-02-10 20:38:05,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:38:05,938 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:38:05,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:38:05,952 INFO L225 Difference]: With dead ends: 6032 [2020-02-10 20:38:05,952 INFO L226 Difference]: Without dead ends: 5988 [2020-02-10 20:38:05,952 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:38:06,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5988 states. [2020-02-10 20:38:06,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5988 to 3110. [2020-02-10 20:38:06,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3110 states. [2020-02-10 20:38:06,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3110 states to 3110 states and 15516 transitions. [2020-02-10 20:38:06,136 INFO L78 Accepts]: Start accepts. Automaton has 3110 states and 15516 transitions. Word has length 31 [2020-02-10 20:38:06,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:38:06,136 INFO L479 AbstractCegarLoop]: Abstraction has 3110 states and 15516 transitions. [2020-02-10 20:38:06,136 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:38:06,136 INFO L276 IsEmpty]: Start isEmpty. Operand 3110 states and 15516 transitions. [2020-02-10 20:38:06,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:38:06,141 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:38:06,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:38:06,141 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:38:06,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:38:06,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1744708478, now seen corresponding path program 577 times [2020-02-10 20:38:06,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:38:06,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234846677] [2020-02-10 20:38:06,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:38:06,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:38:06,689 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:38:06,819 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:38:06,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:38:06,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234846677] [2020-02-10 20:38:06,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:38:06,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:38:06,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713696031] [2020-02-10 20:38:06,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:38:06,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:38:06,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:38:06,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:38:06,830 INFO L87 Difference]: Start difference. First operand 3110 states and 15516 transitions. Second operand 12 states. [2020-02-10 20:38:07,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:38:07,051 INFO L93 Difference]: Finished difference Result 5989 states and 26739 transitions. [2020-02-10 20:38:07,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:38:07,051 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:38:07,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:38:07,066 INFO L225 Difference]: With dead ends: 5989 [2020-02-10 20:38:07,066 INFO L226 Difference]: Without dead ends: 5973 [2020-02-10 20:38:07,067 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:38:07,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5973 states. [2020-02-10 20:38:07,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5973 to 3126. [2020-02-10 20:38:07,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 20:38:07,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15572 transitions. [2020-02-10 20:38:07,252 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15572 transitions. Word has length 31 [2020-02-10 20:38:07,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:38:07,253 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15572 transitions. [2020-02-10 20:38:07,253 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:38:07,253 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15572 transitions. [2020-02-10 20:38:07,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:38:07,258 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:38:07,258 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:38:07,258 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:38:07,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:38:07,258 INFO L82 PathProgramCache]: Analyzing trace with hash 54765574, now seen corresponding path program 578 times [2020-02-10 20:38:07,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:38:07,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810484546] [2020-02-10 20:38:07,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:38:07,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:38:07,799 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:38:07,930 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:38:07,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:38:07,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810484546] [2020-02-10 20:38:07,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:38:07,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:38:07,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236823291] [2020-02-10 20:38:07,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:38:07,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:38:07,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:38:07,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:38:07,941 INFO L87 Difference]: Start difference. First operand 3126 states and 15572 transitions. Second operand 12 states. [2020-02-10 20:38:08,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:38:08,163 INFO L93 Difference]: Finished difference Result 5990 states and 26736 transitions. [2020-02-10 20:38:08,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:38:08,164 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:38:08,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:38:08,179 INFO L225 Difference]: With dead ends: 5990 [2020-02-10 20:38:08,179 INFO L226 Difference]: Without dead ends: 5968 [2020-02-10 20:38:08,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:38:08,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5968 states. [2020-02-10 20:38:08,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5968 to 3121. [2020-02-10 20:38:08,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 20:38:08,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15558 transitions. [2020-02-10 20:38:08,363 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15558 transitions. Word has length 31 [2020-02-10 20:38:08,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:38:08,363 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15558 transitions. [2020-02-10 20:38:08,363 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:38:08,363 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15558 transitions. [2020-02-10 20:38:08,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:38:08,368 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:38:08,368 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:38:08,368 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:38:08,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:38:08,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1320397242, now seen corresponding path program 579 times [2020-02-10 20:38:08,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:38:08,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892865646] [2020-02-10 20:38:08,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:38:08,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:38:08,903 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:38:09,039 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:38:09,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:38:09,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892865646] [2020-02-10 20:38:09,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:38:09,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:38:09,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124732861] [2020-02-10 20:38:09,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:38:09,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:38:09,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:38:09,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:38:09,049 INFO L87 Difference]: Start difference. First operand 3121 states and 15558 transitions. Second operand 12 states. [2020-02-10 20:38:09,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:38:09,317 INFO L93 Difference]: Finished difference Result 5990 states and 26736 transitions. [2020-02-10 20:38:09,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:38:09,318 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:38:09,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:38:09,333 INFO L225 Difference]: With dead ends: 5990 [2020-02-10 20:38:09,333 INFO L226 Difference]: Without dead ends: 5974 [2020-02-10 20:38: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:38:09,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5974 states. [2020-02-10 20:38:09,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5974 to 3126. [2020-02-10 20:38:09,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 20:38:09,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15567 transitions. [2020-02-10 20:38:09,517 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15567 transitions. Word has length 31 [2020-02-10 20:38:09,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:38:09,517 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15567 transitions. [2020-02-10 20:38:09,517 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:38:09,518 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15567 transitions. [2020-02-10 20:38:09,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:38:09,523 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:38:09,523 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:38:09,523 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:38:09,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:38:09,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1214517114, now seen corresponding path program 580 times [2020-02-10 20:38:09,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:38:09,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832306100] [2020-02-10 20:38:09,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:38:09,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:38:10,069 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:38:10,201 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:38:10,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:38:10,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832306100] [2020-02-10 20:38:10,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:38:10,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:38:10,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571277331] [2020-02-10 20:38:10,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:38:10,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:38:10,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:38:10,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:38:10,211 INFO L87 Difference]: Start difference. First operand 3126 states and 15567 transitions. Second operand 12 states. [2020-02-10 20:38:10,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:38:10,477 INFO L93 Difference]: Finished difference Result 5992 states and 26735 transitions. [2020-02-10 20:38:10,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:38:10,477 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:38:10,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:38:10,491 INFO L225 Difference]: With dead ends: 5992 [2020-02-10 20:38:10,492 INFO L226 Difference]: Without dead ends: 5969 [2020-02-10 20:38:10,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:38:10,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5969 states. [2020-02-10 20:38:10,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5969 to 3121. [2020-02-10 20:38:10,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 20:38:10,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15553 transitions. [2020-02-10 20:38:10,679 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15553 transitions. Word has length 31 [2020-02-10 20:38:10,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:38:10,679 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15553 transitions. [2020-02-10 20:38:10,679 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:38:10,679 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15553 transitions. [2020-02-10 20:38:10,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:38:10,684 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:38:10,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:38:10,684 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:38:10,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:38:10,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1218168134, now seen corresponding path program 581 times [2020-02-10 20:38:10,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:38:10,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166652608] [2020-02-10 20:38:10,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:38:10,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:38:11,238 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:38:11,369 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:38:11,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:38:11,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166652608] [2020-02-10 20:38:11,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:38:11,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:38:11,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094578473] [2020-02-10 20:38:11,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:38:11,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:38:11,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:38:11,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:38:11,378 INFO L87 Difference]: Start difference. First operand 3121 states and 15553 transitions. Second operand 12 states. [2020-02-10 20:38:11,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:38:11,601 INFO L93 Difference]: Finished difference Result 5993 states and 26738 transitions. [2020-02-10 20:38:11,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:38:11,602 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:38:11,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:38:11,616 INFO L225 Difference]: With dead ends: 5993 [2020-02-10 20:38:11,616 INFO L226 Difference]: Without dead ends: 5976 [2020-02-10 20:38:11,617 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:38:11,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5976 states. [2020-02-10 20:38:11,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5976 to 3127. [2020-02-10 20:38:11,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:38:11,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15564 transitions. [2020-02-10 20:38:11,841 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15564 transitions. Word has length 31 [2020-02-10 20:38:11,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:38:11,841 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15564 transitions. [2020-02-10 20:38:11,841 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:38:11,842 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15564 transitions. [2020-02-10 20:38:11,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:38:11,847 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:38:11,847 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:38:11,847 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:38:11,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:38:11,847 INFO L82 PathProgramCache]: Analyzing trace with hash -2063139586, now seen corresponding path program 582 times [2020-02-10 20:38:11,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:38:11,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828305198] [2020-02-10 20:38:11,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:38:11,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:38:12,387 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:38:12,522 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:38:12,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:38:12,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828305198] [2020-02-10 20:38:12,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:38:12,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:38:12,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968646178] [2020-02-10 20:38:12,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:38:12,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:38:12,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:38:12,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:38:12,531 INFO L87 Difference]: Start difference. First operand 3127 states and 15564 transitions. Second operand 12 states. [2020-02-10 20:38:12,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:38:12,798 INFO L93 Difference]: Finished difference Result 5994 states and 26734 transitions. [2020-02-10 20:38:12,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:38:12,799 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:38:12,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:38:12,813 INFO L225 Difference]: With dead ends: 5994 [2020-02-10 20:38:12,814 INFO L226 Difference]: Without dead ends: 5965 [2020-02-10 20:38:12,814 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:38:12,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5965 states. [2020-02-10 20:38:12,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5965 to 3116. [2020-02-10 20:38:12,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3116 states. [2020-02-10 20:38:13,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3116 states to 3116 states and 15539 transitions. [2020-02-10 20:38:13,000 INFO L78 Accepts]: Start accepts. Automaton has 3116 states and 15539 transitions. Word has length 31 [2020-02-10 20:38:13,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:38:13,000 INFO L479 AbstractCegarLoop]: Abstraction has 3116 states and 15539 transitions. [2020-02-10 20:38:13,000 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:38:13,000 INFO L276 IsEmpty]: Start isEmpty. Operand 3116 states and 15539 transitions. [2020-02-10 20:38:13,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:38:13,005 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:38:13,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:38:13,006 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:38:13,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:38:13,006 INFO L82 PathProgramCache]: Analyzing trace with hash -805894812, now seen corresponding path program 583 times [2020-02-10 20:38:13,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:38:13,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59551542] [2020-02-10 20:38:13,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:38:13,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:38:13,539 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:38:13,669 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:38:13,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:38:13,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59551542] [2020-02-10 20:38:13,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:38:13,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:38:13,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242475060] [2020-02-10 20:38:13,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:38:13,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:38:13,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:38:13,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:38:13,679 INFO L87 Difference]: Start difference. First operand 3116 states and 15539 transitions. Second operand 12 states. [2020-02-10 20:38:13,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:38:13,944 INFO L93 Difference]: Finished difference Result 5996 states and 26748 transitions. [2020-02-10 20:38:13,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:38:13,944 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:38:13,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:38:13,959 INFO L225 Difference]: With dead ends: 5996 [2020-02-10 20:38:13,959 INFO L226 Difference]: Without dead ends: 5980 [2020-02-10 20:38:13,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:38:14,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5980 states. [2020-02-10 20:38:14,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5980 to 3127. [2020-02-10 20:38:14,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:38:14,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15570 transitions. [2020-02-10 20:38:14,150 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15570 transitions. Word has length 31 [2020-02-10 20:38:14,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:38:14,151 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15570 transitions. [2020-02-10 20:38:14,151 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:38:14,151 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15570 transitions. [2020-02-10 20:38:14,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:38:14,156 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:38:14,156 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:38:14,156 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:38:14,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:38:14,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1799129580, now seen corresponding path program 584 times [2020-02-10 20:38:14,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:38:14,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865227185] [2020-02-10 20:38:14,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:38:14,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:38:14,699 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:38:14,833 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:38:14,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:38:14,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865227185] [2020-02-10 20:38:14,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:38:14,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:38:14,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687267068] [2020-02-10 20:38:14,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:38:14,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:38:14,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:38:14,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:38:14,844 INFO L87 Difference]: Start difference. First operand 3127 states and 15570 transitions. Second operand 12 states. [2020-02-10 20:38:15,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:38:15,067 INFO L93 Difference]: Finished difference Result 5997 states and 26745 transitions. [2020-02-10 20:38:15,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:38:15,067 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:38:15,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:38:15,081 INFO L225 Difference]: With dead ends: 5997 [2020-02-10 20:38:15,082 INFO L226 Difference]: Without dead ends: 5975 [2020-02-10 20:38:15,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:38:15,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5975 states. [2020-02-10 20:38:15,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5975 to 3122. [2020-02-10 20:38:15,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-02-10 20:38:15,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15556 transitions. [2020-02-10 20:38:15,264 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15556 transitions. Word has length 31 [2020-02-10 20:38:15,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:38:15,264 INFO L479 AbstractCegarLoop]: Abstraction has 3122 states and 15556 transitions. [2020-02-10 20:38:15,264 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:38:15,264 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15556 transitions. [2020-02-10 20:38:15,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:38:15,269 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:38:15,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 20:38:15,269 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:38:15,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:38:15,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1866672902, now seen corresponding path program 585 times [2020-02-10 20:38:15,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:38:15,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220020174] [2020-02-10 20:38:15,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:38:15,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:38:15,790 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:38:15,919 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:38:15,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:38:15,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220020174] [2020-02-10 20:38:15,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:38:15,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:38:15,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980766692] [2020-02-10 20:38:15,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:38:15,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:38:15,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:38:15,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:38:15,928 INFO L87 Difference]: Start difference. First operand 3122 states and 15556 transitions. Second operand 12 states. [2020-02-10 20:38:16,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:38:16,150 INFO L93 Difference]: Finished difference Result 6002 states and 26754 transitions. [2020-02-10 20:38:16,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:38:16,151 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:38:16,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:38:16,165 INFO L225 Difference]: With dead ends: 6002 [2020-02-10 20:38:16,165 INFO L226 Difference]: Without dead ends: 5986 [2020-02-10 20:38:16,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:38:16,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5986 states. [2020-02-10 20:38:16,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5986 to 3128. [2020-02-10 20:38:16,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 20:38:16,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15567 transitions. [2020-02-10 20:38:16,347 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15567 transitions. Word has length 31 [2020-02-10 20:38:16,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:38:16,347 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15567 transitions. [2020-02-10 20:38:16,347 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:38:16,348 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15567 transitions. [2020-02-10 20:38:16,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:38:16,352 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:38:16,353 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:38:16,353 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:38:16,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:38:16,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1374077140, now seen corresponding path program 586 times [2020-02-10 20:38:16,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:38:16,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233396228] [2020-02-10 20:38:16,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:38:16,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:38:16,874 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 34 [2020-02-10 20:38:17,006 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:38:17,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:38:17,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233396228] [2020-02-10 20:38:17,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:38:17,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:38:17,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489462407] [2020-02-10 20:38:17,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:38:17,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:38:17,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:38:17,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:38:17,015 INFO L87 Difference]: Start difference. First operand 3128 states and 15567 transitions. Second operand 12 states. [2020-02-10 20:38:17,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:38:17,204 INFO L93 Difference]: Finished difference Result 6008 states and 26760 transitions. [2020-02-10 20:38:17,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:38:17,205 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:38:17,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:38:17,219 INFO L225 Difference]: With dead ends: 6008 [2020-02-10 20:38:17,219 INFO L226 Difference]: Without dead ends: 5980 [2020-02-10 20:38:17,219 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:38:17,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5980 states. [2020-02-10 20:38:17,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5980 to 3122. [2020-02-10 20:38:17,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-02-10 20:38:17,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15550 transitions. [2020-02-10 20:38:17,402 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15550 transitions. Word has length 31 [2020-02-10 20:38:17,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:38:17,402 INFO L479 AbstractCegarLoop]: Abstraction has 3122 states and 15550 transitions. [2020-02-10 20:38:17,402 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:38:17,402 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15550 transitions. [2020-02-10 20:38:17,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:38:17,407 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:38:17,407 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:38:17,407 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:38:17,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:38:17,407 INFO L82 PathProgramCache]: Analyzing trace with hash -110270982, now seen corresponding path program 587 times [2020-02-10 20:38:17,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:38:17,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060745767] [2020-02-10 20:38:17,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:38:17,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:38:17,927 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:38:18,060 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:38:18,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:38:18,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060745767] [2020-02-10 20:38:18,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:38:18,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:38:18,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390493377] [2020-02-10 20:38:18,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:38:18,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:38:18,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:38:18,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:38:18,070 INFO L87 Difference]: Start difference. First operand 3122 states and 15550 transitions. Second operand 12 states. [2020-02-10 20:38:18,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:38:18,374 INFO L93 Difference]: Finished difference Result 6005 states and 26755 transitions. [2020-02-10 20:38:18,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:38:18,374 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:38:18,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:38:18,389 INFO L225 Difference]: With dead ends: 6005 [2020-02-10 20:38:18,389 INFO L226 Difference]: Without dead ends: 5988 [2020-02-10 20:38:18,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:38:18,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5988 states. [2020-02-10 20:38:18,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5988 to 3129. [2020-02-10 20:38:18,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 20:38:18,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15563 transitions. [2020-02-10 20:38:18,576 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15563 transitions. Word has length 31 [2020-02-10 20:38:18,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:38:18,576 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15563 transitions. [2020-02-10 20:38:18,576 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:38:18,576 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15563 transitions. [2020-02-10 20:38:18,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:38:18,581 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:38:18,581 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:38:18,582 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:38:18,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:38:18,582 INFO L82 PathProgramCache]: Analyzing trace with hash 2072267684, now seen corresponding path program 588 times [2020-02-10 20:38:18,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:38:18,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856824414] [2020-02-10 20:38:18,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:38:18,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:38:19,108 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 35 [2020-02-10 20:38:19,244 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:38:19,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:38:19,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856824414] [2020-02-10 20:38:19,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:38:19,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:38:19,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589948750] [2020-02-10 20:38:19,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:38:19,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:38:19,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:38:19,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:38:19,254 INFO L87 Difference]: Start difference. First operand 3129 states and 15563 transitions. Second operand 12 states. [2020-02-10 20:38:19,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:38:19,474 INFO L93 Difference]: Finished difference Result 6010 states and 26758 transitions. [2020-02-10 20:38:19,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:38:19,474 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:38:19,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:38:19,489 INFO L225 Difference]: With dead ends: 6010 [2020-02-10 20:38:19,490 INFO L226 Difference]: Without dead ends: 5975 [2020-02-10 20:38:19,490 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:38:19,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5975 states. [2020-02-10 20:38:19,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5975 to 3116. [2020-02-10 20:38:19,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3116 states. [2020-02-10 20:38:19,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3116 states to 3116 states and 15533 transitions. [2020-02-10 20:38:19,727 INFO L78 Accepts]: Start accepts. Automaton has 3116 states and 15533 transitions. Word has length 31 [2020-02-10 20:38:19,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:38:19,727 INFO L479 AbstractCegarLoop]: Abstraction has 3116 states and 15533 transitions. [2020-02-10 20:38:19,727 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:38:19,727 INFO L276 IsEmpty]: Start isEmpty. Operand 3116 states and 15533 transitions. [2020-02-10 20:38:19,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:38:19,732 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:38:19,732 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:38:19,732 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:38:19,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:38:19,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1498952476, now seen corresponding path program 589 times [2020-02-10 20:38:19,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:38:19,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914457502] [2020-02-10 20:38:19,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:38:19,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:38:20,263 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:38:20,391 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:38:20,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:38:20,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914457502] [2020-02-10 20:38:20,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:38:20,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:38:20,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800672650] [2020-02-10 20:38:20,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:38:20,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:38:20,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:38:20,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:38:20,402 INFO L87 Difference]: Start difference. First operand 3116 states and 15533 transitions. Second operand 12 states. [2020-02-10 20:38:20,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:38:20,659 INFO L93 Difference]: Finished difference Result 5999 states and 26749 transitions. [2020-02-10 20:38:20,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:38:20,659 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:38:20,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:38:20,674 INFO L225 Difference]: With dead ends: 5999 [2020-02-10 20:38:20,674 INFO L226 Difference]: Without dead ends: 5983 [2020-02-10 20:38:20,674 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:38:20,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5983 states. [2020-02-10 20:38:20,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5983 to 3127. [2020-02-10 20:38:20,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:38:20,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15564 transitions. [2020-02-10 20:38:20,864 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15564 transitions. Word has length 31 [2020-02-10 20:38:20,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:38:20,864 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15564 transitions. [2020-02-10 20:38:20,864 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:38:20,864 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15564 transitions. [2020-02-10 20:38:20,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:38:20,870 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:38:20,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:38:20,870 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:38:20,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:38:20,870 INFO L82 PathProgramCache]: Analyzing trace with hash 261100464, now seen corresponding path program 590 times [2020-02-10 20:38:20,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:38:20,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825856897] [2020-02-10 20:38:20,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:38:20,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:38:21,390 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:38:21,526 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:38:21,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:38:21,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825856897] [2020-02-10 20:38:21,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:38:21,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:38:21,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411459778] [2020-02-10 20:38:21,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:38:21,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:38:21,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:38:21,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:38:21,536 INFO L87 Difference]: Start difference. First operand 3127 states and 15564 transitions. Second operand 12 states. [2020-02-10 20:38:21,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:38:21,843 INFO L93 Difference]: Finished difference Result 6001 states and 26748 transitions. [2020-02-10 20:38:21,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:38:21,844 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:38:21,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:38:21,859 INFO L225 Difference]: With dead ends: 6001 [2020-02-10 20:38:21,859 INFO L226 Difference]: Without dead ends: 5978 [2020-02-10 20:38:21,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:38:21,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5978 states. [2020-02-10 20:38:22,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5978 to 3122. [2020-02-10 20:38:22,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-02-10 20:38:22,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15550 transitions. [2020-02-10 20:38:22,042 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15550 transitions. Word has length 31 [2020-02-10 20:38:22,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:38:22,043 INFO L479 AbstractCegarLoop]: Abstraction has 3122 states and 15550 transitions. [2020-02-10 20:38:22,043 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:38:22,043 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15550 transitions. [2020-02-10 20:38:22,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:38:22,048 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:38:22,048 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:38:22,048 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:38:22,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:38:22,048 INFO L82 PathProgramCache]: Analyzing trace with hash -2135419330, now seen corresponding path program 591 times [2020-02-10 20:38:22,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:38:22,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831222396] [2020-02-10 20:38:22,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:38:22,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:38:22,570 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:38:22,701 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:38:22,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:38:22,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831222396] [2020-02-10 20:38:22,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:38:22,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:38:22,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140745600] [2020-02-10 20:38:22,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:38:22,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:38:22,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:38:22,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:38:22,711 INFO L87 Difference]: Start difference. First operand 3122 states and 15550 transitions. Second operand 12 states. [2020-02-10 20:38:23,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:38:23,019 INFO L93 Difference]: Finished difference Result 6004 states and 26753 transitions. [2020-02-10 20:38:23,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:38:23,019 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:38:23,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:38:23,034 INFO L225 Difference]: With dead ends: 6004 [2020-02-10 20:38:23,034 INFO L226 Difference]: Without dead ends: 5988 [2020-02-10 20:38:23,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:38:23,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5988 states. [2020-02-10 20:38:23,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5988 to 3128. [2020-02-10 20:38:23,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 20:38:23,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15561 transitions. [2020-02-10 20:38:23,217 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15561 transitions. Word has length 31 [2020-02-10 20:38:23,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:38:23,217 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15561 transitions. [2020-02-10 20:38:23,217 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:38:23,218 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15561 transitions. [2020-02-10 20:38:23,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:38:23,223 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:38:23,223 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:38:23,223 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:38:23,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:38:23,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1642823568, now seen corresponding path program 592 times [2020-02-10 20:38:23,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:38:23,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230115271] [2020-02-10 20:38:23,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:38:23,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:38:23,757 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:38:23,890 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:38:23,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:38:23,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230115271] [2020-02-10 20:38:23,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:38:23,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:38:23,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598991018] [2020-02-10 20:38:23,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:38:23,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:38:23,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:38:23,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:38:23,900 INFO L87 Difference]: Start difference. First operand 3128 states and 15561 transitions. Second operand 12 states. [2020-02-10 20:38:24,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:38:24,101 INFO L93 Difference]: Finished difference Result 6010 states and 26759 transitions. [2020-02-10 20:38:24,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:38:24,102 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:38:24,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:38:24,116 INFO L225 Difference]: With dead ends: 6010 [2020-02-10 20:38:24,116 INFO L226 Difference]: Without dead ends: 5982 [2020-02-10 20:38:24,116 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:38:24,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5982 states. [2020-02-10 20:38:24,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5982 to 3122. [2020-02-10 20:38:24,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2020-02-10 20:38:24,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 15544 transitions. [2020-02-10 20:38:24,299 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 15544 transitions. Word has length 31 [2020-02-10 20:38:24,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:38:24,299 INFO L479 AbstractCegarLoop]: Abstraction has 3122 states and 15544 transitions. [2020-02-10 20:38:24,299 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:38:24,299 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 15544 transitions. [2020-02-10 20:38:24,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:38:24,304 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:38:24,304 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:38:24,304 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:38:24,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:38:24,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1648300098, now seen corresponding path program 593 times [2020-02-10 20:38:24,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:38:24,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971839835] [2020-02-10 20:38:24,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:38:24,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:38:24,833 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:38:24,966 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:38:24,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:38:24,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971839835] [2020-02-10 20:38:24,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:38:24,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:38:24,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710206437] [2020-02-10 20:38:24,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:38:24,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:38:24,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:38:24,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:38:24,976 INFO L87 Difference]: Start difference. First operand 3122 states and 15544 transitions. Second operand 12 states. [2020-02-10 20:38:25,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:38:25,219 INFO L93 Difference]: Finished difference Result 6010 states and 26761 transitions. [2020-02-10 20:38:25,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:38:25,220 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:38:25,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:38:25,234 INFO L225 Difference]: With dead ends: 6010 [2020-02-10 20:38:25,234 INFO L226 Difference]: Without dead ends: 5992 [2020-02-10 20:38:25,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 20:38:25,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5992 states. [2020-02-10 20:38:25,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5992 to 3130. [2020-02-10 20:38:25,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 20:38:25,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15559 transitions. [2020-02-10 20:38:25,417 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15559 transitions. Word has length 31 [2020-02-10 20:38:25,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:38:25,417 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15559 transitions. [2020-02-10 20:38:25,417 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:38:25,417 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15559 transitions. [2020-02-10 20:38:25,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:38:25,422 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:38:25,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:38:25,422 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:38:25,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:38:25,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1379210020, now seen corresponding path program 594 times [2020-02-10 20:38:25,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:38:25,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124189535] [2020-02-10 20:38:25,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:38:25,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:38:25,963 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:38:26,093 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:38:26,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:38:26,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124189535] [2020-02-10 20:38:26,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:38:26,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:38:26,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739355483] [2020-02-10 20:38:26,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:38:26,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:38:26,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:38:26,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:38:26,102 INFO L87 Difference]: Start difference. First operand 3130 states and 15559 transitions. Second operand 12 states. [2020-02-10 20:38:26,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:38:26,302 INFO L93 Difference]: Finished difference Result 6014 states and 26761 transitions. [2020-02-10 20:38:26,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:38:26,302 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:38:26,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:38:26,317 INFO L225 Difference]: With dead ends: 6014 [2020-02-10 20:38:26,317 INFO L226 Difference]: Without dead ends: 5978 [2020-02-10 20:38:26,317 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:38:26,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5978 states. [2020-02-10 20:38:26,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5978 to 3116. [2020-02-10 20:38:26,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3116 states. [2020-02-10 20:38:26,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3116 states to 3116 states and 15527 transitions. [2020-02-10 20:38:26,505 INFO L78 Accepts]: Start accepts. Automaton has 3116 states and 15527 transitions. Word has length 31 [2020-02-10 20:38:26,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:38:26,505 INFO L479 AbstractCegarLoop]: Abstraction has 3116 states and 15527 transitions. [2020-02-10 20:38:26,505 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:38:26,505 INFO L276 IsEmpty]: Start isEmpty. Operand 3116 states and 15527 transitions. [2020-02-10 20:38:26,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:38:26,512 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:38:26,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:38:26,512 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:38:26,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:38:26,513 INFO L82 PathProgramCache]: Analyzing trace with hash -280043412, now seen corresponding path program 595 times [2020-02-10 20:38:26,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:38:26,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300579431] [2020-02-10 20:38:26,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:38:26,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:38:27,063 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:38:27,196 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:38:27,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:38:27,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300579431] [2020-02-10 20:38:27,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:38:27,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:38:27,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568370898] [2020-02-10 20:38:27,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:38:27,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:38:27,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:38:27,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:38:27,206 INFO L87 Difference]: Start difference. First operand 3116 states and 15527 transitions. Second operand 12 states. [2020-02-10 20:38:27,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:38:27,448 INFO L93 Difference]: Finished difference Result 6006 states and 26762 transitions. [2020-02-10 20:38:27,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:38:27,448 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:38:27,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:38:27,462 INFO L225 Difference]: With dead ends: 6006 [2020-02-10 20:38:27,462 INFO L226 Difference]: Without dead ends: 5989 [2020-02-10 20:38:27,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:38:27,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5989 states. [2020-02-10 20:38:27,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5989 to 3129. [2020-02-10 20:38:27,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2020-02-10 20:38:27,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 15564 transitions. [2020-02-10 20:38:27,650 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 15564 transitions. Word has length 31 [2020-02-10 20:38:27,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:38:27,650 INFO L479 AbstractCegarLoop]: Abstraction has 3129 states and 15564 transitions. [2020-02-10 20:38:27,650 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:38:27,650 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 15564 transitions. [2020-02-10 20:38:27,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:38:27,655 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:38:27,655 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:38:27,655 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:38:27,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:38:27,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1125014864, now seen corresponding path program 596 times [2020-02-10 20:38:27,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:38:27,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803115730] [2020-02-10 20:38:27,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:38:27,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:38:28,024 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 25 [2020-02-10 20:38:28,251 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:38:28,381 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:38:28,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:38:28,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803115730] [2020-02-10 20:38:28,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:38:28,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:38:28,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964261639] [2020-02-10 20:38:28,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:38:28,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:38:28,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:38:28,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:38:28,393 INFO L87 Difference]: Start difference. First operand 3129 states and 15564 transitions. Second operand 12 states. [2020-02-10 20:38:28,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:38:28,619 INFO L93 Difference]: Finished difference Result 6007 states and 26758 transitions. [2020-02-10 20:38:28,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:38:28,619 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:38:28,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:38:28,634 INFO L225 Difference]: With dead ends: 6007 [2020-02-10 20:38:28,635 INFO L226 Difference]: Without dead ends: 5983 [2020-02-10 20:38:28,635 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:38:28,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5983 states. [2020-02-10 20:38:28,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5983 to 3123. [2020-02-10 20:38:28,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3123 states. [2020-02-10 20:38:28,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 15547 transitions. [2020-02-10 20:38:28,822 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 15547 transitions. Word has length 31 [2020-02-10 20:38:28,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:38:28,822 INFO L479 AbstractCegarLoop]: Abstraction has 3123 states and 15547 transitions. [2020-02-10 20:38:28,822 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:38:28,822 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 15547 transitions. [2020-02-10 20:38:28,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:38:28,828 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:38:28,828 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:38:28,828 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:38:28,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:38:28,828 INFO L82 PathProgramCache]: Analyzing trace with hash -916510266, now seen corresponding path program 597 times [2020-02-10 20:38:28,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:38:28,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969205904] [2020-02-10 20:38:28,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:38:28,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:38:29,353 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:38:29,486 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:38:29,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:38:29,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969205904] [2020-02-10 20:38:29,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:38:29,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:38:29,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847977319] [2020-02-10 20:38:29,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:38:29,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:38:29,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:38:29,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:38:29,497 INFO L87 Difference]: Start difference. First operand 3123 states and 15547 transitions. Second operand 12 states. [2020-02-10 20:38:29,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:38:29,761 INFO L93 Difference]: Finished difference Result 6011 states and 26765 transitions. [2020-02-10 20:38:29,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:38:29,761 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:38:29,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:38:29,776 INFO L225 Difference]: With dead ends: 6011 [2020-02-10 20:38:29,777 INFO L226 Difference]: Without dead ends: 5994 [2020-02-10 20:38:29,777 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:38:29,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5994 states. [2020-02-10 20:38:29,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5994 to 3130. [2020-02-10 20:38:29,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3130 states. [2020-02-10 20:38:29,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 15560 transitions. [2020-02-10 20:38:29,963 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 15560 transitions. Word has length 31 [2020-02-10 20:38:29,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:38:29,963 INFO L479 AbstractCegarLoop]: Abstraction has 3130 states and 15560 transitions. [2020-02-10 20:38:29,963 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:38:29,963 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 15560 transitions. [2020-02-10 20:38:29,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:38:29,968 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:38:29,968 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:38:29,968 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:38:29,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:38:29,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1266028400, now seen corresponding path program 598 times [2020-02-10 20:38:29,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:38:29,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545296164] [2020-02-10 20:38:29,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:38:29,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:38:30,503 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 35 [2020-02-10 20:38:30,636 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:38:30,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:38:30,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545296164] [2020-02-10 20:38:30,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:38:30,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:38:30,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561606717] [2020-02-10 20:38:30,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:38:30,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:38:30,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:38:30,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:38:30,645 INFO L87 Difference]: Start difference. First operand 3130 states and 15560 transitions. Second operand 12 states. [2020-02-10 20:38:30,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:38:30,900 INFO L93 Difference]: Finished difference Result 6016 states and 26768 transitions. [2020-02-10 20:38:30,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:38:30,900 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:38:30,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:38:30,914 INFO L225 Difference]: With dead ends: 6016 [2020-02-10 20:38:30,914 INFO L226 Difference]: Without dead ends: 5987 [2020-02-10 20:38:30,915 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:38:31,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5987 states. [2020-02-10 20:38:31,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5987 to 3123. [2020-02-10 20:38:31,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3123 states. [2020-02-10 20:38:31,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 15540 transitions. [2020-02-10 20:38:31,097 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 15540 transitions. Word has length 31 [2020-02-10 20:38:31,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:38:31,097 INFO L479 AbstractCegarLoop]: Abstraction has 3123 states and 15540 transitions. [2020-02-10 20:38:31,097 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:38:31,097 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 15540 transitions. [2020-02-10 20:38:31,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:38:31,102 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:38:31,102 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:38:31,102 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:38:31,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:38:31,102 INFO L82 PathProgramCache]: Analyzing trace with hash 2109174342, now seen corresponding path program 599 times [2020-02-10 20:38:31,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:38:31,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74229848] [2020-02-10 20:38:31,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:38:31,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:38:31,631 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:38:31,764 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:38:31,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:38:31,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74229848] [2020-02-10 20:38:31,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:38:31,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:38:31,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663814575] [2020-02-10 20:38:31,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:38:31,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:38:31,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:38:31,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:38:31,773 INFO L87 Difference]: Start difference. First operand 3123 states and 15540 transitions. Second operand 12 states. [2020-02-10 20:38:32,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:38:32,070 INFO L93 Difference]: Finished difference Result 6014 states and 26765 transitions. [2020-02-10 20:38:32,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:38:32,071 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:38:32,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:38:32,085 INFO L225 Difference]: With dead ends: 6014 [2020-02-10 20:38:32,086 INFO L226 Difference]: Without dead ends: 5996 [2020-02-10 20:38:32,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:38:32,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5996 states. [2020-02-10 20:38:32,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5996 to 3131. [2020-02-10 20:38:32,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3131 states. [2020-02-10 20:38:32,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 15555 transitions. [2020-02-10 20:38:32,268 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 15555 transitions. Word has length 31 [2020-02-10 20:38:32,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:38:32,268 INFO L479 AbstractCegarLoop]: Abstraction has 3131 states and 15555 transitions. [2020-02-10 20:38:32,268 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:38:32,268 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 15555 transitions. [2020-02-10 20:38:32,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:38:32,273 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:38:32,273 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:38:32,273 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:38:32,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:38:32,274 INFO L82 PathProgramCache]: Analyzing trace with hash 841717164, now seen corresponding path program 600 times [2020-02-10 20:38:32,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:38:32,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76448808] [2020-02-10 20:38:32,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:38:32,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:38:32,820 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 35 [2020-02-10 20:38:32,952 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:38:32,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:38:32,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76448808] [2020-02-10 20:38:32,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:38:32,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:38:32,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924769464] [2020-02-10 20:38:32,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:38:32,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:38:32,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:38:32,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:38:32,963 INFO L87 Difference]: Start difference. First operand 3131 states and 15555 transitions. Second operand 12 states. [2020-02-10 20:38:33,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:38:33,216 INFO L93 Difference]: Finished difference Result 6018 states and 26765 transitions. [2020-02-10 20:38:33,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:38:33,217 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:38:33,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:38:33,231 INFO L225 Difference]: With dead ends: 6018 [2020-02-10 20:38:33,231 INFO L226 Difference]: Without dead ends: 5969 [2020-02-10 20:38:33,232 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:38:33,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5969 states. [2020-02-10 20:38:33,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5969 to 3104. [2020-02-10 20:38:33,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3104 states. [2020-02-10 20:38:33,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3104 states to 3104 states and 15499 transitions. [2020-02-10 20:38:33,414 INFO L78 Accepts]: Start accepts. Automaton has 3104 states and 15499 transitions. Word has length 31 [2020-02-10 20:38:33,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:38:33,414 INFO L479 AbstractCegarLoop]: Abstraction has 3104 states and 15499 transitions. [2020-02-10 20:38:33,414 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:38:33,414 INFO L276 IsEmpty]: Start isEmpty. Operand 3104 states and 15499 transitions. [2020-02-10 20:38:33,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:38:33,419 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:38:33,419 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:38:33,419 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:38:33,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:38:33,419 INFO L82 PathProgramCache]: Analyzing trace with hash 949809614, now seen corresponding path program 601 times [2020-02-10 20:38:33,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:38:33,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547843276] [2020-02-10 20:38:33,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:38:33,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:38:33,945 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:38:34,075 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:38:34,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:38:34,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547843276] [2020-02-10 20:38:34,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:38:34,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:38:34,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457628583] [2020-02-10 20:38:34,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:38:34,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:38:34,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:38:34,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:38:34,086 INFO L87 Difference]: Start difference. First operand 3104 states and 15499 transitions. Second operand 12 states. [2020-02-10 20:38:34,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:38:34,372 INFO L93 Difference]: Finished difference Result 5995 states and 26769 transitions. [2020-02-10 20:38:34,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:38:34,373 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:38:34,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:38:34,388 INFO L225 Difference]: With dead ends: 5995 [2020-02-10 20:38:34,388 INFO L226 Difference]: Without dead ends: 5979 [2020-02-10 20:38:34,388 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:38:34,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5979 states. [2020-02-10 20:38:34,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5979 to 3126. [2020-02-10 20:38:34,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 20:38:34,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15589 transitions. [2020-02-10 20:38:34,579 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15589 transitions. Word has length 31 [2020-02-10 20:38:34,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:38:34,580 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15589 transitions. [2020-02-10 20:38:34,580 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:38:34,580 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15589 transitions. [2020-02-10 20:38:34,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:38:34,585 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:38:34,585 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:38:34,586 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:38:34,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:38:34,586 INFO L82 PathProgramCache]: Analyzing trace with hash 104838162, now seen corresponding path program 602 times [2020-02-10 20:38:34,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:38:34,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188996786] [2020-02-10 20:38:34,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:38:34,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:38:35,122 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:38:35,250 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 20:38:35,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:38:35,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188996786] [2020-02-10 20:38:35,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:38:35,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:38:35,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263895206] [2020-02-10 20:38:35,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:38:35,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:38:35,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:38:35,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:38:35,260 INFO L87 Difference]: Start difference. First operand 3126 states and 15589 transitions. Second operand 12 states. [2020-02-10 20:38:35,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:38:35,483 INFO L93 Difference]: Finished difference Result 5999 states and 26772 transitions. [2020-02-10 20:38:35,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:38:35,483 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:38:35,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:38:35,497 INFO L225 Difference]: With dead ends: 5999 [2020-02-10 20:38:35,497 INFO L226 Difference]: Without dead ends: 5974 [2020-02-10 20:38:35,497 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:38:35,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5974 states. [2020-02-10 20:38:35,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5974 to 3121. [2020-02-10 20:38:35,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 20:38:35,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15575 transitions. [2020-02-10 20:38:35,681 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15575 transitions. Word has length 31 [2020-02-10 20:38:35,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:38:35,681 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15575 transitions. [2020-02-10 20:38:35,681 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:38:35,681 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15575 transitions. [2020-02-10 20:38:35,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:38:35,686 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:38:35,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:38:35,686 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:38:35,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:38:35,686 INFO L82 PathProgramCache]: Analyzing trace with hash 525498378, now seen corresponding path program 603 times [2020-02-10 20:38:35,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:38:35,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7513127] [2020-02-10 20:38:35,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:38:35,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:38:36,233 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:38:36,360 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:38:36,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:38:36,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7513127] [2020-02-10 20:38:36,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:38:36,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:38:36,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090246182] [2020-02-10 20:38:36,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:38:36,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:38:36,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:38:36,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:38:36,370 INFO L87 Difference]: Start difference. First operand 3121 states and 15575 transitions. Second operand 12 states. [2020-02-10 20:38:36,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:38:36,633 INFO L93 Difference]: Finished difference Result 5992 states and 26758 transitions. [2020-02-10 20:38:36,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:38:36,634 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:38:36,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:38:36,649 INFO L225 Difference]: With dead ends: 5992 [2020-02-10 20:38:36,649 INFO L226 Difference]: Without dead ends: 5976 [2020-02-10 20:38:36,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:38:36,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5976 states. [2020-02-10 20:38:36,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5976 to 3126. [2020-02-10 20:38:36,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 20:38:36,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15584 transitions. [2020-02-10 20:38:36,832 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15584 transitions. Word has length 31 [2020-02-10 20:38:36,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:38:36,832 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15584 transitions. [2020-02-10 20:38:36,832 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:38:36,832 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15584 transitions. [2020-02-10 20:38:36,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:38:36,837 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:38:36,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:38:36,837 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:38:36,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:38:36,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1164444526, now seen corresponding path program 604 times [2020-02-10 20:38:36,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:38:36,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97358394] [2020-02-10 20:38:36,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:38:36,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:38:37,363 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:38:37,495 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:38:37,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:38:37,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97358394] [2020-02-10 20:38:37,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:38:37,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:38:37,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603486833] [2020-02-10 20:38:37,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:38:37,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:38:37,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:38:37,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:38:37,506 INFO L87 Difference]: Start difference. First operand 3126 states and 15584 transitions. Second operand 12 states. [2020-02-10 20:38:37,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:38:37,749 INFO L93 Difference]: Finished difference Result 5993 states and 26755 transitions. [2020-02-10 20:38:37,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:38:37,749 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:38:37,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:38:37,764 INFO L225 Difference]: With dead ends: 5993 [2020-02-10 20:38:37,765 INFO L226 Difference]: Without dead ends: 5971 [2020-02-10 20:38:37,765 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:38:37,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5971 states. [2020-02-10 20:38:37,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5971 to 3121. [2020-02-10 20:38:37,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 20:38:37,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15570 transitions. [2020-02-10 20:38:37,951 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15570 transitions. Word has length 31 [2020-02-10 20:38:37,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:38:37,951 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15570 transitions. [2020-02-10 20:38:37,951 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:38:37,951 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15570 transitions. [2020-02-10 20:38:37,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:38:37,956 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:38:37,956 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:38:37,956 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:38:37,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:38:37,956 INFO L82 PathProgramCache]: Analyzing trace with hash -743784310, now seen corresponding path program 605 times [2020-02-10 20:38:37,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:38:37,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745815659] [2020-02-10 20:38:37,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:38:37,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:38:38,482 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:38:38,613 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:38:38,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:38:38,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745815659] [2020-02-10 20:38:38,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:38:38,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:38:38,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848205847] [2020-02-10 20:38:38,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:38:38,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:38:38,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:38:38,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:38:38,623 INFO L87 Difference]: Start difference. First operand 3121 states and 15570 transitions. Second operand 12 states. [2020-02-10 20:38:38,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:38:38,901 INFO L93 Difference]: Finished difference Result 6001 states and 26772 transitions. [2020-02-10 20:38:38,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:38:38,901 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:38:38,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:38:38,916 INFO L225 Difference]: With dead ends: 6001 [2020-02-10 20:38:38,916 INFO L226 Difference]: Without dead ends: 5981 [2020-02-10 20:38:38,916 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:38:39,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5981 states. [2020-02-10 20:38:39,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5981 to 3127. [2020-02-10 20:38:39,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2020-02-10 20:38:39,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 15581 transitions. [2020-02-10 20:38:39,099 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 15581 transitions. Word has length 31 [2020-02-10 20:38:39,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:38:39,099 INFO L479 AbstractCegarLoop]: Abstraction has 3127 states and 15581 transitions. [2020-02-10 20:38:39,099 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:38:39,099 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 15581 transitions. [2020-02-10 20:38:39,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:38:39,104 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:38:39,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:38:39,104 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:38:39,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:38:39,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1588755762, now seen corresponding path program 606 times [2020-02-10 20:38:39,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:38:39,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950294307] [2020-02-10 20:38:39,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:38:39,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:38:39,756 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:38:39,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:38:39,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950294307] [2020-02-10 20:38:39,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:38:39,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:38:39,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808123969] [2020-02-10 20:38:39,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:38:39,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:38:39,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:38:39,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:38:39,765 INFO L87 Difference]: Start difference. First operand 3127 states and 15581 transitions. Second operand 12 states. [2020-02-10 20:38:40,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:38:40,065 INFO L93 Difference]: Finished difference Result 5998 states and 26760 transitions. [2020-02-10 20:38:40,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:38:40,066 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:38:40,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:38:40,081 INFO L225 Difference]: With dead ends: 5998 [2020-02-10 20:38:40,081 INFO L226 Difference]: Without dead ends: 5970 [2020-02-10 20:38:40,081 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:38:40,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5970 states. [2020-02-10 20:38:40,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5970 to 3116. [2020-02-10 20:38:40,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3116 states. [2020-02-10 20:38:40,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3116 states to 3116 states and 15556 transitions. [2020-02-10 20:38:40,265 INFO L78 Accepts]: Start accepts. Automaton has 3116 states and 15556 transitions. Word has length 31 [2020-02-10 20:38:40,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:38:40,266 INFO L479 AbstractCegarLoop]: Abstraction has 3116 states and 15556 transitions. [2020-02-10 20:38:40,266 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:38:40,266 INFO L276 IsEmpty]: Start isEmpty. Operand 3116 states and 15556 transitions. [2020-02-10 20:38:40,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:38:40,271 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:38:40,271 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:38:40,271 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:38:40,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:38:40,271 INFO L82 PathProgramCache]: Analyzing trace with hash 681063186, now seen corresponding path program 607 times [2020-02-10 20:38:40,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:38:40,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407475747] [2020-02-10 20:38:40,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:38:40,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:38:40,801 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:38:40,936 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:38:40,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:38:40,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407475747] [2020-02-10 20:38:40,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:38:40,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:38:40,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662449473] [2020-02-10 20:38:40,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:38:40,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:38:40,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:38:40,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:38:40,945 INFO L87 Difference]: Start difference. First operand 3116 states and 15556 transitions. Second operand 12 states. [2020-02-10 20:38:41,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:38:41,243 INFO L93 Difference]: Finished difference Result 5997 states and 26769 transitions. [2020-02-10 20:38:41,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:38:41,243 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:38:41,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:38:41,258 INFO L225 Difference]: With dead ends: 5997 [2020-02-10 20:38:41,258 INFO L226 Difference]: Without dead ends: 5981 [2020-02-10 20:38:41,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:38:41,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5981 states. [2020-02-10 20:38:41,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5981 to 3126. [2020-02-10 20:38:41,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 20:38:41,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15584 transitions. [2020-02-10 20:38:41,440 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15584 transitions. Word has length 31 [2020-02-10 20:38:41,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:38:41,440 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15584 transitions. [2020-02-10 20:38:41,440 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:38:41,440 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15584 transitions. [2020-02-10 20:38:41,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:38:41,445 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:38:41,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:38:41,445 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:38:41,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:38:41,445 INFO L82 PathProgramCache]: Analyzing trace with hash -163908266, now seen corresponding path program 608 times [2020-02-10 20:38:41,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:38:41,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320043416] [2020-02-10 20:38:41,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:38:41,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:38:41,961 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:38:42,092 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:38:42,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:38:42,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320043416] [2020-02-10 20:38:42,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:38:42,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:38:42,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823396723] [2020-02-10 20:38:42,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:38:42,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:38:42,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:38:42,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:38:42,102 INFO L87 Difference]: Start difference. First operand 3126 states and 15584 transitions. Second operand 12 states. [2020-02-10 20:38:42,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:38:42,365 INFO L93 Difference]: Finished difference Result 6001 states and 26772 transitions. [2020-02-10 20:38:42,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:38:42,365 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:38:42,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:38:42,380 INFO L225 Difference]: With dead ends: 6001 [2020-02-10 20:38:42,380 INFO L226 Difference]: Without dead ends: 5976 [2020-02-10 20:38:42,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:38:42,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5976 states. [2020-02-10 20:38:42,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5976 to 3121. [2020-02-10 20:38:42,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 20:38:42,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15570 transitions. [2020-02-10 20:38:42,567 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15570 transitions. Word has length 31 [2020-02-10 20:38:42,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:38:42,567 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15570 transitions. [2020-02-10 20:38:42,567 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:38:42,567 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15570 transitions. [2020-02-10 20:38:42,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:38:42,572 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:38:42,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:38:42,572 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:38:42,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:38:42,572 INFO L82 PathProgramCache]: Analyzing trace with hash -167559286, now seen corresponding path program 609 times [2020-02-10 20:38:42,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:38:42,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137972189] [2020-02-10 20:38:42,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:38:42,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:38:43,112 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:38:43,244 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:38:43,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:38:43,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137972189] [2020-02-10 20:38:43,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:38:43,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:38:43,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872953451] [2020-02-10 20:38:43,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:38:43,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:38:43,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:38:43,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:38:43,253 INFO L87 Difference]: Start difference. First operand 3121 states and 15570 transitions. Second operand 12 states. [2020-02-10 20:38:43,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:38:43,536 INFO L93 Difference]: Finished difference Result 5995 states and 26760 transitions. [2020-02-10 20:38:43,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:38:43,537 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:38:43,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:38:43,552 INFO L225 Difference]: With dead ends: 5995 [2020-02-10 20:38:43,552 INFO L226 Difference]: Without dead ends: 5979 [2020-02-10 20:38:43,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:38:43,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5979 states. [2020-02-10 20:38:43,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5979 to 3126. [2020-02-10 20:38:43,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 20:38:43,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15579 transitions. [2020-02-10 20:38:43,738 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15579 transitions. Word has length 31 [2020-02-10 20:38:43,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:38:43,738 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15579 transitions. [2020-02-10 20:38:43,738 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:38:43,738 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15579 transitions. [2020-02-10 20:38:43,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:38:43,743 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:38:43,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:38:43,743 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:38:43,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:38:43,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1592493654, now seen corresponding path program 610 times [2020-02-10 20:38:43,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:38:43,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127478293] [2020-02-10 20:38:43,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:38:43,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:38:44,280 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:38:44,415 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:38:44,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:38:44,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127478293] [2020-02-10 20:38:44,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:38:44,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:38:44,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811007245] [2020-02-10 20:38:44,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:38:44,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:38:44,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:38:44,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:38:44,424 INFO L87 Difference]: Start difference. First operand 3126 states and 15579 transitions. Second operand 12 states. [2020-02-10 20:38:44,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:38:44,777 INFO L93 Difference]: Finished difference Result 5997 states and 26759 transitions. [2020-02-10 20:38:44,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:38:44,777 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:38:44,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:38:44,839 INFO L225 Difference]: With dead ends: 5997 [2020-02-10 20:38:44,839 INFO L226 Difference]: Without dead ends: 5974 [2020-02-10 20:38:44,840 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:38:44,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5974 states. [2020-02-10 20:38:45,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5974 to 3121. [2020-02-10 20:38:45,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 20:38:45,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15565 transitions. [2020-02-10 20:38:45,023 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15565 transitions. Word has length 31 [2020-02-10 20:38:45,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:38:45,024 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15565 transitions. [2020-02-10 20:38:45,024 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:38:45,024 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15565 transitions. [2020-02-10 20:38:45,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:38:45,029 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:38:45,029 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:38:45,029 INFO L427 AbstractCegarLoop]: === Iteration 620 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:38:45,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:38:45,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1436841974, now seen corresponding path program 611 times [2020-02-10 20:38:45,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:38:45,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034396128] [2020-02-10 20:38:45,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:38:45,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:38:45,563 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:38:45,694 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:38:45,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:38:45,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034396128] [2020-02-10 20:38:45,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:38:45,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:38:45,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350161551] [2020-02-10 20:38:45,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:38:45,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:38:45,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:38:45,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:38:45,704 INFO L87 Difference]: Start difference. First operand 3121 states and 15565 transitions. Second operand 12 states. [2020-02-10 20:38:46,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:38:46,059 INFO L93 Difference]: Finished difference Result 6005 states and 26777 transitions. [2020-02-10 20:38:46,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:38:46,060 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:38:46,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:38:46,075 INFO L225 Difference]: With dead ends: 6005 [2020-02-10 20:38:46,075 INFO L226 Difference]: Without dead ends: 5985 [2020-02-10 20:38:46,075 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:38:46,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5985 states. [2020-02-10 20:38:46,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5985 to 3128. [2020-02-10 20:38:46,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3128 states. [2020-02-10 20:38:46,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3128 states to 3128 states and 15578 transitions. [2020-02-10 20:38:46,261 INFO L78 Accepts]: Start accepts. Automaton has 3128 states and 15578 transitions. Word has length 31 [2020-02-10 20:38:46,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:38:46,262 INFO L479 AbstractCegarLoop]: Abstraction has 3128 states and 15578 transitions. [2020-02-10 20:38:46,262 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:38:46,262 INFO L276 IsEmpty]: Start isEmpty. Operand 3128 states and 15578 transitions. [2020-02-10 20:38:46,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:38:46,267 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:38:46,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:38:46,267 INFO L427 AbstractCegarLoop]: === Iteration 621 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:38:46,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:38:46,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1168182418, now seen corresponding path program 612 times [2020-02-10 20:38:46,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:38:46,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559946253] [2020-02-10 20:38:46,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:38:46,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:38:46,790 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:38:46,930 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 34 [2020-02-10 20:38:46,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:38:46,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559946253] [2020-02-10 20:38:46,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:38:46,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:38:46,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571650691] [2020-02-10 20:38:46,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:38:46,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:38:46,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:38:46,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:38:46,940 INFO L87 Difference]: Start difference. First operand 3128 states and 15578 transitions. Second operand 12 states. [2020-02-10 20:38:47,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:38:47,292 INFO L93 Difference]: Finished difference Result 6003 states and 26766 transitions. [2020-02-10 20:38:47,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:38:47,293 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:38:47,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:38:47,307 INFO L225 Difference]: With dead ends: 6003 [2020-02-10 20:38:47,307 INFO L226 Difference]: Without dead ends: 5973 [2020-02-10 20:38:47,308 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2020-02-10 20:38:47,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5973 states. [2020-02-10 20:38:47,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5973 to 3116. [2020-02-10 20:38:47,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3116 states. [2020-02-10 20:38:47,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3116 states to 3116 states and 15551 transitions. [2020-02-10 20:38:47,490 INFO L78 Accepts]: Start accepts. Automaton has 3116 states and 15551 transitions. Word has length 31 [2020-02-10 20:38:47,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:38:47,490 INFO L479 AbstractCegarLoop]: Abstraction has 3116 states and 15551 transitions. [2020-02-10 20:38:47,490 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:38:47,490 INFO L276 IsEmpty]: Start isEmpty. Operand 3116 states and 15551 transitions. [2020-02-10 20:38:47,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:38:47,495 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:38:47,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:38:47,495 INFO L427 AbstractCegarLoop]: === Iteration 622 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:38:47,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:38:47,495 INFO L82 PathProgramCache]: Analyzing trace with hash -11994478, now seen corresponding path program 613 times [2020-02-10 20:38:47,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:38:47,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883223118] [2020-02-10 20:38:47,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:38:47,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:38:48,038 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:38:48,167 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2020-02-10 20:38:48,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:38:48,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883223118] [2020-02-10 20:38:48,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:38:48,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:38:48,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651386749] [2020-02-10 20:38:48,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:38:48,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:38:48,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:38:48,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:38:48,177 INFO L87 Difference]: Start difference. First operand 3116 states and 15551 transitions. Second operand 12 states. [2020-02-10 20:38:48,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:38:48,407 INFO L93 Difference]: Finished difference Result 5990 states and 26749 transitions. [2020-02-10 20:38:48,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:38:48,407 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:38:48,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:38:48,421 INFO L225 Difference]: With dead ends: 5990 [2020-02-10 20:38:48,422 INFO L226 Difference]: Without dead ends: 5974 [2020-02-10 20:38:48,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:38:48,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5974 states. [2020-02-10 20:38:48,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5974 to 3126. [2020-02-10 20:38:48,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 20:38:48,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15579 transitions. [2020-02-10 20:38:48,607 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15579 transitions. Word has length 31 [2020-02-10 20:38:48,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:38:48,608 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15579 transitions. [2020-02-10 20:38:48,608 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:38:48,608 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15579 transitions. [2020-02-10 20:38:48,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:38:48,613 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:38:48,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:38:48,613 INFO L427 AbstractCegarLoop]: === Iteration 623 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:38:48,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:38:48,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1701937382, now seen corresponding path program 614 times [2020-02-10 20:38:48,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:38:48,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667481909] [2020-02-10 20:38:48,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:38:48,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:38:49,153 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:38:49,287 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:38:49,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:38:49,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667481909] [2020-02-10 20:38:49,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:38:49,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:38:49,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798583063] [2020-02-10 20:38:49,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:38:49,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:38:49,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:38:49,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:38:49,296 INFO L87 Difference]: Start difference. First operand 3126 states and 15579 transitions. Second operand 12 states. [2020-02-10 20:38:49,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:38:49,522 INFO L93 Difference]: Finished difference Result 5991 states and 26746 transitions. [2020-02-10 20:38:49,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:38:49,522 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:38:49,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:38:49,536 INFO L225 Difference]: With dead ends: 5991 [2020-02-10 20:38:49,536 INFO L226 Difference]: Without dead ends: 5969 [2020-02-10 20:38:49,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:38:49,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5969 states. [2020-02-10 20:38:49,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5969 to 3121. [2020-02-10 20:38:49,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2020-02-10 20:38:49,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 15565 transitions. [2020-02-10 20:38:49,722 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 15565 transitions. Word has length 31 [2020-02-10 20:38:49,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:38:49,723 INFO L479 AbstractCegarLoop]: Abstraction has 3121 states and 15565 transitions. [2020-02-10 20:38:49,723 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:38:49,723 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 15565 transitions. [2020-02-10 20:38:49,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:38:49,728 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:38:49,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:38:49,728 INFO L427 AbstractCegarLoop]: === Iteration 624 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:38:49,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:38:49,728 INFO L82 PathProgramCache]: Analyzing trace with hash -436305714, now seen corresponding path program 615 times [2020-02-10 20:38:49,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:38:49,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761775048] [2020-02-10 20:38:49,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:38:49,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:38:50,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:38:50,393 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:38:50,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:38:50,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761775048] [2020-02-10 20:38:50,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:38:50,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-02-10 20:38:50,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490494184] [2020-02-10 20:38:50,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-02-10 20:38:50,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:38:50,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-02-10 20:38:50,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2020-02-10 20:38:50,404 INFO L87 Difference]: Start difference. First operand 3121 states and 15565 transitions. Second operand 12 states. [2020-02-10 20:38:50,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:38:50,611 INFO L93 Difference]: Finished difference Result 5991 states and 26746 transitions. [2020-02-10 20:38:50,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-02-10 20:38:50,611 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-02-10 20:38:50,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:38:50,626 INFO L225 Difference]: With dead ends: 5991 [2020-02-10 20:38:50,626 INFO L226 Difference]: Without dead ends: 5975 [2020-02-10 20:38:50,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:38:50,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5975 states. [2020-02-10 20:38:50,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5975 to 3126. [2020-02-10 20:38:50,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2020-02-10 20:38:50,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 15574 transitions. [2020-02-10 20:38:50,809 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 15574 transitions. Word has length 31 [2020-02-10 20:38:50,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:38:50,809 INFO L479 AbstractCegarLoop]: Abstraction has 3126 states and 15574 transitions. [2020-02-10 20:38:50,809 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-02-10 20:38:50,809 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 15574 transitions. [2020-02-10 20:38:50,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-02-10 20:38:50,814 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:38:50,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:38:50,814 INFO L427 AbstractCegarLoop]: === Iteration 625 === [ULTIMATE.startErr9INUSE_VIOLATION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:38:50,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:38:50,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1323747226, now seen corresponding path program 616 times [2020-02-10 20:38:50,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:38:50,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606032737] [2020-02-10 20:38:50,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:38:50,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2020-02-10 20:38:51,215 WARN L209 SmtUtils]: Removed 8 from assertion stack [2020-02-10 20:38:51,215 WARN L544 AbstractCegarLoop]: Verification canceled [2020-02-10 20:38:51,218 WARN L227 ceAbstractionStarter]: Timeout [2020-02-10 20:38:51,218 INFO L202 PluginConnector]: Adding new model example_10.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.02 08:38:51 BasicIcfg [2020-02-10 20:38:51,218 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-02-10 20:38:51,219 INFO L168 Benchmark]: Toolchain (without parser) took 772524.52 ms. Allocated memory was 143.7 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 118.7 MB in the beginning and 829.4 MB in the end (delta: -710.7 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2020-02-10 20:38:51,219 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.63 ms. Allocated memory is still 143.7 MB. Free memory was 120.0 MB in the beginning and 119.7 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:38:51,219 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.24 ms. Allocated memory is still 143.7 MB. Free memory was 118.5 MB in the beginning and 116.8 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:38:51,219 INFO L168 Benchmark]: Boogie Preprocessor took 30.07 ms. Allocated memory is still 143.7 MB. Free memory was 116.8 MB in the beginning and 115.5 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:38:51,220 INFO L168 Benchmark]: RCFGBuilder took 412.17 ms. Allocated memory is still 143.7 MB. Free memory was 115.5 MB in the beginning and 100.9 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 7.1 GB. [2020-02-10 20:38:51,220 INFO L168 Benchmark]: TraceAbstraction took 772032.74 ms. Allocated memory was 143.7 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 100.5 MB in the beginning and 829.4 MB in the end (delta: -728.9 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2020-02-10 20:38:51,220 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.63 ms. Allocated memory is still 143.7 MB. Free memory was 120.0 MB in the beginning and 119.7 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 40.24 ms. Allocated memory is still 143.7 MB. Free memory was 118.5 MB in the beginning and 116.8 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 30.07 ms. Allocated memory is still 143.7 MB. Free memory was 116.8 MB in the beginning and 115.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 412.17 ms. Allocated memory is still 143.7 MB. Free memory was 115.5 MB in the beginning and 100.9 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 772032.74 ms. Allocated memory was 143.7 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 100.5 MB in the beginning and 829.4 MB in the end (delta: -728.9 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.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 47 for 72ms.. - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 54 locations, 1 error locations. Started 1 CEGAR loops. Result: TIMEOUT, OverallTime: 771.7s, OverallIterations: 625, TraceHistogramMax: 1, AutomataDifference: 179.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 21.3s, HoareTripleCheckerStatistics: 94701 SDtfs, 141581 SDslu, 267617 SDs, 0 SdLazy, 71495 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 72.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7407 GetRequests, 633 SyntacticMatches, 0 SemanticMatches, 6774 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4920 ImplicationChecksByTransitivity, 457.4s 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: 137.7s AutomataMinimizationTime, 624 MinimizatonAttempts, 1771413 StatesRemovedByMinimization, 615 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 420.9s InterpolantComputationTime, 19344 NumberOfCodeBlocks, 19344 NumberOfCodeBlocksAsserted, 624 NumberOfCheckSat, 18720 ConstructedInterpolants, 0 QuantifiedInterpolants, 23289000 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 624 InterpolantComputations, 624 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