/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/concurrent/bpl/mcr/example_9.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.25-d9e330d [2020-02-10 19:43:48,219 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-02-10 19:43:48,223 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-02-10 19:43:48,240 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-02-10 19:43:48,241 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-02-10 19:43:48,243 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-02-10 19:43:48,245 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-02-10 19:43:48,252 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-02-10 19:43:48,254 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-02-10 19:43:48,258 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-02-10 19:43:48,260 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-02-10 19:43:48,262 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-02-10 19:43:48,262 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-02-10 19:43:48,265 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-02-10 19:43:48,267 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-02-10 19:43:48,269 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-02-10 19:43:48,271 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-02-10 19:43:48,272 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-02-10 19:43:48,274 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-02-10 19:43:48,278 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-02-10 19:43:48,283 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-02-10 19:43:48,287 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-02-10 19:43:48,288 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-02-10 19:43:48,289 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-02-10 19:43:48,291 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-02-10 19:43:48,291 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-02-10 19:43:48,291 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-02-10 19:43:48,293 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-02-10 19:43:48,294 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-02-10 19:43:48,295 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-02-10 19:43:48,296 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-02-10 19:43:48,296 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-02-10 19:43:48,297 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-02-10 19:43:48,298 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-02-10 19:43:48,299 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-02-10 19:43:48,300 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-02-10 19:43:48,300 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-02-10 19:43:48,300 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-02-10 19:43:48,301 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-02-10 19:43:48,301 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-02-10 19:43:48,303 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-02-10 19:43:48,303 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-02-10 19:43:48,323 INFO L113 SettingsManager]: Loading preferences was successful [2020-02-10 19:43:48,323 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-02-10 19:43:48,327 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-02-10 19:43:48,327 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-02-10 19:43:48,328 INFO L138 SettingsManager]: * Use SBE=true [2020-02-10 19:43:48,328 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-02-10 19:43:48,328 INFO L138 SettingsManager]: * sizeof long=4 [2020-02-10 19:43:48,328 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-02-10 19:43:48,328 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-02-10 19:43:48,329 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-02-10 19:43:48,330 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-02-10 19:43:48,330 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-02-10 19:43:48,330 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-02-10 19:43:48,331 INFO L138 SettingsManager]: * sizeof long double=12 [2020-02-10 19:43:48,331 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-02-10 19:43:48,331 INFO L138 SettingsManager]: * Use constant arrays=true [2020-02-10 19:43:48,331 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-02-10 19:43:48,331 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-02-10 19:43:48,332 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-02-10 19:43:48,332 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-02-10 19:43:48,332 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-02-10 19:43:48,332 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-02-10 19:43:48,332 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-02-10 19:43:48,333 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-02-10 19:43:48,333 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-02-10 19:43:48,333 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-02-10 19:43:48,333 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-02-10 19:43:48,333 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-02-10 19:43:48,333 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-02-10 19:43:48,334 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-02-10 19:43:48,636 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-02-10 19:43:48,652 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-02-10 19:43:48,656 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-02-10 19:43:48,658 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2020-02-10 19:43:48,659 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2020-02-10 19:43:48,660 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/mcr/example_9.bpl [2020-02-10 19:43:48,660 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/mcr/example_9.bpl' [2020-02-10 19:43:48,702 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-02-10 19:43:48,706 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-02-10 19:43:48,706 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-02-10 19:43:48,706 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-02-10 19:43:48,707 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-02-10 19:43:48,723 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "example_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:43:48" (1/1) ... [2020-02-10 19:43:48,733 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "example_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:43:48" (1/1) ... [2020-02-10 19:43:48,743 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-02-10 19:43:48,744 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-02-10 19:43:48,744 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-02-10 19:43:48,745 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-02-10 19:43:48,756 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "example_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:43:48" (1/1) ... [2020-02-10 19:43:48,756 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "example_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:43:48" (1/1) ... [2020-02-10 19:43:48,757 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "example_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:43:48" (1/1) ... [2020-02-10 19:43:48,758 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "example_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:43:48" (1/1) ... [2020-02-10 19:43:48,764 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "example_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:43:48" (1/1) ... [2020-02-10 19:43:48,766 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "example_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:43:48" (1/1) ... [2020-02-10 19:43:48,767 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "example_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:43:48" (1/1) ... [2020-02-10 19:43:48,769 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-02-10 19:43:48,770 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-02-10 19:43:48,770 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-02-10 19:43:48,770 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-02-10 19:43:48,771 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "example_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:43:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-02-10 19:43:48,854 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_1 given in one single declaration [2020-02-10 19:43:48,854 INFO L130 BoogieDeclarations]: Found specification of procedure set_1 [2020-02-10 19:43:48,856 INFO L138 BoogieDeclarations]: Found implementation of procedure set_1 [2020-02-10 19:43:48,856 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_2 given in one single declaration [2020-02-10 19:43:48,856 INFO L130 BoogieDeclarations]: Found specification of procedure set_2 [2020-02-10 19:43:48,857 INFO L138 BoogieDeclarations]: Found implementation of procedure set_2 [2020-02-10 19:43:48,857 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_3 given in one single declaration [2020-02-10 19:43:48,857 INFO L130 BoogieDeclarations]: Found specification of procedure set_3 [2020-02-10 19:43:48,857 INFO L138 BoogieDeclarations]: Found implementation of procedure set_3 [2020-02-10 19:43:48,858 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_4 given in one single declaration [2020-02-10 19:43:48,858 INFO L130 BoogieDeclarations]: Found specification of procedure set_4 [2020-02-10 19:43:48,858 INFO L138 BoogieDeclarations]: Found implementation of procedure set_4 [2020-02-10 19:43:48,859 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_0 given in one single declaration [2020-02-10 19:43:48,859 INFO L130 BoogieDeclarations]: Found specification of procedure set_0 [2020-02-10 19:43:48,859 INFO L138 BoogieDeclarations]: Found implementation of procedure set_0 [2020-02-10 19:43:48,859 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2020-02-10 19:43:48,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-02-10 19:43:48,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-02-10 19:43:48,860 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_5 given in one single declaration [2020-02-10 19:43:48,860 INFO L130 BoogieDeclarations]: Found specification of procedure set_5 [2020-02-10 19:43:48,860 INFO L138 BoogieDeclarations]: Found implementation of procedure set_5 [2020-02-10 19:43:48,861 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_6 given in one single declaration [2020-02-10 19:43:48,861 INFO L130 BoogieDeclarations]: Found specification of procedure set_6 [2020-02-10 19:43:48,862 INFO L138 BoogieDeclarations]: Found implementation of procedure set_6 [2020-02-10 19:43:48,868 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_7 given in one single declaration [2020-02-10 19:43:48,869 INFO L130 BoogieDeclarations]: Found specification of procedure set_7 [2020-02-10 19:43:48,870 INFO L138 BoogieDeclarations]: Found implementation of procedure set_7 [2020-02-10 19:43:48,871 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_8 given in one single declaration [2020-02-10 19:43:48,871 INFO L130 BoogieDeclarations]: Found specification of procedure set_8 [2020-02-10 19:43:48,871 INFO L138 BoogieDeclarations]: Found implementation of procedure set_8 [2020-02-10 19:43:48,872 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-02-10 19:43:49,107 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-02-10 19:43:49,107 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-02-10 19:43:49,113 INFO L202 PluginConnector]: Adding new model example_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 07:43:49 BoogieIcfgContainer [2020-02-10 19:43:49,114 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-02-10 19:43:49,122 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-02-10 19:43:49,122 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-02-10 19:43:49,125 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-02-10 19:43:49,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "example_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 07:43:48" (1/2) ... [2020-02-10 19:43:49,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e65a84 and model type example_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.02 07:43:49, skipping insertion in model container [2020-02-10 19:43:49,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "example_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 07:43:49" (2/2) ... [2020-02-10 19:43:49,129 INFO L109 eAbstractionObserver]: Analyzing ICFG example_9.bpl [2020-02-10 19:43:49,140 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-02-10 19:43:49,140 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-02-10 19:43:49,162 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-02-10 19:43:49,164 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-02-10 19:43:49,384 INFO L251 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2020-02-10 19:43:49,411 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-02-10 19:43:49,411 INFO L376 AbstractCegarLoop]: Hoare is true [2020-02-10 19:43:49,411 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-02-10 19:43:49,411 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-02-10 19:43:49,411 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-02-10 19:43:49,411 INFO L380 AbstractCegarLoop]: Difference is false [2020-02-10 19:43:49,412 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-02-10 19:43:49,412 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-02-10 19:43:49,426 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 120 transitions [2020-02-10 19:43:49,428 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 76 places, 120 transitions [2020-02-10 19:43:50,458 INFO L129 PetriNetUnfolder]: 1793/2334 cut-off events. [2020-02-10 19:43:50,458 INFO L130 PetriNetUnfolder]: For 2304/2304 co-relation queries the response was YES. [2020-02-10 19:43:50,500 INFO L76 FinitePrefix]: Finished finitePrefix Result has 4666 conditions, 2334 events. 1793/2334 cut-off events. For 2304/2304 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 8911 event pairs. 0/2333 useless extension candidates. Maximal degree in co-relation 2090. Up to 630 conditions per place. [2020-02-10 19:43:50,579 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 76 places, 120 transitions [2020-02-10 19:43:51,500 INFO L129 PetriNetUnfolder]: 1793/2334 cut-off events. [2020-02-10 19:43:51,500 INFO L130 PetriNetUnfolder]: For 2304/2304 co-relation queries the response was YES. [2020-02-10 19:43:51,530 INFO L76 FinitePrefix]: Finished finitePrefix Result has 4666 conditions, 2334 events. 1793/2334 cut-off events. For 2304/2304 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 8911 event pairs. 0/2333 useless extension candidates. Maximal degree in co-relation 2090. Up to 630 conditions per place. [2020-02-10 19:43:51,595 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2736 [2020-02-10 19:43:51,597 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-02-10 19:43:51,790 INFO L206 etLargeBlockEncoding]: Checked pairs total: 756 [2020-02-10 19:43:51,791 INFO L214 etLargeBlockEncoding]: Total number of compositions: 10 [2020-02-10 19:43:51,794 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 66 places, 110 transitions [2020-02-10 19:43:54,454 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 20196 states. [2020-02-10 19:43:54,456 INFO L276 IsEmpty]: Start isEmpty. Operand 20196 states. [2020-02-10 19:43:54,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:43:54,623 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:54,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] [2020-02-10 19:43:54,625 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:43:54,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:54,634 INFO L82 PathProgramCache]: Analyzing trace with hash 114387570, now seen corresponding path program 1 times [2020-02-10 19:43:54,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:54,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102159627] [2020-02-10 19:43:54,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:54,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:54,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:43:54,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102159627] [2020-02-10 19:43:54,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:54,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 19:43:54,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774706954] [2020-02-10 19:43:54,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 19:43:54,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:54,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 19:43:54,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:43:54,836 INFO L87 Difference]: Start difference. First operand 20196 states. Second operand 3 states. [2020-02-10 19:43:55,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:55,310 INFO L93 Difference]: Finished difference Result 18916 states and 109908 transitions. [2020-02-10 19:43:55,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 19:43:55,312 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-02-10 19:43:55,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:55,502 INFO L225 Difference]: With dead ends: 18916 [2020-02-10 19:43:55,502 INFO L226 Difference]: Without dead ends: 18915 [2020-02-10 19:43:55,503 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:43:56,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18915 states. [2020-02-10 19:43:57,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18915 to 18915. [2020-02-10 19:43:57,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18915 states. [2020-02-10 19:43:57,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18915 states to 18915 states and 109907 transitions. [2020-02-10 19:43:57,877 INFO L78 Accepts]: Start accepts. Automaton has 18915 states and 109907 transitions. Word has length 28 [2020-02-10 19:43:57,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:43:57,879 INFO L479 AbstractCegarLoop]: Abstraction has 18915 states and 109907 transitions. [2020-02-10 19:43:57,879 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 19:43:57,879 INFO L276 IsEmpty]: Start isEmpty. Operand 18915 states and 109907 transitions. [2020-02-10 19:43:57,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:43:57,972 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:43:57,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] [2020-02-10 19:43:57,972 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:43:57,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:43:57,973 INFO L82 PathProgramCache]: Analyzing trace with hash -520253774, now seen corresponding path program 1 times [2020-02-10 19:43:57,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:43:57,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962069428] [2020-02-10 19:43:57,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:43:57,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:43:58,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 19:43:58,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962069428] [2020-02-10 19:43:58,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:43:58,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 19:43:58,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218809724] [2020-02-10 19:43:58,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 19:43:58,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:43:58,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 19:43:58,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:43:58,013 INFO L87 Difference]: Start difference. First operand 18915 states and 109907 transitions. Second operand 3 states. [2020-02-10 19:43:58,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:43:58,256 INFO L93 Difference]: Finished difference Result 15971 states and 88467 transitions. [2020-02-10 19:43:58,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 19:43:58,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-02-10 19:43:58,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:43:58,339 INFO L225 Difference]: With dead ends: 15971 [2020-02-10 19:43:58,339 INFO L226 Difference]: Without dead ends: 15971 [2020-02-10 19:43:58,340 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:43:58,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15971 states. [2020-02-10 19:44:00,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15971 to 15971. [2020-02-10 19:44:00,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15971 states. [2020-02-10 19:44:00,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15971 states to 15971 states and 88467 transitions. [2020-02-10 19:44:00,406 INFO L78 Accepts]: Start accepts. Automaton has 15971 states and 88467 transitions. Word has length 28 [2020-02-10 19:44:00,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:00,407 INFO L479 AbstractCegarLoop]: Abstraction has 15971 states and 88467 transitions. [2020-02-10 19:44:00,407 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 19:44:00,407 INFO L276 IsEmpty]: Start isEmpty. Operand 15971 states and 88467 transitions. [2020-02-10 19:44:00,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:44:00,458 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:00,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] [2020-02-10 19:44:00,459 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:00,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:00,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1967135382, now seen corresponding path program 1 times [2020-02-10 19:44:00,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:00,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382045419] [2020-02-10 19:44:00,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:00,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:00,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 19:44:00,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382045419] [2020-02-10 19:44:00,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:00,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 19:44:00,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939493825] [2020-02-10 19:44:00,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 19:44:00,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:00,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 19:44:00,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:44:00,488 INFO L87 Difference]: Start difference. First operand 15971 states and 88467 transitions. Second operand 3 states. [2020-02-10 19:44:00,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:00,578 INFO L93 Difference]: Finished difference Result 10243 states and 54163 transitions. [2020-02-10 19:44:00,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 19:44:00,578 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-02-10 19:44:00,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:00,616 INFO L225 Difference]: With dead ends: 10243 [2020-02-10 19:44:00,616 INFO L226 Difference]: Without dead ends: 10243 [2020-02-10 19:44:00,616 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:44:00,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10243 states. [2020-02-10 19:44:00,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10243 to 10243. [2020-02-10 19:44:00,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10243 states. [2020-02-10 19:44:01,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10243 states to 10243 states and 54163 transitions. [2020-02-10 19:44:01,383 INFO L78 Accepts]: Start accepts. Automaton has 10243 states and 54163 transitions. Word has length 28 [2020-02-10 19:44:01,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:01,384 INFO L479 AbstractCegarLoop]: Abstraction has 10243 states and 54163 transitions. [2020-02-10 19:44:01,384 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 19:44:01,384 INFO L276 IsEmpty]: Start isEmpty. Operand 10243 states and 54163 transitions. [2020-02-10 19:44:01,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:44:01,427 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:01,427 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:01,427 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:01,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:01,429 INFO L82 PathProgramCache]: Analyzing trace with hash 2067096892, now seen corresponding path program 1 times [2020-02-10 19:44:01,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:01,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139062508] [2020-02-10 19:44:01,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:01,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:01,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:01,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139062508] [2020-02-10 19:44:01,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:01,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 19:44:01,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729497262] [2020-02-10 19:44:01,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 19:44:01,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:01,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 19:44:01,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:44:01,501 INFO L87 Difference]: Start difference. First operand 10243 states and 54163 transitions. Second operand 3 states. [2020-02-10 19:44:01,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:01,599 INFO L93 Difference]: Finished difference Result 9987 states and 52243 transitions. [2020-02-10 19:44:01,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 19:44:01,600 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-02-10 19:44:01,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:01,637 INFO L225 Difference]: With dead ends: 9987 [2020-02-10 19:44:01,637 INFO L226 Difference]: Without dead ends: 9987 [2020-02-10 19:44:01,638 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:44:01,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9987 states. [2020-02-10 19:44:02,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9987 to 9987. [2020-02-10 19:44:02,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9987 states. [2020-02-10 19:44:02,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9987 states to 9987 states and 52243 transitions. [2020-02-10 19:44:02,134 INFO L78 Accepts]: Start accepts. Automaton has 9987 states and 52243 transitions. Word has length 28 [2020-02-10 19:44:02,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:02,135 INFO L479 AbstractCegarLoop]: Abstraction has 9987 states and 52243 transitions. [2020-02-10 19:44:02,135 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 19:44:02,135 INFO L276 IsEmpty]: Start isEmpty. Operand 9987 states and 52243 transitions. [2020-02-10 19:44:02,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:44:02,170 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:02,170 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:02,170 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:02,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:02,171 INFO L82 PathProgramCache]: Analyzing trace with hash -77951046, now seen corresponding path program 1 times [2020-02-10 19:44:02,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:02,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399538062] [2020-02-10 19:44:02,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:02,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:02,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:02,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399538062] [2020-02-10 19:44:02,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:02,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 19:44:02,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391543100] [2020-02-10 19:44:02,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 19:44:02,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:02,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 19:44:02,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:44:02,201 INFO L87 Difference]: Start difference. First operand 9987 states and 52243 transitions. Second operand 3 states. [2020-02-10 19:44:02,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:02,276 INFO L93 Difference]: Finished difference Result 6171 states and 30927 transitions. [2020-02-10 19:44:02,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 19:44:02,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-02-10 19:44:02,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:02,299 INFO L225 Difference]: With dead ends: 6171 [2020-02-10 19:44:02,299 INFO L226 Difference]: Without dead ends: 6171 [2020-02-10 19:44:02,300 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:44:02,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6171 states. [2020-02-10 19:44:02,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6171 to 6171. [2020-02-10 19:44:02,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6171 states. [2020-02-10 19:44:02,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6171 states to 6171 states and 30927 transitions. [2020-02-10 19:44:02,568 INFO L78 Accepts]: Start accepts. Automaton has 6171 states and 30927 transitions. Word has length 28 [2020-02-10 19:44:02,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:02,568 INFO L479 AbstractCegarLoop]: Abstraction has 6171 states and 30927 transitions. [2020-02-10 19:44:02,568 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 19:44:02,569 INFO L276 IsEmpty]: Start isEmpty. Operand 6171 states and 30927 transitions. [2020-02-10 19:44:02,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:44:02,585 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:02,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] [2020-02-10 19:44:02,585 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:02,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:02,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1337464426, now seen corresponding path program 1 times [2020-02-10 19:44:02,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:02,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216492115] [2020-02-10 19:44:02,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:02,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:02,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 19:44:02,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216492115] [2020-02-10 19:44:02,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:02,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 19:44:02,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234503755] [2020-02-10 19:44:02,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 19:44:02,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:02,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 19:44:02,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:44:02,640 INFO L87 Difference]: Start difference. First operand 6171 states and 30927 transitions. Second operand 3 states. [2020-02-10 19:44:02,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:02,692 INFO L93 Difference]: Finished difference Result 3883 states and 18511 transitions. [2020-02-10 19:44:02,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 19:44:02,693 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-02-10 19:44:02,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:02,707 INFO L225 Difference]: With dead ends: 3883 [2020-02-10 19:44:02,707 INFO L226 Difference]: Without dead ends: 3883 [2020-02-10 19:44:02,708 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:44:02,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3883 states. [2020-02-10 19:44:02,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3883 to 3883. [2020-02-10 19:44:02,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3883 states. [2020-02-10 19:44:02,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3883 states to 3883 states and 18511 transitions. [2020-02-10 19:44:02,868 INFO L78 Accepts]: Start accepts. Automaton has 3883 states and 18511 transitions. Word has length 28 [2020-02-10 19:44:02,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:02,868 INFO L479 AbstractCegarLoop]: Abstraction has 3883 states and 18511 transitions. [2020-02-10 19:44:02,868 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 19:44:02,868 INFO L276 IsEmpty]: Start isEmpty. Operand 3883 states and 18511 transitions. [2020-02-10 19:44:02,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:44:02,877 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:02,877 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:02,877 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:02,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:02,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1461842622, now seen corresponding path program 1 times [2020-02-10 19:44:02,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:02,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120598078] [2020-02-10 19:44:02,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:02,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:02,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:02,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120598078] [2020-02-10 19:44:02,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:02,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 19:44:02,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689580771] [2020-02-10 19:44:02,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 19:44:02,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:02,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 19:44:02,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:44:02,929 INFO L87 Difference]: Start difference. First operand 3883 states and 18511 transitions. Second operand 3 states. [2020-02-10 19:44:03,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:03,344 INFO L93 Difference]: Finished difference Result 2539 states and 11503 transitions. [2020-02-10 19:44:03,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 19:44:03,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-02-10 19:44:03,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:03,353 INFO L225 Difference]: With dead ends: 2539 [2020-02-10 19:44:03,353 INFO L226 Difference]: Without dead ends: 2539 [2020-02-10 19:44:03,354 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:44:03,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2539 states. [2020-02-10 19:44:03,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2539 to 2539. [2020-02-10 19:44:03,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2539 states. [2020-02-10 19:44:03,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2539 states to 2539 states and 11503 transitions. [2020-02-10 19:44:03,440 INFO L78 Accepts]: Start accepts. Automaton has 2539 states and 11503 transitions. Word has length 28 [2020-02-10 19:44:03,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:03,441 INFO L479 AbstractCegarLoop]: Abstraction has 2539 states and 11503 transitions. [2020-02-10 19:44:03,441 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 19:44:03,441 INFO L276 IsEmpty]: Start isEmpty. Operand 2539 states and 11503 transitions. [2020-02-10 19:44:03,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:44:03,447 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:03,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] [2020-02-10 19:44:03,447 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:03,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:03,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1283995022, now seen corresponding path program 1 times [2020-02-10 19:44:03,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:03,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973034405] [2020-02-10 19:44:03,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:03,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:03,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:03,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973034405] [2020-02-10 19:44:03,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:03,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 19:44:03,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925608165] [2020-02-10 19:44:03,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 19:44:03,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:03,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 19:44:03,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:44:03,490 INFO L87 Difference]: Start difference. First operand 2539 states and 11503 transitions. Second operand 3 states. [2020-02-10 19:44:03,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:03,508 INFO L93 Difference]: Finished difference Result 1535 states and 6913 transitions. [2020-02-10 19:44:03,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 19:44:03,509 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-02-10 19:44:03,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:03,514 INFO L225 Difference]: With dead ends: 1535 [2020-02-10 19:44:03,514 INFO L226 Difference]: Without dead ends: 1535 [2020-02-10 19:44:03,514 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 19:44:03,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1535 states. [2020-02-10 19:44:03,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1535 to 1535. [2020-02-10 19:44:03,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1535 states. [2020-02-10 19:44:03,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 6913 transitions. [2020-02-10 19:44:03,588 INFO L78 Accepts]: Start accepts. Automaton has 1535 states and 6913 transitions. Word has length 28 [2020-02-10 19:44:03,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:03,588 INFO L479 AbstractCegarLoop]: Abstraction has 1535 states and 6913 transitions. [2020-02-10 19:44:03,589 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 19:44:03,589 INFO L276 IsEmpty]: Start isEmpty. Operand 1535 states and 6913 transitions. [2020-02-10 19:44:03,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:44:03,593 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:03,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] [2020-02-10 19:44:03,593 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:03,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:03,593 INFO L82 PathProgramCache]: Analyzing trace with hash 662697718, now seen corresponding path program 1 times [2020-02-10 19:44:03,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:03,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504869086] [2020-02-10 19:44:03,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:03,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:04,356 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 30 [2020-02-10 19:44:04,490 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 30 [2020-02-10 19:44:04,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 19:44:04,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504869086] [2020-02-10 19:44:04,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:04,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:44:04,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350812405] [2020-02-10 19:44:04,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:44:04,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:04,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:44:04,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:04,504 INFO L87 Difference]: Start difference. First operand 1535 states and 6913 transitions. Second operand 11 states. [2020-02-10 19:44:04,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:04,740 INFO L93 Difference]: Finished difference Result 3001 states and 11928 transitions. [2020-02-10 19:44:04,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:44:04,741 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:44:04,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:04,749 INFO L225 Difference]: With dead ends: 3001 [2020-02-10 19:44:04,749 INFO L226 Difference]: Without dead ends: 2986 [2020-02-10 19:44:04,749 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:44:04,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2986 states. [2020-02-10 19:44:04,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2986 to 1583. [2020-02-10 19:44:04,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 19:44:04,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7118 transitions. [2020-02-10 19:44:04,854 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7118 transitions. Word has length 28 [2020-02-10 19:44:04,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:04,855 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7118 transitions. [2020-02-10 19:44:04,855 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:44:04,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7118 transitions. [2020-02-10 19:44:04,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:44:04,859 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:04,859 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:04,859 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:04,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:04,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1407400216, now seen corresponding path program 2 times [2020-02-10 19:44:04,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:04,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891419206] [2020-02-10 19:44:04,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:04,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:05,547 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 31 [2020-02-10 19:44:05,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:05,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891419206] [2020-02-10 19:44:05,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:05,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:44:05,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041959339] [2020-02-10 19:44:05,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:44:05,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:05,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:44:05,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:05,561 INFO L87 Difference]: Start difference. First operand 1583 states and 7118 transitions. Second operand 11 states. [2020-02-10 19:44:05,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:05,901 INFO L93 Difference]: Finished difference Result 3002 states and 11925 transitions. [2020-02-10 19:44:05,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:44:05,902 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:44:05,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:05,909 INFO L225 Difference]: With dead ends: 3002 [2020-02-10 19:44:05,909 INFO L226 Difference]: Without dead ends: 2981 [2020-02-10 19:44:05,909 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:44:05,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2981 states. [2020-02-10 19:44:05,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2981 to 1578. [2020-02-10 19:44:05,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 19:44:05,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7104 transitions. [2020-02-10 19:44:05,997 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7104 transitions. Word has length 28 [2020-02-10 19:44:05,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:05,998 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7104 transitions. [2020-02-10 19:44:05,998 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:44:05,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7104 transitions. [2020-02-10 19:44:06,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:44:06,002 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:06,002 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:06,002 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:06,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:06,002 INFO L82 PathProgramCache]: Analyzing trace with hash -2021328620, now seen corresponding path program 3 times [2020-02-10 19:44:06,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:06,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867362642] [2020-02-10 19:44:06,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:06,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:06,451 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 25 [2020-02-10 19:44:06,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 19:44:06,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867362642] [2020-02-10 19:44:06,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:06,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:44:06,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096027373] [2020-02-10 19:44:06,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:44:06,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:06,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:44:06,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:06,683 INFO L87 Difference]: Start difference. First operand 1578 states and 7104 transitions. Second operand 11 states. [2020-02-10 19:44:06,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:06,915 INFO L93 Difference]: Finished difference Result 3006 states and 11932 transitions. [2020-02-10 19:44:06,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:44:06,916 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:44:06,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:06,924 INFO L225 Difference]: With dead ends: 3006 [2020-02-10 19:44:06,924 INFO L226 Difference]: Without dead ends: 2991 [2020-02-10 19:44:06,924 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:44:06,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2991 states. [2020-02-10 19:44:07,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2991 to 1584. [2020-02-10 19:44:07,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1584 states. [2020-02-10 19:44:07,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 7115 transitions. [2020-02-10 19:44:07,023 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 7115 transitions. Word has length 28 [2020-02-10 19:44:07,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:07,023 INFO L479 AbstractCegarLoop]: Abstraction has 1584 states and 7115 transitions. [2020-02-10 19:44:07,023 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:44:07,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 7115 transitions. [2020-02-10 19:44:07,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:44:07,028 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:07,028 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:07,028 INFO L427 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:07,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:07,028 INFO L82 PathProgramCache]: Analyzing trace with hash -531923624, now seen corresponding path program 4 times [2020-02-10 19:44:07,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:07,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075144666] [2020-02-10 19:44:07,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:07,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:07,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 19:44:07,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075144666] [2020-02-10 19:44:07,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:07,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:44:07,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814005208] [2020-02-10 19:44:07,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:44:07,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:07,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:44:07,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:07,657 INFO L87 Difference]: Start difference. First operand 1584 states and 7115 transitions. Second operand 11 states. [2020-02-10 19:44:07,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:07,831 INFO L93 Difference]: Finished difference Result 3011 states and 11936 transitions. [2020-02-10 19:44:07,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:44:07,831 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:44:07,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:07,839 INFO L225 Difference]: With dead ends: 3011 [2020-02-10 19:44:07,839 INFO L226 Difference]: Without dead ends: 2985 [2020-02-10 19:44:07,840 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:44:07,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2985 states. [2020-02-10 19:44:07,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2985 to 1578. [2020-02-10 19:44:07,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 19:44:07,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7098 transitions. [2020-02-10 19:44:07,926 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7098 transitions. Word has length 28 [2020-02-10 19:44:07,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:07,926 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7098 transitions. [2020-02-10 19:44:07,926 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:44:07,927 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7098 transitions. [2020-02-10 19:44:07,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:44:07,930 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:07,930 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:07,930 INFO L427 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:07,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:07,931 INFO L82 PathProgramCache]: Analyzing trace with hash 334314836, now seen corresponding path program 5 times [2020-02-10 19:44:07,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:07,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200243316] [2020-02-10 19:44:07,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:07,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:08,560 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 31 [2020-02-10 19:44:08,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 19:44:08,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200243316] [2020-02-10 19:44:08,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:08,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:44:08,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051253060] [2020-02-10 19:44:08,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:44:08,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:08,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:44:08,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:08,571 INFO L87 Difference]: Start difference. First operand 1578 states and 7098 transitions. Second operand 11 states. [2020-02-10 19:44:08,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:08,777 INFO L93 Difference]: Finished difference Result 3009 states and 11933 transitions. [2020-02-10 19:44:08,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:44:08,777 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:44:08,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:08,784 INFO L225 Difference]: With dead ends: 3009 [2020-02-10 19:44:08,784 INFO L226 Difference]: Without dead ends: 2993 [2020-02-10 19:44:08,785 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:44:08,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2993 states. [2020-02-10 19:44:08,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2993 to 1585. [2020-02-10 19:44:08,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1585 states. [2020-02-10 19:44:08,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 7111 transitions. [2020-02-10 19:44:08,861 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 7111 transitions. Word has length 28 [2020-02-10 19:44:08,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:08,861 INFO L479 AbstractCegarLoop]: Abstraction has 1585 states and 7111 transitions. [2020-02-10 19:44:08,861 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:44:08,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 7111 transitions. [2020-02-10 19:44:08,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:44:08,864 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:08,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] [2020-02-10 19:44:08,864 INFO L427 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:08,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:08,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1079017334, now seen corresponding path program 6 times [2020-02-10 19:44:08,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:08,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693777654] [2020-02-10 19:44:08,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:08,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:09,479 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 31 [2020-02-10 19:44:09,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:09,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693777654] [2020-02-10 19:44:09,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:09,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:44:09,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481252410] [2020-02-10 19:44:09,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:44:09,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:09,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:44:09,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:09,490 INFO L87 Difference]: Start difference. First operand 1585 states and 7111 transitions. Second operand 11 states. [2020-02-10 19:44:09,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:09,679 INFO L93 Difference]: Finished difference Result 3013 states and 11934 transitions. [2020-02-10 19:44:09,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:44:09,679 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:44:09,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:09,688 INFO L225 Difference]: With dead ends: 3013 [2020-02-10 19:44:09,688 INFO L226 Difference]: Without dead ends: 2980 [2020-02-10 19:44:09,688 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:44:09,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2980 states. [2020-02-10 19:44:09,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2980 to 1572. [2020-02-10 19:44:09,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 19:44:09,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7081 transitions. [2020-02-10 19:44:09,776 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7081 transitions. Word has length 28 [2020-02-10 19:44:09,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:09,776 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7081 transitions. [2020-02-10 19:44:09,776 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:44:09,776 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7081 transitions. [2020-02-10 19:44:09,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:44:09,779 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:09,779 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:09,780 INFO L427 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:09,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:09,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1382710192, now seen corresponding path program 7 times [2020-02-10 19:44:09,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:09,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226979918] [2020-02-10 19:44:09,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:09,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:10,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 19:44:10,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226979918] [2020-02-10 19:44:10,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:10,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:44:10,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818478093] [2020-02-10 19:44:10,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:44:10,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:10,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:44:10,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:10,439 INFO L87 Difference]: Start difference. First operand 1572 states and 7081 transitions. Second operand 11 states. [2020-02-10 19:44:10,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:10,643 INFO L93 Difference]: Finished difference Result 2996 states and 11912 transitions. [2020-02-10 19:44:10,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:44:10,643 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:44:10,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:10,651 INFO L225 Difference]: With dead ends: 2996 [2020-02-10 19:44:10,651 INFO L226 Difference]: Without dead ends: 2981 [2020-02-10 19:44:10,652 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:44:10,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2981 states. [2020-02-10 19:44:10,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2981 to 1582. [2020-02-10 19:44:10,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2020-02-10 19:44:10,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 7109 transitions. [2020-02-10 19:44:10,727 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 7109 transitions. Word has length 28 [2020-02-10 19:44:10,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:10,727 INFO L479 AbstractCegarLoop]: Abstraction has 1582 states and 7109 transitions. [2020-02-10 19:44:10,727 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:44:10,727 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 7109 transitions. [2020-02-10 19:44:10,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:44:10,730 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:10,730 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:10,730 INFO L427 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:10,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:10,731 INFO L82 PathProgramCache]: Analyzing trace with hash 2127412690, now seen corresponding path program 8 times [2020-02-10 19:44:10,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:10,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489334618] [2020-02-10 19:44:10,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:10,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:11,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:11,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489334618] [2020-02-10 19:44:11,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:11,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:44:11,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446337517] [2020-02-10 19:44:11,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:44:11,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:11,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:44:11,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:11,369 INFO L87 Difference]: Start difference. First operand 1582 states and 7109 transitions. Second operand 11 states. [2020-02-10 19:44:11,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:11,594 INFO L93 Difference]: Finished difference Result 2997 states and 11909 transitions. [2020-02-10 19:44:11,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:44:11,594 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:44:11,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:11,602 INFO L225 Difference]: With dead ends: 2997 [2020-02-10 19:44:11,602 INFO L226 Difference]: Without dead ends: 2976 [2020-02-10 19:44:11,602 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:44:11,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2976 states. [2020-02-10 19:44:11,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2976 to 1577. [2020-02-10 19:44:11,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 19:44:11,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7095 transitions. [2020-02-10 19:44:11,673 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7095 transitions. Word has length 28 [2020-02-10 19:44:11,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:11,673 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7095 transitions. [2020-02-10 19:44:11,673 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:44:11,673 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7095 transitions. [2020-02-10 19:44:11,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:44:11,677 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:11,677 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:11,677 INFO L427 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:11,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:11,677 INFO L82 PathProgramCache]: Analyzing trace with hash 309624812, now seen corresponding path program 9 times [2020-02-10 19:44:11,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:11,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565964012] [2020-02-10 19:44:11,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:11,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:12,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:12,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565964012] [2020-02-10 19:44:12,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:12,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:44:12,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400078441] [2020-02-10 19:44:12,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:44:12,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:12,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:44:12,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:12,276 INFO L87 Difference]: Start difference. First operand 1577 states and 7095 transitions. Second operand 11 states. [2020-02-10 19:44:12,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:12,474 INFO L93 Difference]: Finished difference Result 2998 states and 11911 transitions. [2020-02-10 19:44:12,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:44:12,474 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:44:12,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:12,482 INFO L225 Difference]: With dead ends: 2998 [2020-02-10 19:44:12,483 INFO L226 Difference]: Without dead ends: 2983 [2020-02-10 19:44:12,483 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:44:12,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2983 states. [2020-02-10 19:44:12,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2983 to 1582. [2020-02-10 19:44:12,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2020-02-10 19:44:12,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 7104 transitions. [2020-02-10 19:44:12,552 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 7104 transitions. Word has length 28 [2020-02-10 19:44:12,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:12,552 INFO L479 AbstractCegarLoop]: Abstraction has 1582 states and 7104 transitions. [2020-02-10 19:44:12,552 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:44:12,552 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 7104 transitions. [2020-02-10 19:44:12,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:44:12,554 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:12,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] [2020-02-10 19:44:12,555 INFO L427 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:12,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:12,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1751234990, now seen corresponding path program 10 times [2020-02-10 19:44:12,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:12,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451062541] [2020-02-10 19:44:12,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:12,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:13,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 19:44:13,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451062541] [2020-02-10 19:44:13,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:13,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:44:13,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220439025] [2020-02-10 19:44:13,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:44:13,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:13,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:44:13,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:13,129 INFO L87 Difference]: Start difference. First operand 1582 states and 7104 transitions. Second operand 11 states. [2020-02-10 19:44:13,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:13,334 INFO L93 Difference]: Finished difference Result 3001 states and 11912 transitions. [2020-02-10 19:44:13,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:44:13,335 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:44:13,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:13,342 INFO L225 Difference]: With dead ends: 3001 [2020-02-10 19:44:13,342 INFO L226 Difference]: Without dead ends: 2978 [2020-02-10 19:44:13,342 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:44:13,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2978 states. [2020-02-10 19:44:13,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2978 to 1577. [2020-02-10 19:44:13,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 19:44:13,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7090 transitions. [2020-02-10 19:44:13,442 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7090 transitions. Word has length 28 [2020-02-10 19:44:13,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:13,442 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7090 transitions. [2020-02-10 19:44:13,442 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:44:13,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7090 transitions. [2020-02-10 19:44:13,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:44:13,445 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:13,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] [2020-02-10 19:44:13,445 INFO L427 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:13,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:13,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1629699028, now seen corresponding path program 11 times [2020-02-10 19:44:13,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:13,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767414084] [2020-02-10 19:44:13,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:13,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:14,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:14,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767414084] [2020-02-10 19:44:14,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:14,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:44:14,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452075597] [2020-02-10 19:44:14,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:44:14,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:14,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:44:14,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:14,107 INFO L87 Difference]: Start difference. First operand 1577 states and 7090 transitions. Second operand 11 states. [2020-02-10 19:44:14,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:14,306 INFO L93 Difference]: Finished difference Result 3001 states and 11913 transitions. [2020-02-10 19:44:14,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:44:14,307 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:44:14,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:14,315 INFO L225 Difference]: With dead ends: 3001 [2020-02-10 19:44:14,315 INFO L226 Difference]: Without dead ends: 2985 [2020-02-10 19:44:14,316 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:44:14,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2985 states. [2020-02-10 19:44:14,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2985 to 1583. [2020-02-10 19:44:14,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 19:44:14,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7101 transitions. [2020-02-10 19:44:14,387 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7101 transitions. Word has length 28 [2020-02-10 19:44:14,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:14,387 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7101 transitions. [2020-02-10 19:44:14,387 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:44:14,387 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7101 transitions. [2020-02-10 19:44:14,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:44:14,389 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:14,390 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:14,390 INFO L427 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:14,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:14,390 INFO L82 PathProgramCache]: Analyzing trace with hash -140294032, now seen corresponding path program 12 times [2020-02-10 19:44:14,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:14,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073384612] [2020-02-10 19:44:14,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:14,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:14,959 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 19:44:14,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 19:44:14,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073384612] [2020-02-10 19:44:14,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:14,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:44:14,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260373945] [2020-02-10 19:44:14,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:44:14,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:14,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:44:14,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:14,968 INFO L87 Difference]: Start difference. First operand 1583 states and 7101 transitions. Second operand 11 states. [2020-02-10 19:44:15,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:15,197 INFO L93 Difference]: Finished difference Result 3003 states and 11911 transitions. [2020-02-10 19:44:15,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:44:15,198 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:44:15,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:15,205 INFO L225 Difference]: With dead ends: 3003 [2020-02-10 19:44:15,206 INFO L226 Difference]: Without dead ends: 2974 [2020-02-10 19:44:15,206 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:44:15,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2974 states. [2020-02-10 19:44:15,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2974 to 1572. [2020-02-10 19:44:15,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 19:44:15,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7076 transitions. [2020-02-10 19:44:15,277 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7076 transitions. Word has length 28 [2020-02-10 19:44:15,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:15,277 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7076 transitions. [2020-02-10 19:44:15,277 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:44:15,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7076 transitions. [2020-02-10 19:44:15,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:44:15,280 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:15,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] [2020-02-10 19:44:15,280 INFO L427 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:15,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:15,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1393213296, now seen corresponding path program 13 times [2020-02-10 19:44:15,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:15,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402130807] [2020-02-10 19:44:15,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:15,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:15,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:15,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402130807] [2020-02-10 19:44:15,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:15,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:44:15,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883689995] [2020-02-10 19:44:15,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:44:15,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:15,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:44:15,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:15,848 INFO L87 Difference]: Start difference. First operand 1572 states and 7076 transitions. Second operand 11 states. [2020-02-10 19:44:16,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:16,054 INFO L93 Difference]: Finished difference Result 3012 states and 11939 transitions. [2020-02-10 19:44:16,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:44:16,055 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:44:16,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:16,062 INFO L225 Difference]: With dead ends: 3012 [2020-02-10 19:44:16,063 INFO L226 Difference]: Without dead ends: 2997 [2020-02-10 19:44:16,063 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:44:16,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2997 states. [2020-02-10 19:44:16,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2997 to 1585. [2020-02-10 19:44:16,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1585 states. [2020-02-10 19:44:16,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 7111 transitions. [2020-02-10 19:44:16,132 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 7111 transitions. Word has length 28 [2020-02-10 19:44:16,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:16,133 INFO L479 AbstractCegarLoop]: Abstraction has 1585 states and 7111 transitions. [2020-02-10 19:44:16,133 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:44:16,133 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 7111 transitions. [2020-02-10 19:44:16,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:44:16,136 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:16,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] [2020-02-10 19:44:16,137 INFO L427 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:16,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:16,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1412349004, now seen corresponding path program 14 times [2020-02-10 19:44:16,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:16,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023536630] [2020-02-10 19:44:16,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:16,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:16,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 19:44:16,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023536630] [2020-02-10 19:44:16,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:16,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:44:16,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484259426] [2020-02-10 19:44:16,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:44:16,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:16,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:44:16,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:16,692 INFO L87 Difference]: Start difference. First operand 1585 states and 7111 transitions. Second operand 11 states. [2020-02-10 19:44:16,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:16,912 INFO L93 Difference]: Finished difference Result 3017 states and 11943 transitions. [2020-02-10 19:44:16,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:44:16,917 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:44:16,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:16,923 INFO L225 Difference]: With dead ends: 3017 [2020-02-10 19:44:16,923 INFO L226 Difference]: Without dead ends: 2991 [2020-02-10 19:44:16,923 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:44:16,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2991 states. [2020-02-10 19:44:16,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2991 to 1579. [2020-02-10 19:44:16,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 19:44:16,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7094 transitions. [2020-02-10 19:44:16,995 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7094 transitions. Word has length 28 [2020-02-10 19:44:16,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:16,995 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7094 transitions. [2020-02-10 19:44:16,995 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:44:16,995 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7094 transitions. [2020-02-10 19:44:16,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:44:16,998 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:16,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] [2020-02-10 19:44:16,998 INFO L427 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:16,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:16,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1290813042, now seen corresponding path program 15 times [2020-02-10 19:44:16,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:16,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336648244] [2020-02-10 19:44:16,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:17,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:17,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:17,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336648244] [2020-02-10 19:44:17,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:17,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:44:17,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992723285] [2020-02-10 19:44:17,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:44:17,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:17,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:44:17,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:17,586 INFO L87 Difference]: Start difference. First operand 1579 states and 7094 transitions. Second operand 11 states. [2020-02-10 19:44:17,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:17,820 INFO L93 Difference]: Finished difference Result 3009 states and 11928 transitions. [2020-02-10 19:44:17,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:44:17,821 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:44:17,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:17,828 INFO L225 Difference]: With dead ends: 3009 [2020-02-10 19:44:17,828 INFO L226 Difference]: Without dead ends: 2994 [2020-02-10 19:44:17,828 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:44:17,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2994 states. [2020-02-10 19:44:17,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2994 to 1584. [2020-02-10 19:44:17,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1584 states. [2020-02-10 19:44:17,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 7103 transitions. [2020-02-10 19:44:17,897 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 7103 transitions. Word has length 28 [2020-02-10 19:44:17,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:17,897 INFO L479 AbstractCegarLoop]: Abstraction has 1584 states and 7103 transitions. [2020-02-10 19:44:17,897 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:44:17,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 7103 transitions. [2020-02-10 19:44:17,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:44:17,900 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:17,900 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:17,900 INFO L427 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:17,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:17,900 INFO L82 PathProgramCache]: Analyzing trace with hash 943294452, now seen corresponding path program 16 times [2020-02-10 19:44:17,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:17,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286010638] [2020-02-10 19:44:17,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:17,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:18,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:18,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286010638] [2020-02-10 19:44:18,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:18,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:44:18,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465214529] [2020-02-10 19:44:18,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:44:18,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:18,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:44:18,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:18,456 INFO L87 Difference]: Start difference. First operand 1584 states and 7103 transitions. Second operand 11 states. [2020-02-10 19:44:18,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:18,667 INFO L93 Difference]: Finished difference Result 3012 states and 11929 transitions. [2020-02-10 19:44:18,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:44:18,668 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:44:18,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:18,675 INFO L225 Difference]: With dead ends: 3012 [2020-02-10 19:44:18,676 INFO L226 Difference]: Without dead ends: 2989 [2020-02-10 19:44:18,676 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:44:18,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2989 states. [2020-02-10 19:44:18,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2989 to 1579. [2020-02-10 19:44:18,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 19:44:18,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7089 transitions. [2020-02-10 19:44:18,745 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7089 transitions. Word has length 28 [2020-02-10 19:44:18,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:18,745 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7089 transitions. [2020-02-10 19:44:18,745 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:44:18,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7089 transitions. [2020-02-10 19:44:18,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:44:18,747 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:18,747 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:18,748 INFO L427 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:18,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:18,748 INFO L82 PathProgramCache]: Analyzing trace with hash -874493426, now seen corresponding path program 17 times [2020-02-10 19:44:18,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:18,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082249196] [2020-02-10 19:44:18,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:18,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:19,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 19:44:19,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082249196] [2020-02-10 19:44:19,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:19,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:44:19,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215282498] [2020-02-10 19:44:19,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:44:19,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:19,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:44:19,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:19,341 INFO L87 Difference]: Start difference. First operand 1579 states and 7089 transitions. Second operand 11 states. [2020-02-10 19:44:19,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:19,537 INFO L93 Difference]: Finished difference Result 3024 states and 11953 transitions. [2020-02-10 19:44:19,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:44:19,538 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:44:19,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:19,545 INFO L225 Difference]: With dead ends: 3024 [2020-02-10 19:44:19,545 INFO L226 Difference]: Without dead ends: 3004 [2020-02-10 19:44:19,546 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:44:19,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3004 states. [2020-02-10 19:44:19,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3004 to 1589. [2020-02-10 19:44:19,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1589 states. [2020-02-10 19:44:19,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1589 states and 7106 transitions. [2020-02-10 19:44:19,619 INFO L78 Accepts]: Start accepts. Automaton has 1589 states and 7106 transitions. Word has length 28 [2020-02-10 19:44:19,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:19,619 INFO L479 AbstractCegarLoop]: Abstraction has 1589 states and 7106 transitions. [2020-02-10 19:44:19,619 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:44:19,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 7106 transitions. [2020-02-10 19:44:19,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:44:19,622 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:19,622 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:19,622 INFO L427 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:19,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:19,622 INFO L82 PathProgramCache]: Analyzing trace with hash -129790928, now seen corresponding path program 18 times [2020-02-10 19:44:19,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:19,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387936329] [2020-02-10 19:44:19,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:19,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:20,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 19:44:20,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387936329] [2020-02-10 19:44:20,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:20,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:44:20,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177979568] [2020-02-10 19:44:20,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:44:20,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:20,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:44:20,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:20,218 INFO L87 Difference]: Start difference. First operand 1589 states and 7106 transitions. Second operand 11 states. [2020-02-10 19:44:20,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:20,423 INFO L93 Difference]: Finished difference Result 3022 states and 11941 transitions. [2020-02-10 19:44:20,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:44:20,424 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:44:20,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:20,432 INFO L225 Difference]: With dead ends: 3022 [2020-02-10 19:44:20,432 INFO L226 Difference]: Without dead ends: 2987 [2020-02-10 19:44:20,432 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:44:20,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2987 states. [2020-02-10 19:44:20,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2987 to 1572. [2020-02-10 19:44:20,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 19:44:20,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7069 transitions. [2020-02-10 19:44:20,500 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7069 transitions. Word has length 28 [2020-02-10 19:44:20,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:20,500 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7069 transitions. [2020-02-10 19:44:20,500 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:44:20,500 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7069 transitions. [2020-02-10 19:44:20,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:44:20,502 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:20,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] [2020-02-10 19:44:20,503 INFO L427 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:20,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:20,503 INFO L82 PathProgramCache]: Analyzing trace with hash -2146548398, now seen corresponding path program 19 times [2020-02-10 19:44:20,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:20,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213311341] [2020-02-10 19:44:20,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:20,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:20,877 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 27 [2020-02-10 19:44:21,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 19:44:21,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213311341] [2020-02-10 19:44:21,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:21,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:44:21,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421958141] [2020-02-10 19:44:21,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:44:21,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:21,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:44:21,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:21,097 INFO L87 Difference]: Start difference. First operand 1572 states and 7069 transitions. Second operand 11 states. [2020-02-10 19:44:21,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:21,324 INFO L93 Difference]: Finished difference Result 3019 states and 11951 transitions. [2020-02-10 19:44:21,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:44:21,325 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:44:21,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:21,333 INFO L225 Difference]: With dead ends: 3019 [2020-02-10 19:44:21,333 INFO L226 Difference]: Without dead ends: 3003 [2020-02-10 19:44:21,333 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:44:21,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3003 states. [2020-02-10 19:44:21,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3003 to 1587. [2020-02-10 19:44:21,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1587 states. [2020-02-10 19:44:21,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 7110 transitions. [2020-02-10 19:44:21,406 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 7110 transitions. Word has length 28 [2020-02-10 19:44:21,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:21,407 INFO L479 AbstractCegarLoop]: Abstraction has 1587 states and 7110 transitions. [2020-02-10 19:44:21,407 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:44:21,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 7110 transitions. [2020-02-10 19:44:21,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:44:21,409 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:21,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] [2020-02-10 19:44:21,409 INFO L427 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:21,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:21,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1401845900, now seen corresponding path program 20 times [2020-02-10 19:44:21,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:21,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489188980] [2020-02-10 19:44:21,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:21,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:21,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 19:44:21,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489188980] [2020-02-10 19:44:21,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:21,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:44:21,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070966227] [2020-02-10 19:44:21,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:44:21,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:21,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:44:21,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:21,992 INFO L87 Difference]: Start difference. First operand 1587 states and 7110 transitions. Second operand 11 states. [2020-02-10 19:44:22,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:22,175 INFO L93 Difference]: Finished difference Result 3023 states and 11952 transitions. [2020-02-10 19:44:22,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:44:22,176 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:44:22,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:22,183 INFO L225 Difference]: With dead ends: 3023 [2020-02-10 19:44:22,183 INFO L226 Difference]: Without dead ends: 2996 [2020-02-10 19:44:22,184 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:44:22,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2996 states. [2020-02-10 19:44:22,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2996 to 1580. [2020-02-10 19:44:22,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 19:44:22,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7090 transitions. [2020-02-10 19:44:22,252 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7090 transitions. Word has length 28 [2020-02-10 19:44:22,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:22,252 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7090 transitions. [2020-02-10 19:44:22,252 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:44:22,252 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7090 transitions. [2020-02-10 19:44:22,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:44:22,255 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:22,255 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:22,255 INFO L427 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:22,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:22,255 INFO L82 PathProgramCache]: Analyzing trace with hash -535607440, now seen corresponding path program 21 times [2020-02-10 19:44:22,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:22,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257815909] [2020-02-10 19:44:22,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:22,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:22,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 19:44:22,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257815909] [2020-02-10 19:44:22,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:22,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:44:22,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816511135] [2020-02-10 19:44:22,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:44:22,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:22,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:44:22,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:22,846 INFO L87 Difference]: Start difference. First operand 1580 states and 7090 transitions. Second operand 11 states. [2020-02-10 19:44:23,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:23,107 INFO L93 Difference]: Finished difference Result 3016 states and 11939 transitions. [2020-02-10 19:44:23,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:44:23,107 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:44:23,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:23,114 INFO L225 Difference]: With dead ends: 3016 [2020-02-10 19:44:23,115 INFO L226 Difference]: Without dead ends: 3000 [2020-02-10 19:44:23,115 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:44:23,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3000 states. [2020-02-10 19:44:23,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3000 to 1586. [2020-02-10 19:44:23,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1586 states. [2020-02-10 19:44:23,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1586 states and 7101 transitions. [2020-02-10 19:44:23,191 INFO L78 Accepts]: Start accepts. Automaton has 1586 states and 7101 transitions. Word has length 28 [2020-02-10 19:44:23,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:23,192 INFO L479 AbstractCegarLoop]: Abstraction has 1586 states and 7101 transitions. [2020-02-10 19:44:23,192 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:44:23,192 INFO L276 IsEmpty]: Start isEmpty. Operand 1586 states and 7101 transitions. [2020-02-10 19:44:23,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:44:23,195 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:23,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] [2020-02-10 19:44:23,196 INFO L427 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:23,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:23,196 INFO L82 PathProgramCache]: Analyzing trace with hash 953797556, now seen corresponding path program 22 times [2020-02-10 19:44:23,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:23,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422585622] [2020-02-10 19:44:23,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:23,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:23,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:23,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422585622] [2020-02-10 19:44:23,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:23,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:44:23,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453885880] [2020-02-10 19:44:23,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:44:23,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:23,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:44:23,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:23,739 INFO L87 Difference]: Start difference. First operand 1586 states and 7101 transitions. Second operand 11 states. [2020-02-10 19:44:23,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:23,936 INFO L93 Difference]: Finished difference Result 3018 states and 11937 transitions. [2020-02-10 19:44:23,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:44:23,936 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:44:23,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:23,944 INFO L225 Difference]: With dead ends: 3018 [2020-02-10 19:44:23,944 INFO L226 Difference]: Without dead ends: 2994 [2020-02-10 19:44:23,945 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:44:24,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2994 states. [2020-02-10 19:44:24,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2994 to 1580. [2020-02-10 19:44:24,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 19:44:24,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7084 transitions. [2020-02-10 19:44:24,041 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7084 transitions. Word has length 28 [2020-02-10 19:44:24,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:24,041 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7084 transitions. [2020-02-10 19:44:24,042 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:44:24,042 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7084 transitions. [2020-02-10 19:44:24,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:44:24,045 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:24,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] [2020-02-10 19:44:24,045 INFO L427 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:24,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:24,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1820036016, now seen corresponding path program 23 times [2020-02-10 19:44:24,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:24,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322220266] [2020-02-10 19:44:24,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:24,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:24,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:24,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322220266] [2020-02-10 19:44:24,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:24,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:44:24,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54796347] [2020-02-10 19:44:24,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:44:24,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:24,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:44:24,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:24,622 INFO L87 Difference]: Start difference. First operand 1580 states and 7084 transitions. Second operand 11 states. [2020-02-10 19:44:24,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:24,788 INFO L93 Difference]: Finished difference Result 3028 states and 11956 transitions. [2020-02-10 19:44:24,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:44:24,789 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:44:24,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:24,796 INFO L225 Difference]: With dead ends: 3028 [2020-02-10 19:44:24,796 INFO L226 Difference]: Without dead ends: 3008 [2020-02-10 19:44:24,796 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:44:24,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3008 states. [2020-02-10 19:44:24,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3008 to 1590. [2020-02-10 19:44:24,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1590 states. [2020-02-10 19:44:24,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1590 states to 1590 states and 7101 transitions. [2020-02-10 19:44:24,897 INFO L78 Accepts]: Start accepts. Automaton has 1590 states and 7101 transitions. Word has length 28 [2020-02-10 19:44:24,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:24,897 INFO L479 AbstractCegarLoop]: Abstraction has 1590 states and 7101 transitions. [2020-02-10 19:44:24,897 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:44:24,897 INFO L276 IsEmpty]: Start isEmpty. Operand 1590 states and 7101 transitions. [2020-02-10 19:44:24,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:44:24,900 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:24,900 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:24,900 INFO L427 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:24,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:24,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1730228782, now seen corresponding path program 24 times [2020-02-10 19:44:24,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:24,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462985880] [2020-02-10 19:44:24,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:24,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:25,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 19:44:25,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462985880] [2020-02-10 19:44:25,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:25,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:44:25,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830141889] [2020-02-10 19:44:25,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:44:25,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:25,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:44:25,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:25,462 INFO L87 Difference]: Start difference. First operand 1590 states and 7101 transitions. Second operand 11 states. [2020-02-10 19:44:25,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:25,725 INFO L93 Difference]: Finished difference Result 3026 states and 11944 transitions. [2020-02-10 19:44:25,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:44:25,726 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:44:25,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:25,733 INFO L225 Difference]: With dead ends: 3026 [2020-02-10 19:44:25,733 INFO L226 Difference]: Without dead ends: 2983 [2020-02-10 19:44:25,734 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:44:25,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2983 states. [2020-02-10 19:44:25,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2983 to 1565. [2020-02-10 19:44:25,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1565 states. [2020-02-10 19:44:25,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 7049 transitions. [2020-02-10 19:44:25,803 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 7049 transitions. Word has length 28 [2020-02-10 19:44:25,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:25,803 INFO L479 AbstractCegarLoop]: Abstraction has 1565 states and 7049 transitions. [2020-02-10 19:44:25,803 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:44:25,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 7049 transitions. [2020-02-10 19:44:25,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:44:25,806 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:25,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] [2020-02-10 19:44:25,806 INFO L427 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:25,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:25,806 INFO L82 PathProgramCache]: Analyzing trace with hash 582955646, now seen corresponding path program 25 times [2020-02-10 19:44:25,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:25,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182314095] [2020-02-10 19:44:25,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:25,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:26,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:26,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182314095] [2020-02-10 19:44:26,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:26,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:44:26,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490056836] [2020-02-10 19:44:26,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:44:26,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:26,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:44:26,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:26,397 INFO L87 Difference]: Start difference. First operand 1565 states and 7049 transitions. Second operand 11 states. [2020-02-10 19:44:26,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:26,623 INFO L93 Difference]: Finished difference Result 2995 states and 11908 transitions. [2020-02-10 19:44:26,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:44:26,623 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:44:26,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:26,630 INFO L225 Difference]: With dead ends: 2995 [2020-02-10 19:44:26,631 INFO L226 Difference]: Without dead ends: 2980 [2020-02-10 19:44:26,631 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:44:26,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2980 states. [2020-02-10 19:44:26,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2980 to 1582. [2020-02-10 19:44:26,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2020-02-10 19:44:26,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 7108 transitions. [2020-02-10 19:44:26,699 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 7108 transitions. Word has length 28 [2020-02-10 19:44:26,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:26,700 INFO L479 AbstractCegarLoop]: Abstraction has 1582 states and 7108 transitions. [2020-02-10 19:44:26,700 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:44:26,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 7108 transitions. [2020-02-10 19:44:26,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:44:26,702 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:26,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] [2020-02-10 19:44:26,703 INFO L427 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:26,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:26,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1327658144, now seen corresponding path program 26 times [2020-02-10 19:44:26,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:26,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612561723] [2020-02-10 19:44:26,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:26,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:27,260 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 29 [2020-02-10 19:44:27,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 19:44:27,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612561723] [2020-02-10 19:44:27,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:27,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:44:27,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731553185] [2020-02-10 19:44:27,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:44:27,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:27,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:44:27,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:27,380 INFO L87 Difference]: Start difference. First operand 1582 states and 7108 transitions. Second operand 11 states. [2020-02-10 19:44:27,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:27,556 INFO L93 Difference]: Finished difference Result 2996 states and 11905 transitions. [2020-02-10 19:44:27,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:44:27,556 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:44:27,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:27,564 INFO L225 Difference]: With dead ends: 2996 [2020-02-10 19:44:27,564 INFO L226 Difference]: Without dead ends: 2975 [2020-02-10 19:44:27,564 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:44:27,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2975 states. [2020-02-10 19:44:27,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2975 to 1577. [2020-02-10 19:44:27,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 19:44:27,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7094 transitions. [2020-02-10 19:44:27,659 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7094 transitions. Word has length 28 [2020-02-10 19:44:27,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:27,659 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7094 transitions. [2020-02-10 19:44:27,659 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:44:27,659 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7094 transitions. [2020-02-10 19:44:27,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:44:27,663 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:27,663 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:27,663 INFO L427 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:27,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:27,663 INFO L82 PathProgramCache]: Analyzing trace with hash -2101070692, now seen corresponding path program 27 times [2020-02-10 19:44:27,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:27,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925221936] [2020-02-10 19:44:27,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:27,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:28,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:28,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925221936] [2020-02-10 19:44:28,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:28,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:44:28,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605521388] [2020-02-10 19:44:28,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:44:28,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:28,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:44:28,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:28,209 INFO L87 Difference]: Start difference. First operand 1577 states and 7094 transitions. Second operand 11 states. [2020-02-10 19:44:28,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:28,435 INFO L93 Difference]: Finished difference Result 3000 states and 11912 transitions. [2020-02-10 19:44:28,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:44:28,435 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:44:28,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:28,443 INFO L225 Difference]: With dead ends: 3000 [2020-02-10 19:44:28,443 INFO L226 Difference]: Without dead ends: 2985 [2020-02-10 19:44:28,443 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:44:28,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2985 states. [2020-02-10 19:44:28,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2985 to 1583. [2020-02-10 19:44:28,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 19:44:28,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7105 transitions. [2020-02-10 19:44:28,525 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7105 transitions. Word has length 28 [2020-02-10 19:44:28,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:28,526 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7105 transitions. [2020-02-10 19:44:28,526 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:44:28,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7105 transitions. [2020-02-10 19:44:28,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:44:28,529 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:28,529 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:28,530 INFO L427 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:28,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:28,530 INFO L82 PathProgramCache]: Analyzing trace with hash -611665696, now seen corresponding path program 28 times [2020-02-10 19:44:28,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:28,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953598489] [2020-02-10 19:44:28,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:28,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:29,135 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 30 [2020-02-10 19:44:29,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:29,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953598489] [2020-02-10 19:44:29,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:29,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:44:29,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582718195] [2020-02-10 19:44:29,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:44:29,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:29,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:44:29,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:29,144 INFO L87 Difference]: Start difference. First operand 1583 states and 7105 transitions. Second operand 11 states. [2020-02-10 19:44:29,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:29,332 INFO L93 Difference]: Finished difference Result 3005 states and 11916 transitions. [2020-02-10 19:44:29,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:44:29,332 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:44:29,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:29,341 INFO L225 Difference]: With dead ends: 3005 [2020-02-10 19:44:29,341 INFO L226 Difference]: Without dead ends: 2979 [2020-02-10 19:44:29,341 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:44:29,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2979 states. [2020-02-10 19:44:29,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2979 to 1577. [2020-02-10 19:44:29,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 19:44:29,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7088 transitions. [2020-02-10 19:44:29,461 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7088 transitions. Word has length 28 [2020-02-10 19:44:29,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:29,462 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7088 transitions. [2020-02-10 19:44:29,462 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:44:29,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7088 transitions. [2020-02-10 19:44:29,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:44:29,465 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:29,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] [2020-02-10 19:44:29,466 INFO L427 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:29,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:29,466 INFO L82 PathProgramCache]: Analyzing trace with hash 254572764, now seen corresponding path program 29 times [2020-02-10 19:44:29,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:29,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444011008] [2020-02-10 19:44:29,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:29,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:30,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:30,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444011008] [2020-02-10 19:44:30,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:30,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:44:30,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766462624] [2020-02-10 19:44:30,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:44:30,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:30,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:44:30,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:30,037 INFO L87 Difference]: Start difference. First operand 1577 states and 7088 transitions. Second operand 11 states. [2020-02-10 19:44:30,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:30,232 INFO L93 Difference]: Finished difference Result 3003 states and 11913 transitions. [2020-02-10 19:44:30,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:44:30,232 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:44:30,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:30,240 INFO L225 Difference]: With dead ends: 3003 [2020-02-10 19:44:30,240 INFO L226 Difference]: Without dead ends: 2987 [2020-02-10 19:44:30,241 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:44:30,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2987 states. [2020-02-10 19:44:30,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2987 to 1584. [2020-02-10 19:44:30,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1584 states. [2020-02-10 19:44:30,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 7101 transitions. [2020-02-10 19:44:30,308 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 7101 transitions. Word has length 28 [2020-02-10 19:44:30,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:30,309 INFO L479 AbstractCegarLoop]: Abstraction has 1584 states and 7101 transitions. [2020-02-10 19:44:30,309 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:44:30,309 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 7101 transitions. [2020-02-10 19:44:30,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:44:30,312 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:30,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] [2020-02-10 19:44:30,312 INFO L427 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:30,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:30,312 INFO L82 PathProgramCache]: Analyzing trace with hash 999275262, now seen corresponding path program 30 times [2020-02-10 19:44:30,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:30,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509803037] [2020-02-10 19:44:30,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:30,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:30,863 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 31 [2020-02-10 19:44:30,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:30,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509803037] [2020-02-10 19:44:30,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:30,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:44:30,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019741072] [2020-02-10 19:44:30,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:44:30,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:30,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:44:30,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:30,872 INFO L87 Difference]: Start difference. First operand 1584 states and 7101 transitions. Second operand 11 states. [2020-02-10 19:44:31,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:31,052 INFO L93 Difference]: Finished difference Result 3007 states and 11914 transitions. [2020-02-10 19:44:31,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:44:31,052 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:44:31,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:31,060 INFO L225 Difference]: With dead ends: 3007 [2020-02-10 19:44:31,061 INFO L226 Difference]: Without dead ends: 2974 [2020-02-10 19:44:31,061 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:44:31,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2974 states. [2020-02-10 19:44:31,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2974 to 1571. [2020-02-10 19:44:31,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 19:44:31,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7071 transitions. [2020-02-10 19:44:31,130 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7071 transitions. Word has length 28 [2020-02-10 19:44:31,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:31,130 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7071 transitions. [2020-02-10 19:44:31,130 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:44:31,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7071 transitions. [2020-02-10 19:44:31,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:44:31,132 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:31,132 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:31,132 INFO L427 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:31,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:31,133 INFO L82 PathProgramCache]: Analyzing trace with hash -242257480, now seen corresponding path program 31 times [2020-02-10 19:44:31,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:31,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78480619] [2020-02-10 19:44:31,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:31,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:31,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:31,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78480619] [2020-02-10 19:44:31,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:31,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:44:31,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467582326] [2020-02-10 19:44:31,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:44:31,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:31,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:44:31,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:31,691 INFO L87 Difference]: Start difference. First operand 1571 states and 7071 transitions. Second operand 11 states. [2020-02-10 19:44:31,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:31,907 INFO L93 Difference]: Finished difference Result 2989 states and 11890 transitions. [2020-02-10 19:44:31,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:44:31,907 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:44:31,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:31,914 INFO L225 Difference]: With dead ends: 2989 [2020-02-10 19:44:31,914 INFO L226 Difference]: Without dead ends: 2974 [2020-02-10 19:44:31,916 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:44:31,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2974 states. [2020-02-10 19:44:31,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2974 to 1581. [2020-02-10 19:44:31,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 19:44:31,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7099 transitions. [2020-02-10 19:44:31,989 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7099 transitions. Word has length 28 [2020-02-10 19:44:31,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:31,989 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7099 transitions. [2020-02-10 19:44:31,989 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:44:31,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7099 transitions. [2020-02-10 19:44:31,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:44:31,992 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:31,992 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:31,993 INFO L427 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:31,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:31,993 INFO L82 PathProgramCache]: Analyzing trace with hash 502445018, now seen corresponding path program 32 times [2020-02-10 19:44:31,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:31,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727676979] [2020-02-10 19:44:31,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:31,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:32,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:32,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727676979] [2020-02-10 19:44:32,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:32,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:44:32,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666046224] [2020-02-10 19:44:32,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:44:32,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:32,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:44:32,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:32,559 INFO L87 Difference]: Start difference. First operand 1581 states and 7099 transitions. Second operand 11 states. [2020-02-10 19:44:32,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:32,743 INFO L93 Difference]: Finished difference Result 2990 states and 11887 transitions. [2020-02-10 19:44:32,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:44:32,743 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:44:32,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:32,750 INFO L225 Difference]: With dead ends: 2990 [2020-02-10 19:44:32,751 INFO L226 Difference]: Without dead ends: 2969 [2020-02-10 19:44:32,751 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:44:32,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2969 states. [2020-02-10 19:44:32,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2969 to 1576. [2020-02-10 19:44:32,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 19:44:32,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7085 transitions. [2020-02-10 19:44:32,819 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7085 transitions. Word has length 28 [2020-02-10 19:44:32,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:32,819 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7085 transitions. [2020-02-10 19:44:32,819 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:44:32,819 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7085 transitions. [2020-02-10 19:44:32,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:44:32,823 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:32,823 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:32,823 INFO L427 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:32,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:32,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1850572662, now seen corresponding path program 33 times [2020-02-10 19:44:32,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:32,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89952209] [2020-02-10 19:44:32,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:32,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:33,305 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 30 [2020-02-10 19:44:33,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 19:44:33,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89952209] [2020-02-10 19:44:33,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:33,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:44:33,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174797620] [2020-02-10 19:44:33,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:44:33,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:33,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:44:33,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:33,424 INFO L87 Difference]: Start difference. First operand 1576 states and 7085 transitions. Second operand 11 states. [2020-02-10 19:44:33,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:33,657 INFO L93 Difference]: Finished difference Result 2990 states and 11887 transitions. [2020-02-10 19:44:33,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:44:33,657 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:44:33,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:33,664 INFO L225 Difference]: With dead ends: 2990 [2020-02-10 19:44:33,664 INFO L226 Difference]: Without dead ends: 2975 [2020-02-10 19:44:33,664 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:44:33,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2975 states. [2020-02-10 19:44:33,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2975 to 1581. [2020-02-10 19:44:33,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 19:44:33,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7094 transitions. [2020-02-10 19:44:33,732 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7094 transitions. Word has length 28 [2020-02-10 19:44:33,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:33,733 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7094 transitions. [2020-02-10 19:44:33,733 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:44:33,733 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7094 transitions. [2020-02-10 19:44:33,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:44:33,735 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:33,735 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:33,735 INFO L427 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:33,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:33,735 INFO L82 PathProgramCache]: Analyzing trace with hash -187919974, now seen corresponding path program 34 times [2020-02-10 19:44:33,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:33,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204304581] [2020-02-10 19:44:33,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:33,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:34,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:34,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204304581] [2020-02-10 19:44:34,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:34,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:44:34,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730480947] [2020-02-10 19:44:34,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:44:34,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:34,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:44:34,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:34,283 INFO L87 Difference]: Start difference. First operand 1581 states and 7094 transitions. Second operand 11 states. [2020-02-10 19:44:34,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:34,475 INFO L93 Difference]: Finished difference Result 2992 states and 11886 transitions. [2020-02-10 19:44:34,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:44:34,476 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:44:34,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:34,483 INFO L225 Difference]: With dead ends: 2992 [2020-02-10 19:44:34,483 INFO L226 Difference]: Without dead ends: 2970 [2020-02-10 19:44:34,484 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:44:34,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2970 states. [2020-02-10 19:44:34,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2970 to 1576. [2020-02-10 19:44:34,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 19:44:34,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7080 transitions. [2020-02-10 19:44:34,551 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7080 transitions. Word has length 28 [2020-02-10 19:44:34,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:34,552 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7080 transitions. [2020-02-10 19:44:34,552 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:44:34,552 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7080 transitions. [2020-02-10 19:44:34,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:44:34,554 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:34,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] [2020-02-10 19:44:34,555 INFO L427 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:34,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:34,555 INFO L82 PathProgramCache]: Analyzing trace with hash 505070794, now seen corresponding path program 35 times [2020-02-10 19:44:34,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:34,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288047151] [2020-02-10 19:44:34,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:34,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:35,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:35,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288047151] [2020-02-10 19:44:35,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:35,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:44:35,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679804106] [2020-02-10 19:44:35,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:44:35,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:35,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:44:35,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:35,106 INFO L87 Difference]: Start difference. First operand 1576 states and 7080 transitions. Second operand 11 states. [2020-02-10 19:44:35,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:35,306 INFO L93 Difference]: Finished difference Result 2993 states and 11889 transitions. [2020-02-10 19:44:35,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:44:35,307 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:44:35,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:35,314 INFO L225 Difference]: With dead ends: 2993 [2020-02-10 19:44:35,315 INFO L226 Difference]: Without dead ends: 2977 [2020-02-10 19:44:35,315 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:44:35,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2977 states. [2020-02-10 19:44:35,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2977 to 1582. [2020-02-10 19:44:35,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2020-02-10 19:44:35,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 7091 transitions. [2020-02-10 19:44:35,384 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 7091 transitions. Word has length 28 [2020-02-10 19:44:35,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:35,385 INFO L479 AbstractCegarLoop]: Abstraction has 1582 states and 7091 transitions. [2020-02-10 19:44:35,385 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:44:35,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 7091 transitions. [2020-02-10 19:44:35,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:44:35,388 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:35,388 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:35,388 INFO L427 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:35,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:35,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1423020984, now seen corresponding path program 36 times [2020-02-10 19:44:35,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:35,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593899976] [2020-02-10 19:44:35,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:35,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:35,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 19:44:35,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593899976] [2020-02-10 19:44:35,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:35,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:44:35,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925226818] [2020-02-10 19:44:35,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:44:35,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:35,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:44:35,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:35,952 INFO L87 Difference]: Start difference. First operand 1582 states and 7091 transitions. Second operand 11 states. [2020-02-10 19:44:36,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:36,228 INFO L93 Difference]: Finished difference Result 2994 states and 11885 transitions. [2020-02-10 19:44:36,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:44:36,228 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:44:36,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:36,234 INFO L225 Difference]: With dead ends: 2994 [2020-02-10 19:44:36,235 INFO L226 Difference]: Without dead ends: 2966 [2020-02-10 19:44:36,235 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:44:36,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2966 states. [2020-02-10 19:44:36,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2966 to 1571. [2020-02-10 19:44:36,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 19:44:36,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7066 transitions. [2020-02-10 19:44:36,303 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7066 transitions. Word has length 28 [2020-02-10 19:44:36,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:36,304 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7066 transitions. [2020-02-10 19:44:36,304 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:44:36,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7066 transitions. [2020-02-10 19:44:36,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:44:36,306 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:36,306 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:36,306 INFO L427 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:36,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:36,306 INFO L82 PathProgramCache]: Analyzing trace with hash -231754376, now seen corresponding path program 37 times [2020-02-10 19:44:36,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:36,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38796189] [2020-02-10 19:44:36,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:36,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:36,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 19:44:36,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38796189] [2020-02-10 19:44:36,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:36,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:44:36,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781937765] [2020-02-10 19:44:36,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:44:36,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:36,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:44:36,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:36,853 INFO L87 Difference]: Start difference. First operand 1571 states and 7066 transitions. Second operand 11 states. [2020-02-10 19:44:37,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:37,111 INFO L93 Difference]: Finished difference Result 3002 states and 11911 transitions. [2020-02-10 19:44:37,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:44:37,112 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:44:37,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:37,119 INFO L225 Difference]: With dead ends: 3002 [2020-02-10 19:44:37,119 INFO L226 Difference]: Without dead ends: 2987 [2020-02-10 19:44:37,119 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:44:37,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2987 states. [2020-02-10 19:44:37,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2987 to 1583. [2020-02-10 19:44:37,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 19:44:37,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7099 transitions. [2020-02-10 19:44:37,187 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7099 transitions. Word has length 28 [2020-02-10 19:44:37,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:37,188 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7099 transitions. [2020-02-10 19:44:37,188 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:44:37,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7099 transitions. [2020-02-10 19:44:37,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:44:37,190 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:37,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] [2020-02-10 19:44:37,190 INFO L427 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:37,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:37,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1257650620, now seen corresponding path program 38 times [2020-02-10 19:44:37,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:37,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918533731] [2020-02-10 19:44:37,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:37,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:37,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:37,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918533731] [2020-02-10 19:44:37,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:37,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:44:37,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231939970] [2020-02-10 19:44:37,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:44:37,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:37,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:44:37,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:37,788 INFO L87 Difference]: Start difference. First operand 1583 states and 7099 transitions. Second operand 11 states. [2020-02-10 19:44:37,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:37,955 INFO L93 Difference]: Finished difference Result 3007 states and 11915 transitions. [2020-02-10 19:44:37,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:44:37,956 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:44:37,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:37,963 INFO L225 Difference]: With dead ends: 3007 [2020-02-10 19:44:37,963 INFO L226 Difference]: Without dead ends: 2981 [2020-02-10 19:44:37,963 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:44:38,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2981 states. [2020-02-10 19:44:38,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2981 to 1577. [2020-02-10 19:44:38,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 19:44:38,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7082 transitions. [2020-02-10 19:44:38,034 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7082 transitions. Word has length 28 [2020-02-10 19:44:38,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:38,035 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7082 transitions. [2020-02-10 19:44:38,035 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:44:38,035 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7082 transitions. [2020-02-10 19:44:38,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:44:38,038 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:38,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] [2020-02-10 19:44:38,038 INFO L427 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:38,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:38,039 INFO L82 PathProgramCache]: Analyzing trace with hash 843956780, now seen corresponding path program 39 times [2020-02-10 19:44:38,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:38,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603989216] [2020-02-10 19:44:38,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:38,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:38,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 19:44:38,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603989216] [2020-02-10 19:44:38,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:38,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:44:38,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754351383] [2020-02-10 19:44:38,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:44:38,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:38,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:44:38,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:38,614 INFO L87 Difference]: Start difference. First operand 1577 states and 7082 transitions. Second operand 11 states. [2020-02-10 19:44:38,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:38,812 INFO L93 Difference]: Finished difference Result 2998 states and 11898 transitions. [2020-02-10 19:44:38,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:44:38,812 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:44:38,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:38,819 INFO L225 Difference]: With dead ends: 2998 [2020-02-10 19:44:38,819 INFO L226 Difference]: Without dead ends: 2983 [2020-02-10 19:44:38,819 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:44:38,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2983 states. [2020-02-10 19:44:38,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2983 to 1582. [2020-02-10 19:44:38,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2020-02-10 19:44:38,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 7091 transitions. [2020-02-10 19:44:38,891 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 7091 transitions. Word has length 28 [2020-02-10 19:44:38,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:38,892 INFO L479 AbstractCegarLoop]: Abstraction has 1582 states and 7091 transitions. [2020-02-10 19:44:38,892 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:44:38,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 7091 transitions. [2020-02-10 19:44:38,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:44:38,894 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:38,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] [2020-02-10 19:44:38,894 INFO L427 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:38,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:38,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1788357828, now seen corresponding path program 40 times [2020-02-10 19:44:38,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:38,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089726023] [2020-02-10 19:44:38,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:38,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:39,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 19:44:39,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089726023] [2020-02-10 19:44:39,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:39,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:44:39,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697277670] [2020-02-10 19:44:39,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:44:39,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:39,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:44:39,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:39,427 INFO L87 Difference]: Start difference. First operand 1582 states and 7091 transitions. Second operand 11 states. [2020-02-10 19:44:39,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:39,646 INFO L93 Difference]: Finished difference Result 3000 states and 11897 transitions. [2020-02-10 19:44:39,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:44:39,646 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:44:39,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:39,653 INFO L225 Difference]: With dead ends: 3000 [2020-02-10 19:44:39,653 INFO L226 Difference]: Without dead ends: 2978 [2020-02-10 19:44:39,654 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:44:39,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2978 states. [2020-02-10 19:44:39,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2978 to 1577. [2020-02-10 19:44:39,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 19:44:39,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7077 transitions. [2020-02-10 19:44:39,723 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7077 transitions. Word has length 28 [2020-02-10 19:44:39,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:39,723 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7077 transitions. [2020-02-10 19:44:39,723 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:44:39,723 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7077 transitions. [2020-02-10 19:44:39,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:44:39,725 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:39,725 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:39,725 INFO L427 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:39,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:39,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1260276396, now seen corresponding path program 41 times [2020-02-10 19:44:39,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:39,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634380184] [2020-02-10 19:44:39,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:39,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:40,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:40,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634380184] [2020-02-10 19:44:40,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:40,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:44:40,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115111088] [2020-02-10 19:44:40,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:44:40,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:40,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:44:40,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:40,311 INFO L87 Difference]: Start difference. First operand 1577 states and 7077 transitions. Second operand 11 states. [2020-02-10 19:44:40,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:40,540 INFO L93 Difference]: Finished difference Result 3011 states and 11919 transitions. [2020-02-10 19:44:40,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:44:40,540 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:44:40,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:40,548 INFO L225 Difference]: With dead ends: 3011 [2020-02-10 19:44:40,548 INFO L226 Difference]: Without dead ends: 2991 [2020-02-10 19:44:40,548 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:44:40,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2991 states. [2020-02-10 19:44:40,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2991 to 1585. [2020-02-10 19:44:40,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1585 states. [2020-02-10 19:44:40,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 7091 transitions. [2020-02-10 19:44:40,618 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 7091 transitions. Word has length 28 [2020-02-10 19:44:40,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:40,618 INFO L479 AbstractCegarLoop]: Abstraction has 1585 states and 7091 transitions. [2020-02-10 19:44:40,618 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:44:40,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 7091 transitions. [2020-02-10 19:44:40,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:44:40,621 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:40,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] [2020-02-10 19:44:40,621 INFO L427 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:40,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:40,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1433524088, now seen corresponding path program 42 times [2020-02-10 19:44:40,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:40,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973864405] [2020-02-10 19:44:40,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:40,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:41,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 19:44:41,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973864405] [2020-02-10 19:44:41,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:41,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:44:41,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341269350] [2020-02-10 19:44:41,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:44:41,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:41,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:44:41,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:41,174 INFO L87 Difference]: Start difference. First operand 1585 states and 7091 transitions. Second operand 11 states. [2020-02-10 19:44:41,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:41,452 INFO L93 Difference]: Finished difference Result 3008 states and 11906 transitions. [2020-02-10 19:44:41,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:44:41,453 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:44:41,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:41,461 INFO L225 Difference]: With dead ends: 3008 [2020-02-10 19:44:41,461 INFO L226 Difference]: Without dead ends: 2977 [2020-02-10 19:44:41,461 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:44:41,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2977 states. [2020-02-10 19:44:41,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2977 to 1571. [2020-02-10 19:44:41,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 19:44:41,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7060 transitions. [2020-02-10 19:44:41,530 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7060 transitions. Word has length 28 [2020-02-10 19:44:41,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:41,530 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7060 transitions. [2020-02-10 19:44:41,530 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:44:41,530 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7060 transitions. [2020-02-10 19:44:41,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:44:41,532 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:41,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] [2020-02-10 19:44:41,533 INFO L427 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:41,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:41,533 INFO L82 PathProgramCache]: Analyzing trace with hash 523451226, now seen corresponding path program 43 times [2020-02-10 19:44:41,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:41,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412876197] [2020-02-10 19:44:41,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:41,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:42,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:42,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412876197] [2020-02-10 19:44:42,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:42,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:44:42,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254968278] [2020-02-10 19:44:42,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:44:42,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:42,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:44:42,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:42,124 INFO L87 Difference]: Start difference. First operand 1571 states and 7060 transitions. Second operand 11 states. [2020-02-10 19:44:42,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:42,387 INFO L93 Difference]: Finished difference Result 3009 states and 11924 transitions. [2020-02-10 19:44:42,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:44:42,388 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:44:42,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:42,395 INFO L225 Difference]: With dead ends: 3009 [2020-02-10 19:44:42,395 INFO L226 Difference]: Without dead ends: 2993 [2020-02-10 19:44:42,395 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:44:42,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2993 states. [2020-02-10 19:44:42,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2993 to 1585. [2020-02-10 19:44:42,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1585 states. [2020-02-10 19:44:42,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 7099 transitions. [2020-02-10 19:44:42,466 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 7099 transitions. Word has length 28 [2020-02-10 19:44:42,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:42,466 INFO L479 AbstractCegarLoop]: Abstraction has 1585 states and 7099 transitions. [2020-02-10 19:44:42,466 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:44:42,466 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 7099 transitions. [2020-02-10 19:44:42,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:44:42,469 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:42,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] [2020-02-10 19:44:42,469 INFO L427 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:42,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:42,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1268153724, now seen corresponding path program 44 times [2020-02-10 19:44:42,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:42,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168745980] [2020-02-10 19:44:42,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:42,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:43,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:43,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168745980] [2020-02-10 19:44:43,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:43,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:44:43,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067763771] [2020-02-10 19:44:43,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:44:43,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:43,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:44:43,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:43,035 INFO L87 Difference]: Start difference. First operand 1585 states and 7099 transitions. Second operand 11 states. [2020-02-10 19:44:43,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:43,274 INFO L93 Difference]: Finished difference Result 3013 states and 11925 transitions. [2020-02-10 19:44:43,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:44:43,274 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:44:43,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:43,282 INFO L225 Difference]: With dead ends: 3013 [2020-02-10 19:44:43,282 INFO L226 Difference]: Without dead ends: 2986 [2020-02-10 19:44:43,282 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:44:43,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2986 states. [2020-02-10 19:44:43,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2986 to 1578. [2020-02-10 19:44:43,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 19:44:43,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7079 transitions. [2020-02-10 19:44:43,350 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7079 transitions. Word has length 28 [2020-02-10 19:44:43,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:43,351 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7079 transitions. [2020-02-10 19:44:43,351 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:44:43,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7079 transitions. [2020-02-10 19:44:43,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:44:43,353 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:43,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] [2020-02-10 19:44:43,353 INFO L427 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:43,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:43,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1599162382, now seen corresponding path program 45 times [2020-02-10 19:44:43,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:43,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240655228] [2020-02-10 19:44:43,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:43,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:43,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:43,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240655228] [2020-02-10 19:44:43,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:43,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:44:43,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131835847] [2020-02-10 19:44:43,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:44:43,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:43,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:44:43,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:43,902 INFO L87 Difference]: Start difference. First operand 1578 states and 7079 transitions. Second operand 11 states. [2020-02-10 19:44:44,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:44,094 INFO L93 Difference]: Finished difference Result 3005 states and 11910 transitions. [2020-02-10 19:44:44,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:44:44,095 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:44:44,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:44,102 INFO L225 Difference]: With dead ends: 3005 [2020-02-10 19:44:44,103 INFO L226 Difference]: Without dead ends: 2989 [2020-02-10 19:44:44,103 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:44:44,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2989 states. [2020-02-10 19:44:44,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2989 to 1584. [2020-02-10 19:44:44,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1584 states. [2020-02-10 19:44:44,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 7090 transitions. [2020-02-10 19:44:44,171 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 7090 transitions. Word has length 28 [2020-02-10 19:44:44,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:44,171 INFO L479 AbstractCegarLoop]: Abstraction has 1584 states and 7090 transitions. [2020-02-10 19:44:44,171 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:44:44,171 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 7090 transitions. [2020-02-10 19:44:44,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:44:44,173 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:44,173 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:44,174 INFO L427 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:44,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:44,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1777854724, now seen corresponding path program 46 times [2020-02-10 19:44:44,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:44,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390782993] [2020-02-10 19:44:44,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:44,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:44,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 19:44:44,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390782993] [2020-02-10 19:44:44,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:44,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:44:44,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511372053] [2020-02-10 19:44:44,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:44:44,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:44,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:44:44,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:44,807 INFO L87 Difference]: Start difference. First operand 1584 states and 7090 transitions. Second operand 11 states. [2020-02-10 19:44:44,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:44,985 INFO L93 Difference]: Finished difference Result 3006 states and 11906 transitions. [2020-02-10 19:44:44,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:44:44,985 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:44:44,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:44,992 INFO L225 Difference]: With dead ends: 3006 [2020-02-10 19:44:44,993 INFO L226 Difference]: Without dead ends: 2983 [2020-02-10 19:44:44,993 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:44:45,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2983 states. [2020-02-10 19:44:45,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2983 to 1578. [2020-02-10 19:44:45,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 19:44:45,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7073 transitions. [2020-02-10 19:44:45,068 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7073 transitions. Word has length 28 [2020-02-10 19:44:45,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:45,068 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7073 transitions. [2020-02-10 19:44:45,068 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:44:45,068 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7073 transitions. [2020-02-10 19:44:45,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:44:45,072 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:45,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] [2020-02-10 19:44:45,072 INFO L427 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:45,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:45,073 INFO L82 PathProgramCache]: Analyzing trace with hash -340161458, now seen corresponding path program 47 times [2020-02-10 19:44:45,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:45,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111813037] [2020-02-10 19:44:45,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:45,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:45,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 19:44:45,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111813037] [2020-02-10 19:44:45,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:45,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:44:45,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820559951] [2020-02-10 19:44:45,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:44:45,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:45,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:44:45,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:45,629 INFO L87 Difference]: Start difference. First operand 1578 states and 7073 transitions. Second operand 11 states. [2020-02-10 19:44:45,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:45,762 INFO L93 Difference]: Finished difference Result 3015 states and 11923 transitions. [2020-02-10 19:44:45,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:44:45,763 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:44:45,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:45,770 INFO L225 Difference]: With dead ends: 3015 [2020-02-10 19:44:45,770 INFO L226 Difference]: Without dead ends: 2995 [2020-02-10 19:44:45,771 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:44:45,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2995 states. [2020-02-10 19:44:45,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2995 to 1586. [2020-02-10 19:44:45,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1586 states. [2020-02-10 19:44:45,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1586 states and 7087 transitions. [2020-02-10 19:44:45,841 INFO L78 Accepts]: Start accepts. Automaton has 1586 states and 7087 transitions. Word has length 28 [2020-02-10 19:44:45,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:45,841 INFO L479 AbstractCegarLoop]: Abstraction has 1586 states and 7087 transitions. [2020-02-10 19:44:45,841 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:44:45,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1586 states and 7087 transitions. [2020-02-10 19:44:45,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:44:45,843 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:45,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] [2020-02-10 19:44:45,843 INFO L427 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:45,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:45,844 INFO L82 PathProgramCache]: Analyzing trace with hash -166913766, now seen corresponding path program 48 times [2020-02-10 19:44:45,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:45,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070021888] [2020-02-10 19:44:45,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:45,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:46,212 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 27 [2020-02-10 19:44:46,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:46,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070021888] [2020-02-10 19:44:46,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:46,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:44:46,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180399868] [2020-02-10 19:44:46,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:44:46,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:46,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:44:46,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:46,433 INFO L87 Difference]: Start difference. First operand 1586 states and 7087 transitions. Second operand 11 states. [2020-02-10 19:44:46,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:46,618 INFO L93 Difference]: Finished difference Result 3012 states and 11910 transitions. [2020-02-10 19:44:46,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:44:46,619 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:44:46,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:46,626 INFO L225 Difference]: With dead ends: 3012 [2020-02-10 19:44:46,626 INFO L226 Difference]: Without dead ends: 2974 [2020-02-10 19:44:46,626 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:44:46,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2974 states. [2020-02-10 19:44:46,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2974 to 1565. [2020-02-10 19:44:46,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1565 states. [2020-02-10 19:44:46,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 7043 transitions. [2020-02-10 19:44:46,700 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 7043 transitions. Word has length 28 [2020-02-10 19:44:46,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:46,700 INFO L479 AbstractCegarLoop]: Abstraction has 1565 states and 7043 transitions. [2020-02-10 19:44:46,700 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:44:46,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 7043 transitions. [2020-02-10 19:44:46,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:44:46,703 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:46,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] [2020-02-10 19:44:46,703 INFO L427 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:46,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:46,703 INFO L82 PathProgramCache]: Analyzing trace with hash 15547412, now seen corresponding path program 49 times [2020-02-10 19:44:46,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:46,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635032447] [2020-02-10 19:44:46,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:46,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:47,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:47,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635032447] [2020-02-10 19:44:47,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:47,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:44:47,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476253733] [2020-02-10 19:44:47,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:44:47,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:47,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:44:47,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:47,302 INFO L87 Difference]: Start difference. First operand 1565 states and 7043 transitions. Second operand 11 states. [2020-02-10 19:44:47,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:47,481 INFO L93 Difference]: Finished difference Result 2981 states and 11870 transitions. [2020-02-10 19:44:47,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:44:47,482 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:44:47,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:47,489 INFO L225 Difference]: With dead ends: 2981 [2020-02-10 19:44:47,489 INFO L226 Difference]: Without dead ends: 2966 [2020-02-10 19:44:47,490 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:44:47,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2966 states. [2020-02-10 19:44:47,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2966 to 1580. [2020-02-10 19:44:47,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 19:44:47,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7095 transitions. [2020-02-10 19:44:47,564 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7095 transitions. Word has length 28 [2020-02-10 19:44:47,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:47,564 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7095 transitions. [2020-02-10 19:44:47,564 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:44:47,564 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7095 transitions. [2020-02-10 19:44:47,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:44:47,566 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44: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] [2020-02-10 19:44:47,567 INFO L427 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:47,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:47,567 INFO L82 PathProgramCache]: Analyzing trace with hash 760249910, now seen corresponding path program 50 times [2020-02-10 19:44:47,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:47,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141539258] [2020-02-10 19:44:47,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:47,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:48,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:48,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141539258] [2020-02-10 19:44:48,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:48,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:44:48,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946366279] [2020-02-10 19:44:48,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:44:48,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:48,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:44:48,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:48,108 INFO L87 Difference]: Start difference. First operand 1580 states and 7095 transitions. Second operand 11 states. [2020-02-10 19:44:48,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:48,280 INFO L93 Difference]: Finished difference Result 2982 states and 11867 transitions. [2020-02-10 19:44:48,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:44:48,281 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:44:48,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:48,288 INFO L225 Difference]: With dead ends: 2982 [2020-02-10 19:44:48,289 INFO L226 Difference]: Without dead ends: 2961 [2020-02-10 19:44:48,289 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:44:48,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2961 states. [2020-02-10 19:44:48,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2961 to 1575. [2020-02-10 19:44:48,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 19:44:48,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7081 transitions. [2020-02-10 19:44:48,359 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7081 transitions. Word has length 28 [2020-02-10 19:44:48,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:48,359 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7081 transitions. [2020-02-10 19:44:48,359 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:44:48,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7081 transitions. [2020-02-10 19:44:48,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:44:48,361 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:48,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] [2020-02-10 19:44:48,362 INFO L427 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:48,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:48,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1057537968, now seen corresponding path program 51 times [2020-02-10 19:44:48,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:48,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764751981] [2020-02-10 19:44:48,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:48,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:48,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:48,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764751981] [2020-02-10 19:44:48,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:48,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:44:48,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596260855] [2020-02-10 19:44:48,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:44:48,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:48,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:44:48,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:48,909 INFO L87 Difference]: Start difference. First operand 1575 states and 7081 transitions. Second operand 11 states. [2020-02-10 19:44:49,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:49,090 INFO L93 Difference]: Finished difference Result 2983 states and 11869 transitions. [2020-02-10 19:44:49,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:44:49,091 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:44:49,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:49,098 INFO L225 Difference]: With dead ends: 2983 [2020-02-10 19:44:49,098 INFO L226 Difference]: Without dead ends: 2968 [2020-02-10 19:44:49,099 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:44:49,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2968 states. [2020-02-10 19:44:49,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2968 to 1580. [2020-02-10 19:44:49,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 19:44:49,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7090 transitions. [2020-02-10 19:44:49,166 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7090 transitions. Word has length 28 [2020-02-10 19:44:49,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:49,166 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7090 transitions. [2020-02-10 19:44:49,166 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:44:49,167 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7090 transitions. [2020-02-10 19:44:49,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:44:49,169 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:49,169 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:49,169 INFO L427 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:49,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:49,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1176569526, now seen corresponding path program 52 times [2020-02-10 19:44:49,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:49,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775364461] [2020-02-10 19:44:49,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:49,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:49,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:49,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775364461] [2020-02-10 19:44:49,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:49,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:44:49,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828003283] [2020-02-10 19:44:49,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:44:49,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:49,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:44:49,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:49,735 INFO L87 Difference]: Start difference. First operand 1580 states and 7090 transitions. Second operand 11 states. [2020-02-10 19:44:49,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:49,918 INFO L93 Difference]: Finished difference Result 2986 states and 11870 transitions. [2020-02-10 19:44:49,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:44:49,918 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:44:49,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:49,925 INFO L225 Difference]: With dead ends: 2986 [2020-02-10 19:44:49,925 INFO L226 Difference]: Without dead ends: 2963 [2020-02-10 19:44:49,926 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:44:49,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2963 states. [2020-02-10 19:44:49,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2963 to 1575. [2020-02-10 19:44:49,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 19:44:49,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7076 transitions. [2020-02-10 19:44:49,994 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7076 transitions. Word has length 28 [2020-02-10 19:44:49,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:49,995 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7076 transitions. [2020-02-10 19:44:49,995 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:44:49,995 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7076 transitions. [2020-02-10 19:44:49,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:44:49,997 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:49,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] [2020-02-10 19:44:49,997 INFO L427 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:49,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:49,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1298105488, now seen corresponding path program 53 times [2020-02-10 19:44:49,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:49,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554240294] [2020-02-10 19:44:49,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:49,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:50,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 19:44:50,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554240294] [2020-02-10 19:44:50,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:50,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:44:50,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192855451] [2020-02-10 19:44:50,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:44:50,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:50,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:44:50,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:50,605 INFO L87 Difference]: Start difference. First operand 1575 states and 7076 transitions. Second operand 11 states. [2020-02-10 19:44:50,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:50,799 INFO L93 Difference]: Finished difference Result 2986 states and 11871 transitions. [2020-02-10 19:44:50,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:44:50,800 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:44:50,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:50,808 INFO L225 Difference]: With dead ends: 2986 [2020-02-10 19:44:50,808 INFO L226 Difference]: Without dead ends: 2970 [2020-02-10 19:44:50,808 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:44:50,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2970 states. [2020-02-10 19:44:50,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2970 to 1581. [2020-02-10 19:44:50,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 19:44:50,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7087 transitions. [2020-02-10 19:44:50,878 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7087 transitions. Word has length 28 [2020-02-10 19:44:50,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:50,878 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7087 transitions. [2020-02-10 19:44:50,878 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:44:50,878 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7087 transitions. [2020-02-10 19:44:50,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:44:50,881 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:50,881 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:50,881 INFO L427 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:50,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:50,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1507456812, now seen corresponding path program 54 times [2020-02-10 19:44:50,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:50,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636482701] [2020-02-10 19:44:50,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:50,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:51,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:51,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636482701] [2020-02-10 19:44:51,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:51,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:44:51,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698325182] [2020-02-10 19:44:51,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:44:51,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:51,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:44:51,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:51,417 INFO L87 Difference]: Start difference. First operand 1581 states and 7087 transitions. Second operand 11 states. [2020-02-10 19:44:51,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:51,596 INFO L93 Difference]: Finished difference Result 2988 states and 11869 transitions. [2020-02-10 19:44:51,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:44:51,596 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:44:51,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:51,603 INFO L225 Difference]: With dead ends: 2988 [2020-02-10 19:44:51,604 INFO L226 Difference]: Without dead ends: 2959 [2020-02-10 19:44:51,604 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:44:51,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2959 states. [2020-02-10 19:44:51,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2959 to 1570. [2020-02-10 19:44:51,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 19:44:51,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7062 transitions. [2020-02-10 19:44:51,672 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7062 transitions. Word has length 28 [2020-02-10 19:44:51,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:51,672 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7062 transitions. [2020-02-10 19:44:51,672 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:44:51,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7062 transitions. [2020-02-10 19:44:51,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:44:51,675 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:51,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] [2020-02-10 19:44:51,675 INFO L427 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:51,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:51,675 INFO L82 PathProgramCache]: Analyzing trace with hash 603292734, now seen corresponding path program 55 times [2020-02-10 19:44:51,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:51,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711059040] [2020-02-10 19:44:51,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:51,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:52,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:52,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711059040] [2020-02-10 19:44:52,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:52,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:44:52,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238301457] [2020-02-10 19:44:52,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:44:52,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:52,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:44:52,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:52,217 INFO L87 Difference]: Start difference. First operand 1570 states and 7062 transitions. Second operand 11 states. [2020-02-10 19:44:52,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:52,384 INFO L93 Difference]: Finished difference Result 2980 states and 11863 transitions. [2020-02-10 19:44:52,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:44:52,384 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:44:52,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:52,391 INFO L225 Difference]: With dead ends: 2980 [2020-02-10 19:44:52,391 INFO L226 Difference]: Without dead ends: 2965 [2020-02-10 19:44:52,391 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:44:52,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2965 states. [2020-02-10 19:44:52,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2965 to 1580. [2020-02-10 19:44:52,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 19:44:52,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7090 transitions. [2020-02-10 19:44:52,459 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7090 transitions. Word has length 28 [2020-02-10 19:44:52,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:52,460 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7090 transitions. [2020-02-10 19:44:52,460 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:44:52,460 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7090 transitions. [2020-02-10 19:44:52,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:44:52,462 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:52,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] [2020-02-10 19:44:52,462 INFO L427 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:52,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:52,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1347995232, now seen corresponding path program 56 times [2020-02-10 19:44:52,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:52,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980332333] [2020-02-10 19:44:52,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:52,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:52,904 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 30 [2020-02-10 19:44:53,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 19:44:53,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980332333] [2020-02-10 19:44:53,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:53,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:44:53,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310729767] [2020-02-10 19:44:53,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:44:53,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:53,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:44:53,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:53,027 INFO L87 Difference]: Start difference. First operand 1580 states and 7090 transitions. Second operand 11 states. [2020-02-10 19:44:53,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:53,221 INFO L93 Difference]: Finished difference Result 2981 states and 11860 transitions. [2020-02-10 19:44:53,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:44:53,222 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:44:53,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:53,229 INFO L225 Difference]: With dead ends: 2981 [2020-02-10 19:44:53,229 INFO L226 Difference]: Without dead ends: 2960 [2020-02-10 19:44:53,229 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:44:53,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2960 states. [2020-02-10 19:44:53,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2960 to 1575. [2020-02-10 19:44:53,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 19:44:53,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7076 transitions. [2020-02-10 19:44:53,297 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7076 transitions. Word has length 28 [2020-02-10 19:44:53,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:53,297 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7076 transitions. [2020-02-10 19:44:53,297 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:44:53,298 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7076 transitions. [2020-02-10 19:44:53,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:44:53,300 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:53,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] [2020-02-10 19:44:53,300 INFO L427 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:53,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:53,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1005022448, now seen corresponding path program 57 times [2020-02-10 19:44:53,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:53,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855537857] [2020-02-10 19:44:53,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:53,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:53,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:53,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855537857] [2020-02-10 19:44:53,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:53,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:44:53,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099544564] [2020-02-10 19:44:53,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:44:53,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:53,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:44:53,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:53,863 INFO L87 Difference]: Start difference. First operand 1575 states and 7076 transitions. Second operand 11 states. [2020-02-10 19:44:54,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:54,124 INFO L93 Difference]: Finished difference Result 2981 states and 11860 transitions. [2020-02-10 19:44:54,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:44:54,124 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:44:54,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:54,135 INFO L225 Difference]: With dead ends: 2981 [2020-02-10 19:44:54,136 INFO L226 Difference]: Without dead ends: 2966 [2020-02-10 19:44:54,136 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:44:54,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2966 states. [2020-02-10 19:44:54,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2966 to 1580. [2020-02-10 19:44:54,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 19:44:54,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7085 transitions. [2020-02-10 19:44:54,259 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7085 transitions. Word has length 28 [2020-02-10 19:44:54,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:54,259 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7085 transitions. [2020-02-10 19:44:54,260 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:44:54,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7085 transitions. [2020-02-10 19:44:54,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:44:54,263 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:54,263 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:54,264 INFO L427 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:54,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:54,264 INFO L82 PathProgramCache]: Analyzing trace with hash 657630240, now seen corresponding path program 58 times [2020-02-10 19:44:54,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:54,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385107057] [2020-02-10 19:44:54,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:54,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:54,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 19:44:54,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385107057] [2020-02-10 19:44:54,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:54,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:44:54,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369216606] [2020-02-10 19:44:54,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:44:54,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:54,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:44:54,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:54,842 INFO L87 Difference]: Start difference. First operand 1580 states and 7085 transitions. Second operand 11 states. [2020-02-10 19:44:55,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:55,024 INFO L93 Difference]: Finished difference Result 2983 states and 11859 transitions. [2020-02-10 19:44:55,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:44:55,025 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:44:55,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:55,032 INFO L225 Difference]: With dead ends: 2983 [2020-02-10 19:44:55,032 INFO L226 Difference]: Without dead ends: 2961 [2020-02-10 19:44:55,033 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:44:55,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2961 states. [2020-02-10 19:44:55,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2961 to 1575. [2020-02-10 19:44:55,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 19:44:55,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7071 transitions. [2020-02-10 19:44:55,128 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7071 transitions. Word has length 28 [2020-02-10 19:44:55,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:55,128 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7071 transitions. [2020-02-10 19:44:55,128 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:44:55,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7071 transitions. [2020-02-10 19:44:55,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:44:55,130 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:55,130 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:55,131 INFO L427 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:55,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:55,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1350621008, now seen corresponding path program 59 times [2020-02-10 19:44:55,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:55,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971399290] [2020-02-10 19:44:55,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:55,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:55,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:55,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971399290] [2020-02-10 19:44:55,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:55,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:44:55,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182060457] [2020-02-10 19:44:55,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:44:55,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:55,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:44:55,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:55,684 INFO L87 Difference]: Start difference. First operand 1575 states and 7071 transitions. Second operand 11 states. [2020-02-10 19:44:55,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:55,863 INFO L93 Difference]: Finished difference Result 2984 states and 11862 transitions. [2020-02-10 19:44:55,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:44:55,863 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:44:55,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:55,870 INFO L225 Difference]: With dead ends: 2984 [2020-02-10 19:44:55,870 INFO L226 Difference]: Without dead ends: 2968 [2020-02-10 19:44:55,871 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:44:55,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2968 states. [2020-02-10 19:44:55,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2968 to 1581. [2020-02-10 19:44:55,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 19:44:55,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7082 transitions. [2020-02-10 19:44:55,938 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7082 transitions. Word has length 28 [2020-02-10 19:44:55,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:55,939 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7082 transitions. [2020-02-10 19:44:55,939 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:44:55,939 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7082 transitions. [2020-02-10 19:44:55,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:44:55,941 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:55,941 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:55,942 INFO L427 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:55,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:55,942 INFO L82 PathProgramCache]: Analyzing trace with hash -2026396098, now seen corresponding path program 60 times [2020-02-10 19:44:55,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:55,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482415145] [2020-02-10 19:44:55,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:55,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:56,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 19:44:56,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482415145] [2020-02-10 19:44:56,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:56,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:44:56,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327477512] [2020-02-10 19:44:56,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:44:56,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:56,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:44:56,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:56,503 INFO L87 Difference]: Start difference. First operand 1581 states and 7082 transitions. Second operand 11 states. [2020-02-10 19:44:56,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:56,684 INFO L93 Difference]: Finished difference Result 2985 states and 11858 transitions. [2020-02-10 19:44:56,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:44:56,685 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:44:56,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:56,692 INFO L225 Difference]: With dead ends: 2985 [2020-02-10 19:44:56,692 INFO L226 Difference]: Without dead ends: 2957 [2020-02-10 19:44:56,692 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:44:56,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2957 states. [2020-02-10 19:44:56,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2957 to 1570. [2020-02-10 19:44:56,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 19:44:56,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7057 transitions. [2020-02-10 19:44:56,760 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7057 transitions. Word has length 28 [2020-02-10 19:44:56,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:56,761 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7057 transitions. [2020-02-10 19:44:56,761 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:44:56,761 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7057 transitions. [2020-02-10 19:44:56,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:44:56,763 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:56,763 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:56,763 INFO L427 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:56,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:56,763 INFO L82 PathProgramCache]: Analyzing trace with hash 624298942, now seen corresponding path program 61 times [2020-02-10 19:44:56,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:56,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095500574] [2020-02-10 19:44:56,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:56,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:57,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:57,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095500574] [2020-02-10 19:44:57,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:57,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:44:57,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474030023] [2020-02-10 19:44:57,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:44:57,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:57,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:44:57,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:57,295 INFO L87 Difference]: Start difference. First operand 1570 states and 7057 transitions. Second operand 11 states. [2020-02-10 19:44:57,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:57,474 INFO L93 Difference]: Finished difference Result 2985 states and 11869 transitions. [2020-02-10 19:44:57,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:44:57,475 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:44:57,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:57,482 INFO L225 Difference]: With dead ends: 2985 [2020-02-10 19:44:57,483 INFO L226 Difference]: Without dead ends: 2970 [2020-02-10 19:44:57,483 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:44:57,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2970 states. [2020-02-10 19:44:57,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2970 to 1580. [2020-02-10 19:44:57,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 19:44:57,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7085 transitions. [2020-02-10 19:44:57,550 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7085 transitions. Word has length 28 [2020-02-10 19:44:57,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:57,551 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7085 transitions. [2020-02-10 19:44:57,551 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:44:57,551 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7085 transitions. [2020-02-10 19:44:57,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:44:57,553 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:57,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] [2020-02-10 19:44:57,553 INFO L427 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:57,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:57,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1436560860, now seen corresponding path program 62 times [2020-02-10 19:44:57,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:57,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764210084] [2020-02-10 19:44:57,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:57,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:58,086 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 19:44:58,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:58,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764210084] [2020-02-10 19:44:58,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:58,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:44:58,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593466495] [2020-02-10 19:44:58,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:44:58,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:58,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:44:58,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:58,094 INFO L87 Difference]: Start difference. First operand 1580 states and 7085 transitions. Second operand 11 states. [2020-02-10 19:44:58,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:58,275 INFO L93 Difference]: Finished difference Result 2988 states and 11870 transitions. [2020-02-10 19:44:58,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:44:58,276 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:44:58,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:58,283 INFO L225 Difference]: With dead ends: 2988 [2020-02-10 19:44:58,283 INFO L226 Difference]: Without dead ends: 2965 [2020-02-10 19:44:58,283 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:44:58,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2965 states. [2020-02-10 19:44:58,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2965 to 1575. [2020-02-10 19:44:58,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 19:44:58,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7071 transitions. [2020-02-10 19:44:58,351 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7071 transitions. Word has length 28 [2020-02-10 19:44:58,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:58,351 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7071 transitions. [2020-02-10 19:44:58,351 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:44:58,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7071 transitions. [2020-02-10 19:44:58,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:44:58,353 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:58,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] [2020-02-10 19:44:58,354 INFO L427 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:58,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:58,354 INFO L82 PathProgramCache]: Analyzing trace with hash 89069140, now seen corresponding path program 63 times [2020-02-10 19:44:58,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:58,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817502276] [2020-02-10 19:44:58,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:58,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:58,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:58,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817502276] [2020-02-10 19:44:58,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:58,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:44:58,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316519729] [2020-02-10 19:44:58,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:44:58,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:58,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:44:58,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:58,901 INFO L87 Difference]: Start difference. First operand 1575 states and 7071 transitions. Second operand 11 states. [2020-02-10 19:44:59,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:59,079 INFO L93 Difference]: Finished difference Result 2984 states and 11862 transitions. [2020-02-10 19:44:59,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:44:59,080 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:44:59,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:59,088 INFO L225 Difference]: With dead ends: 2984 [2020-02-10 19:44:59,088 INFO L226 Difference]: Without dead ends: 2969 [2020-02-10 19:44:59,088 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:44:59,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2969 states. [2020-02-10 19:44:59,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2969 to 1580. [2020-02-10 19:44:59,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 19:44:59,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7080 transitions. [2020-02-10 19:44:59,156 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7080 transitions. Word has length 28 [2020-02-10 19:44:59,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:44:59,157 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7080 transitions. [2020-02-10 19:44:59,157 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:44:59,157 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7080 transitions. [2020-02-10 19:44:59,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:44:59,159 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:44:59,159 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:44:59,159 INFO L427 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:44:59,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:44:59,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1751721828, now seen corresponding path program 64 times [2020-02-10 19:44:59,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:44:59,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162036167] [2020-02-10 19:44:59,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:44:59,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:44:59,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:44:59,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162036167] [2020-02-10 19:44:59,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:44:59,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:44:59,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779863119] [2020-02-10 19:44:59,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:44:59,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:44:59,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:44:59,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:44:59,752 INFO L87 Difference]: Start difference. First operand 1580 states and 7080 transitions. Second operand 11 states. [2020-02-10 19:44:59,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:44:59,930 INFO L93 Difference]: Finished difference Result 2986 states and 11861 transitions. [2020-02-10 19:44:59,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:44:59,931 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:44:59,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:44:59,938 INFO L225 Difference]: With dead ends: 2986 [2020-02-10 19:44:59,938 INFO L226 Difference]: Without dead ends: 2964 [2020-02-10 19:44:59,938 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:44:59,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2964 states. [2020-02-10 19:45:00,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2964 to 1575. [2020-02-10 19:45:00,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 19:45:00,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7066 transitions. [2020-02-10 19:45:00,006 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7066 transitions. Word has length 28 [2020-02-10 19:45:00,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:00,006 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7066 transitions. [2020-02-10 19:45:00,006 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:45:00,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7066 transitions. [2020-02-10 19:45:00,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:45:00,009 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:00,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] [2020-02-10 19:45:00,009 INFO L427 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:00,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:00,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1433935084, now seen corresponding path program 65 times [2020-02-10 19:45:00,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:00,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013591814] [2020-02-10 19:45:00,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:00,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:00,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:00,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013591814] [2020-02-10 19:45:00,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:00,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:45:00,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289182248] [2020-02-10 19:45:00,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:45:00,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:00,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:45:00,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:00,545 INFO L87 Difference]: Start difference. First operand 1575 states and 7066 transitions. Second operand 11 states. [2020-02-10 19:45:00,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:00,720 INFO L93 Difference]: Finished difference Result 2992 states and 11875 transitions. [2020-02-10 19:45:00,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:45:00,720 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:45:00,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:00,728 INFO L225 Difference]: With dead ends: 2992 [2020-02-10 19:45:00,728 INFO L226 Difference]: Without dead ends: 2974 [2020-02-10 19:45:00,729 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:45:00,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2974 states. [2020-02-10 19:45:00,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2974 to 1582. [2020-02-10 19:45:00,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2020-02-10 19:45:00,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 7079 transitions. [2020-02-10 19:45:00,796 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 7079 transitions. Word has length 28 [2020-02-10 19:45:00,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:00,797 INFO L479 AbstractCegarLoop]: Abstraction has 1582 states and 7079 transitions. [2020-02-10 19:45:00,797 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:45:00,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 7079 transitions. [2020-02-10 19:45:00,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:45:00,799 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:00,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] [2020-02-10 19:45:00,800 INFO L427 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:00,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:00,800 INFO L82 PathProgramCache]: Analyzing trace with hash -2005389890, now seen corresponding path program 66 times [2020-02-10 19:45:00,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:00,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800851722] [2020-02-10 19:45:00,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:00,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:01,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:01,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800851722] [2020-02-10 19:45:01,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:01,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:45:01,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378943550] [2020-02-10 19:45:01,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:45:01,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:01,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:45:01,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:01,355 INFO L87 Difference]: Start difference. First operand 1582 states and 7079 transitions. Second operand 11 states. [2020-02-10 19:45:01,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:01,539 INFO L93 Difference]: Finished difference Result 2991 states and 11866 transitions. [2020-02-10 19:45:01,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:45:01,540 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:45:01,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:01,547 INFO L225 Difference]: With dead ends: 2991 [2020-02-10 19:45:01,548 INFO L226 Difference]: Without dead ends: 2962 [2020-02-10 19:45:01,548 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:45:01,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2962 states. [2020-02-10 19:45:01,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2962 to 1570. [2020-02-10 19:45:01,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 19:45:01,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7052 transitions. [2020-02-10 19:45:01,616 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7052 transitions. Word has length 28 [2020-02-10 19:45:01,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:01,616 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7052 transitions. [2020-02-10 19:45:01,616 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:45:01,616 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7052 transitions. [2020-02-10 19:45:01,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:45:01,618 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:01,618 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:01,619 INFO L427 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:01,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:01,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1379504544, now seen corresponding path program 67 times [2020-02-10 19:45:01,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:01,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376300497] [2020-02-10 19:45:01,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:01,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:02,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:02,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376300497] [2020-02-10 19:45:02,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:02,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:45:02,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780277405] [2020-02-10 19:45:02,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:45:02,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:02,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:45:02,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:02,165 INFO L87 Difference]: Start difference. First operand 1570 states and 7052 transitions. Second operand 11 states. [2020-02-10 19:45:02,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:02,344 INFO L93 Difference]: Finished difference Result 2992 states and 11883 transitions. [2020-02-10 19:45:02,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:45:02,344 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:45:02,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:02,351 INFO L225 Difference]: With dead ends: 2992 [2020-02-10 19:45:02,352 INFO L226 Difference]: Without dead ends: 2976 [2020-02-10 19:45:02,352 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:45:02,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2976 states. [2020-02-10 19:45:02,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2976 to 1582. [2020-02-10 19:45:02,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2020-02-10 19:45:02,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 7086 transitions. [2020-02-10 19:45:02,432 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 7086 transitions. Word has length 28 [2020-02-10 19:45:02,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:02,432 INFO L479 AbstractCegarLoop]: Abstraction has 1582 states and 7086 transitions. [2020-02-10 19:45:02,432 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:45:02,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 7086 transitions. [2020-02-10 19:45:02,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:45:02,435 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:02,435 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:02,435 INFO L427 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:02,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:02,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1426057756, now seen corresponding path program 68 times [2020-02-10 19:45:02,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:02,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72087880] [2020-02-10 19:45:02,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:02,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:02,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:02,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72087880] [2020-02-10 19:45:02,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:02,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:45:02,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588083761] [2020-02-10 19:45:02,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:45:02,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:02,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:45:02,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:02,983 INFO L87 Difference]: Start difference. First operand 1582 states and 7086 transitions. Second operand 11 states. [2020-02-10 19:45:03,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:03,190 INFO L93 Difference]: Finished difference Result 2994 states and 11881 transitions. [2020-02-10 19:45:03,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:45:03,191 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:45:03,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:03,199 INFO L225 Difference]: With dead ends: 2994 [2020-02-10 19:45:03,199 INFO L226 Difference]: Without dead ends: 2970 [2020-02-10 19:45:03,199 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:45:03,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2970 states. [2020-02-10 19:45:03,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2970 to 1576. [2020-02-10 19:45:03,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 19:45:03,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7069 transitions. [2020-02-10 19:45:03,268 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7069 transitions. Word has length 28 [2020-02-10 19:45:03,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:03,268 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7069 transitions. [2020-02-10 19:45:03,268 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:45:03,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7069 transitions. [2020-02-10 19:45:03,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:45:03,270 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:03,270 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:03,270 INFO L427 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:03,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:03,271 INFO L82 PathProgramCache]: Analyzing trace with hash 844274742, now seen corresponding path program 69 times [2020-02-10 19:45:03,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:03,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206188537] [2020-02-10 19:45:03,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:03,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:03,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:03,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206188537] [2020-02-10 19:45:03,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:03,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:45:03,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898169408] [2020-02-10 19:45:03,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:45:03,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:03,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:45:03,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:03,817 INFO L87 Difference]: Start difference. First operand 1576 states and 7069 transitions. Second operand 11 states. [2020-02-10 19:45:04,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:04,012 INFO L93 Difference]: Finished difference Result 2991 states and 11875 transitions. [2020-02-10 19:45:04,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:45:04,012 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:45:04,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:04,020 INFO L225 Difference]: With dead ends: 2991 [2020-02-10 19:45:04,020 INFO L226 Difference]: Without dead ends: 2975 [2020-02-10 19:45:04,020 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:45:04,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2975 states. [2020-02-10 19:45:04,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2975 to 1582. [2020-02-10 19:45:04,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2020-02-10 19:45:04,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 7080 transitions. [2020-02-10 19:45:04,088 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 7080 transitions. Word has length 28 [2020-02-10 19:45:04,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:04,088 INFO L479 AbstractCegarLoop]: Abstraction has 1582 states and 7080 transitions. [2020-02-10 19:45:04,088 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:45:04,088 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 7080 transitions. [2020-02-10 19:45:04,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:45:04,090 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:04,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] [2020-02-10 19:45:04,091 INFO L427 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:04,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:04,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1762224932, now seen corresponding path program 70 times [2020-02-10 19:45:04,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:04,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127566399] [2020-02-10 19:45:04,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:04,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:04,637 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 32 [2020-02-10 19:45:04,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 19:45:04,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127566399] [2020-02-10 19:45:04,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:04,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:45:04,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442354237] [2020-02-10 19:45:04,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:45:04,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:04,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:45:04,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:04,646 INFO L87 Difference]: Start difference. First operand 1582 states and 7080 transitions. Second operand 11 states. [2020-02-10 19:45:04,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:04,835 INFO L93 Difference]: Finished difference Result 2992 states and 11871 transitions. [2020-02-10 19:45:04,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:45:04,835 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:45:04,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:04,842 INFO L225 Difference]: With dead ends: 2992 [2020-02-10 19:45:04,843 INFO L226 Difference]: Without dead ends: 2969 [2020-02-10 19:45:04,843 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:45:04,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2969 states. [2020-02-10 19:45:04,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2969 to 1576. [2020-02-10 19:45:04,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 19:45:04,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7063 transitions. [2020-02-10 19:45:04,911 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7063 transitions. Word has length 28 [2020-02-10 19:45:04,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:04,912 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7063 transitions. [2020-02-10 19:45:04,912 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:45:04,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7063 transitions. [2020-02-10 19:45:04,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:45:04,914 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45: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] [2020-02-10 19:45:04,914 INFO L427 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:04,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:04,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1260594358, now seen corresponding path program 71 times [2020-02-10 19:45:04,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:04,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729475794] [2020-02-10 19:45:04,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:04,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:05,461 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 33 [2020-02-10 19:45:05,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:05,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729475794] [2020-02-10 19:45:05,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:05,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:45:05,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118979653] [2020-02-10 19:45:05,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:45:05,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:05,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:45:05,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:05,470 INFO L87 Difference]: Start difference. First operand 1576 states and 7063 transitions. Second operand 11 states. [2020-02-10 19:45:05,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:05,688 INFO L93 Difference]: Finished difference Result 2996 states and 11880 transitions. [2020-02-10 19:45:05,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:45:05,688 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:45:05,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:05,696 INFO L225 Difference]: With dead ends: 2996 [2020-02-10 19:45:05,696 INFO L226 Difference]: Without dead ends: 2978 [2020-02-10 19:45:05,697 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:45:05,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2978 states. [2020-02-10 19:45:05,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2978 to 1583. [2020-02-10 19:45:05,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 19:45:05,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7076 transitions. [2020-02-10 19:45:05,771 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7076 transitions. Word has length 28 [2020-02-10 19:45:05,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:05,771 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7076 transitions. [2020-02-10 19:45:05,771 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:45:05,771 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7076 transitions. [2020-02-10 19:45:05,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:45:05,774 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:05,774 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:05,774 INFO L427 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:05,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:05,774 INFO L82 PathProgramCache]: Analyzing trace with hash 689139552, now seen corresponding path program 72 times [2020-02-10 19:45:05,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:05,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776430871] [2020-02-10 19:45:05,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:05,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:06,219 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 31 [2020-02-10 19:45:06,348 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 32 [2020-02-10 19:45:06,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 19:45:06,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776430871] [2020-02-10 19:45:06,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:06,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:45:06,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065806186] [2020-02-10 19:45:06,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:45:06,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:06,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:45:06,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:06,357 INFO L87 Difference]: Start difference. First operand 1583 states and 7076 transitions. Second operand 11 states. [2020-02-10 19:45:06,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:06,570 INFO L93 Difference]: Finished difference Result 2995 states and 11871 transitions. [2020-02-10 19:45:06,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:45:06,571 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:45:06,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:06,578 INFO L225 Difference]: With dead ends: 2995 [2020-02-10 19:45:06,578 INFO L226 Difference]: Without dead ends: 2960 [2020-02-10 19:45:06,579 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:45:06,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2960 states. [2020-02-10 19:45:06,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2960 to 1565. [2020-02-10 19:45:06,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1565 states. [2020-02-10 19:45:06,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 7038 transitions. [2020-02-10 19:45:06,654 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 7038 transitions. Word has length 28 [2020-02-10 19:45:06,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:06,655 INFO L479 AbstractCegarLoop]: Abstraction has 1565 states and 7038 transitions. [2020-02-10 19:45:06,655 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:45:06,655 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 7038 transitions. [2020-02-10 19:45:06,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:45:06,657 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:06,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] [2020-02-10 19:45:06,657 INFO L427 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:06,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:06,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1952084594, now seen corresponding path program 73 times [2020-02-10 19:45:06,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:06,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826150129] [2020-02-10 19:45:06,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:06,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:07,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 19:45:07,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826150129] [2020-02-10 19:45:07,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:07,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:45:07,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911713820] [2020-02-10 19:45:07,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:45:07,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:07,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:45:07,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:07,203 INFO L87 Difference]: Start difference. First operand 1565 states and 7038 transitions. Second operand 11 states. [2020-02-10 19:45:07,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:07,382 INFO L93 Difference]: Finished difference Result 3018 states and 11947 transitions. [2020-02-10 19:45:07,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:45:07,382 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:45:07,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:07,389 INFO L225 Difference]: With dead ends: 3018 [2020-02-10 19:45:07,389 INFO L226 Difference]: Without dead ends: 3003 [2020-02-10 19:45:07,390 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:45:07,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3003 states. [2020-02-10 19:45:07,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3003 to 1586. [2020-02-10 19:45:07,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1586 states. [2020-02-10 19:45:07,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1586 states and 7106 transitions. [2020-02-10 19:45:07,458 INFO L78 Accepts]: Start accepts. Automaton has 1586 states and 7106 transitions. Word has length 28 [2020-02-10 19:45:07,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:07,458 INFO L479 AbstractCegarLoop]: Abstraction has 1586 states and 7106 transitions. [2020-02-10 19:45:07,458 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:45:07,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1586 states and 7106 transitions. [2020-02-10 19:45:07,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:45:07,460 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:07,461 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:07,461 INFO L427 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:07,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:07,461 INFO L82 PathProgramCache]: Analyzing trace with hash -853477706, now seen corresponding path program 74 times [2020-02-10 19:45:07,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:07,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781685001] [2020-02-10 19:45:07,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:07,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:08,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:08,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781685001] [2020-02-10 19:45:08,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:08,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:45:08,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751693547] [2020-02-10 19:45:08,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:45:08,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:08,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:45:08,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:08,008 INFO L87 Difference]: Start difference. First operand 1586 states and 7106 transitions. Second operand 11 states. [2020-02-10 19:45:08,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:08,142 INFO L93 Difference]: Finished difference Result 3023 states and 11951 transitions. [2020-02-10 19:45:08,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:45:08,143 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:45:08,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:08,150 INFO L225 Difference]: With dead ends: 3023 [2020-02-10 19:45:08,150 INFO L226 Difference]: Without dead ends: 2997 [2020-02-10 19:45:08,151 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:45:08,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2997 states. [2020-02-10 19:45:08,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2997 to 1580. [2020-02-10 19:45:08,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 19:45:08,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7089 transitions. [2020-02-10 19:45:08,219 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7089 transitions. Word has length 28 [2020-02-10 19:45:08,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:08,219 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7089 transitions. [2020-02-10 19:45:08,219 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:45:08,219 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7089 transitions. [2020-02-10 19:45:08,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:45:08,221 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:08,221 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:08,221 INFO L427 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:08,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:08,222 INFO L82 PathProgramCache]: Analyzing trace with hash -731941744, now seen corresponding path program 75 times [2020-02-10 19:45:08,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:08,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448832383] [2020-02-10 19:45:08,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:08,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:08,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:08,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448832383] [2020-02-10 19:45:08,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:08,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:45:08,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247620092] [2020-02-10 19:45:08,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:45:08,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:08,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:45:08,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:08,786 INFO L87 Difference]: Start difference. First operand 1580 states and 7089 transitions. Second operand 11 states. [2020-02-10 19:45:08,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:08,962 INFO L93 Difference]: Finished difference Result 3015 states and 11936 transitions. [2020-02-10 19:45:08,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:45:08,962 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:45:08,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:08,969 INFO L225 Difference]: With dead ends: 3015 [2020-02-10 19:45:08,969 INFO L226 Difference]: Without dead ends: 3000 [2020-02-10 19:45:08,970 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:45:09,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3000 states. [2020-02-10 19:45:09,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3000 to 1585. [2020-02-10 19:45:09,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1585 states. [2020-02-10 19:45:09,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 7098 transitions. [2020-02-10 19:45:09,038 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 7098 transitions. Word has length 28 [2020-02-10 19:45:09,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:09,038 INFO L479 AbstractCegarLoop]: Abstraction has 1585 states and 7098 transitions. [2020-02-10 19:45:09,038 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:45:09,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 7098 transitions. [2020-02-10 19:45:09,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:45:09,040 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:09,040 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:09,041 INFO L427 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:09,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:09,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1502165750, now seen corresponding path program 76 times [2020-02-10 19:45:09,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:09,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135532694] [2020-02-10 19:45:09,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:09,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:09,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 19:45:09,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135532694] [2020-02-10 19:45:09,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:09,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:45:09,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459509855] [2020-02-10 19:45:09,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:45:09,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:09,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:45:09,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:09,571 INFO L87 Difference]: Start difference. First operand 1585 states and 7098 transitions. Second operand 11 states. [2020-02-10 19:45:09,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:09,795 INFO L93 Difference]: Finished difference Result 3018 states and 11937 transitions. [2020-02-10 19:45:09,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:45:09,795 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:45:09,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:09,803 INFO L225 Difference]: With dead ends: 3018 [2020-02-10 19:45:09,803 INFO L226 Difference]: Without dead ends: 2995 [2020-02-10 19:45:09,803 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:45:09,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2995 states. [2020-02-10 19:45:09,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2995 to 1580. [2020-02-10 19:45:09,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 19:45:09,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7084 transitions. [2020-02-10 19:45:09,871 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7084 transitions. Word has length 28 [2020-02-10 19:45:09,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:09,871 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7084 transitions. [2020-02-10 19:45:09,871 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:45:09,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7084 transitions. [2020-02-10 19:45:09,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:45:09,874 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:09,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] [2020-02-10 19:45:09,874 INFO L427 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:09,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:09,874 INFO L82 PathProgramCache]: Analyzing trace with hash -315622128, now seen corresponding path program 77 times [2020-02-10 19:45:09,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:09,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074709681] [2020-02-10 19:45:09,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:09,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:10,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:10,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074709681] [2020-02-10 19:45:10,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:10,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:45:10,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819123767] [2020-02-10 19:45:10,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:45:10,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:10,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:45:10,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:10,434 INFO L87 Difference]: Start difference. First operand 1580 states and 7084 transitions. Second operand 11 states. [2020-02-10 19:45:10,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:10,596 INFO L93 Difference]: Finished difference Result 3030 states and 11961 transitions. [2020-02-10 19:45:10,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:45:10,597 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:45:10,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:10,605 INFO L225 Difference]: With dead ends: 3030 [2020-02-10 19:45:10,605 INFO L226 Difference]: Without dead ends: 3010 [2020-02-10 19:45:10,605 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:45:10,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3010 states. [2020-02-10 19:45:10,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3010 to 1590. [2020-02-10 19:45:10,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1590 states. [2020-02-10 19:45:10,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1590 states to 1590 states and 7101 transitions. [2020-02-10 19:45:10,679 INFO L78 Accepts]: Start accepts. Automaton has 1590 states and 7101 transitions. Word has length 28 [2020-02-10 19:45:10,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:10,679 INFO L479 AbstractCegarLoop]: Abstraction has 1590 states and 7101 transitions. [2020-02-10 19:45:10,679 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:45:10,679 INFO L276 IsEmpty]: Start isEmpty. Operand 1590 states and 7101 transitions. [2020-02-10 19:45:10,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:45:10,682 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:10,682 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:10,682 INFO L427 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:10,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:10,682 INFO L82 PathProgramCache]: Analyzing trace with hash 429080370, now seen corresponding path program 78 times [2020-02-10 19:45:10,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:10,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735104159] [2020-02-10 19:45:10,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:10,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:11,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:11,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735104159] [2020-02-10 19:45:11,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:11,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:45:11,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611727004] [2020-02-10 19:45:11,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:45:11,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:11,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:45:11,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:11,246 INFO L87 Difference]: Start difference. First operand 1590 states and 7101 transitions. Second operand 11 states. [2020-02-10 19:45:11,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:11,477 INFO L93 Difference]: Finished difference Result 3028 states and 11949 transitions. [2020-02-10 19:45:11,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:45:11,478 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:45:11,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:11,485 INFO L225 Difference]: With dead ends: 3028 [2020-02-10 19:45:11,485 INFO L226 Difference]: Without dead ends: 2993 [2020-02-10 19:45:11,486 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:45:11,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2993 states. [2020-02-10 19:45:11,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2993 to 1573. [2020-02-10 19:45:11,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 19:45:11,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7064 transitions. [2020-02-10 19:45:11,553 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7064 transitions. Word has length 28 [2020-02-10 19:45:11,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:11,554 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7064 transitions. [2020-02-10 19:45:11,554 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:45:11,554 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7064 transitions. [2020-02-10 19:45:11,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:45:11,556 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:11,557 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:11,557 INFO L427 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:11,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:11,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1755137380, now seen corresponding path program 79 times [2020-02-10 19:45:11,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:11,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491850109] [2020-02-10 19:45:11,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:11,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:12,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 19:45:12,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491850109] [2020-02-10 19:45:12,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:12,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:45:12,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395380286] [2020-02-10 19:45:12,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:45:12,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:12,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:45:12,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:12,109 INFO L87 Difference]: Start difference. First operand 1573 states and 7064 transitions. Second operand 11 states. [2020-02-10 19:45:12,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:12,304 INFO L93 Difference]: Finished difference Result 3014 states and 11932 transitions. [2020-02-10 19:45:12,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:45:12,304 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:45:12,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:12,312 INFO L225 Difference]: With dead ends: 3014 [2020-02-10 19:45:12,312 INFO L226 Difference]: Without dead ends: 2999 [2020-02-10 19:45:12,313 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:45:12,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2999 states. [2020-02-10 19:45:12,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2999 to 1585. [2020-02-10 19:45:12,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1585 states. [2020-02-10 19:45:12,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 7097 transitions. [2020-02-10 19:45:12,381 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 7097 transitions. Word has length 28 [2020-02-10 19:45:12,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:12,381 INFO L479 AbstractCegarLoop]: Abstraction has 1585 states and 7097 transitions. [2020-02-10 19:45:12,381 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:45:12,381 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 7097 transitions. [2020-02-10 19:45:12,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:45:12,383 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:12,383 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:12,383 INFO L427 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:12,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:12,384 INFO L82 PathProgramCache]: Analyzing trace with hash -265732384, now seen corresponding path program 80 times [2020-02-10 19:45:12,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:12,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313129581] [2020-02-10 19:45:12,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:12,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:12,938 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 30 [2020-02-10 19:45:12,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 19:45:12,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313129581] [2020-02-10 19:45:12,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:12,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:45:12,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265413334] [2020-02-10 19:45:12,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:45:12,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:12,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:45:12,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:12,946 INFO L87 Difference]: Start difference. First operand 1585 states and 7097 transitions. Second operand 11 states. [2020-02-10 19:45:13,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:13,134 INFO L93 Difference]: Finished difference Result 3019 states and 11936 transitions. [2020-02-10 19:45:13,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:45:13,134 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:45:13,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:13,141 INFO L225 Difference]: With dead ends: 3019 [2020-02-10 19:45:13,142 INFO L226 Difference]: Without dead ends: 2993 [2020-02-10 19:45:13,142 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:45:13,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2993 states. [2020-02-10 19:45:13,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2993 to 1579. [2020-02-10 19:45:13,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 19:45:13,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7080 transitions. [2020-02-10 19:45:13,210 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7080 transitions. Word has length 28 [2020-02-10 19:45:13,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:13,210 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7080 transitions. [2020-02-10 19:45:13,210 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:45:13,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7080 transitions. [2020-02-10 19:45:13,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:45:13,212 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:13,212 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:13,213 INFO L427 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:13,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:13,213 INFO L82 PathProgramCache]: Analyzing trace with hash -679426224, now seen corresponding path program 81 times [2020-02-10 19:45:13,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:13,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665946054] [2020-02-10 19:45:13,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:13,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:13,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:13,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665946054] [2020-02-10 19:45:13,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:13,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:45:13,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162465012] [2020-02-10 19:45:13,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:45:13,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:13,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:45:13,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:13,740 INFO L87 Difference]: Start difference. First operand 1579 states and 7080 transitions. Second operand 11 states. [2020-02-10 19:45:13,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:13,935 INFO L93 Difference]: Finished difference Result 3010 states and 11919 transitions. [2020-02-10 19:45:13,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:45:13,936 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:45:13,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:13,944 INFO L225 Difference]: With dead ends: 3010 [2020-02-10 19:45:13,944 INFO L226 Difference]: Without dead ends: 2995 [2020-02-10 19:45:13,944 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:45:13,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2995 states. [2020-02-10 19:45:14,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2995 to 1584. [2020-02-10 19:45:14,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1584 states. [2020-02-10 19:45:14,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 7089 transitions. [2020-02-10 19:45:14,012 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 7089 transitions. Word has length 28 [2020-02-10 19:45:14,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:14,012 INFO L479 AbstractCegarLoop]: Abstraction has 1584 states and 7089 transitions. [2020-02-10 19:45:14,012 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:45:14,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 7089 transitions. [2020-02-10 19:45:14,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:45:14,014 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:14,014 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:14,015 INFO L427 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:14,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:14,015 INFO L82 PathProgramCache]: Analyzing trace with hash 983226464, now seen corresponding path program 82 times [2020-02-10 19:45:14,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:14,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695909031] [2020-02-10 19:45:14,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:14,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:14,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:14,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695909031] [2020-02-10 19:45:14,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:14,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:45:14,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258086467] [2020-02-10 19:45:14,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:45:14,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:14,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:45:14,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:14,539 INFO L87 Difference]: Start difference. First operand 1584 states and 7089 transitions. Second operand 11 states. [2020-02-10 19:45:14,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:14,722 INFO L93 Difference]: Finished difference Result 3012 states and 11918 transitions. [2020-02-10 19:45:14,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:45:14,723 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:45:14,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:14,730 INFO L225 Difference]: With dead ends: 3012 [2020-02-10 19:45:14,730 INFO L226 Difference]: Without dead ends: 2990 [2020-02-10 19:45:14,730 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:45:14,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2990 states. [2020-02-10 19:45:14,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2990 to 1579. [2020-02-10 19:45:14,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 19:45:14,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7075 transitions. [2020-02-10 19:45:14,798 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7075 transitions. Word has length 28 [2020-02-10 19:45:14,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:14,798 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7075 transitions. [2020-02-10 19:45:14,798 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:45:14,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7075 transitions. [2020-02-10 19:45:14,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:45:14,801 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:14,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] [2020-02-10 19:45:14,801 INFO L427 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:14,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:14,801 INFO L82 PathProgramCache]: Analyzing trace with hash -263106608, now seen corresponding path program 83 times [2020-02-10 19:45:14,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:14,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840485323] [2020-02-10 19:45:14,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:14,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:15,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:15,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840485323] [2020-02-10 19:45:15,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:15,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:45:15,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028993589] [2020-02-10 19:45:15,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:45:15,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:15,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:45:15,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:15,355 INFO L87 Difference]: Start difference. First operand 1579 states and 7075 transitions. Second operand 11 states. [2020-02-10 19:45:15,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:15,545 INFO L93 Difference]: Finished difference Result 3023 states and 11940 transitions. [2020-02-10 19:45:15,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:45:15,546 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:45:15,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:15,553 INFO L225 Difference]: With dead ends: 3023 [2020-02-10 19:45:15,554 INFO L226 Difference]: Without dead ends: 3003 [2020-02-10 19:45:15,554 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:45:15,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3003 states. [2020-02-10 19:45:15,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3003 to 1587. [2020-02-10 19:45:15,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1587 states. [2020-02-10 19:45:15,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 7089 transitions. [2020-02-10 19:45:15,621 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 7089 transitions. Word has length 28 [2020-02-10 19:45:15,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:15,621 INFO L479 AbstractCegarLoop]: Abstraction has 1587 states and 7089 transitions. [2020-02-10 19:45:15,622 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:45:15,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 7089 transitions. [2020-02-10 19:45:15,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:45:15,624 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:15,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] [2020-02-10 19:45:15,624 INFO L427 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:15,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:15,624 INFO L82 PathProgramCache]: Analyzing trace with hash -89858916, now seen corresponding path program 84 times [2020-02-10 19:45:15,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:15,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045079443] [2020-02-10 19:45:15,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:15,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:16,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:16,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045079443] [2020-02-10 19:45:16,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:16,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:45:16,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319068653] [2020-02-10 19:45:16,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:45:16,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:16,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:45:16,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:16,157 INFO L87 Difference]: Start difference. First operand 1587 states and 7089 transitions. Second operand 11 states. [2020-02-10 19:45:16,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:16,350 INFO L93 Difference]: Finished difference Result 3020 states and 11927 transitions. [2020-02-10 19:45:16,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:45:16,351 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:45:16,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:16,358 INFO L225 Difference]: With dead ends: 3020 [2020-02-10 19:45:16,358 INFO L226 Difference]: Without dead ends: 2989 [2020-02-10 19:45:16,358 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:45:16,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2989 states. [2020-02-10 19:45:16,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2989 to 1573. [2020-02-10 19:45:16,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 19:45:16,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7058 transitions. [2020-02-10 19:45:16,426 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7058 transitions. Word has length 28 [2020-02-10 19:45:16,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:16,426 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7058 transitions. [2020-02-10 19:45:16,426 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:45:16,426 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7058 transitions. [2020-02-10 19:45:16,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:45:16,428 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:16,429 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:16,429 INFO L427 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:16,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:16,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1744634276, now seen corresponding path program 85 times [2020-02-10 19:45:16,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:16,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107671605] [2020-02-10 19:45:16,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:16,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:16,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 19:45:16,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107671605] [2020-02-10 19:45:16,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:16,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:45:16,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537932168] [2020-02-10 19:45:16,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:45:16,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:16,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:45:16,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:16,974 INFO L87 Difference]: Start difference. First operand 1573 states and 7058 transitions. Second operand 11 states. [2020-02-10 19:45:17,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:17,167 INFO L93 Difference]: Finished difference Result 3006 states and 11911 transitions. [2020-02-10 19:45:17,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:45:17,167 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:45:17,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:17,174 INFO L225 Difference]: With dead ends: 3006 [2020-02-10 19:45:17,174 INFO L226 Difference]: Without dead ends: 2991 [2020-02-10 19:45:17,175 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:45:17,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2991 states. [2020-02-10 19:45:17,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2991 to 1583. [2020-02-10 19:45:17,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 19:45:17,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7086 transitions. [2020-02-10 19:45:17,243 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7086 transitions. Word has length 28 [2020-02-10 19:45:17,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:17,243 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7086 transitions. [2020-02-10 19:45:17,243 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:45:17,243 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7086 transitions. [2020-02-10 19:45:17,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:45:17,245 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:17,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] [2020-02-10 19:45:17,245 INFO L427 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:17,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:17,246 INFO L82 PathProgramCache]: Analyzing trace with hash 489473218, now seen corresponding path program 86 times [2020-02-10 19:45:17,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:17,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191012738] [2020-02-10 19:45:17,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:17,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:17,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:17,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191012738] [2020-02-10 19:45:17,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:17,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:45:17,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961982689] [2020-02-10 19:45:17,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:45:17,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:17,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:45:17,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:17,798 INFO L87 Difference]: Start difference. First operand 1583 states and 7086 transitions. Second operand 11 states. [2020-02-10 19:45:18,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:18,064 INFO L93 Difference]: Finished difference Result 3009 states and 11912 transitions. [2020-02-10 19:45:18,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:45:18,065 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:45:18,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:18,073 INFO L225 Difference]: With dead ends: 3009 [2020-02-10 19:45:18,073 INFO L226 Difference]: Without dead ends: 2986 [2020-02-10 19:45:18,073 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:45:18,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2986 states. [2020-02-10 19:45:18,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2986 to 1578. [2020-02-10 19:45:18,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 19:45:18,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7072 transitions. [2020-02-10 19:45:18,141 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7072 transitions. Word has length 28 [2020-02-10 19:45:18,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:18,141 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7072 transitions. [2020-02-10 19:45:18,141 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:45:18,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7072 transitions. [2020-02-10 19:45:18,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:45:18,144 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:18,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] [2020-02-10 19:45:18,144 INFO L427 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:18,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:18,144 INFO L82 PathProgramCache]: Analyzing trace with hash 2015103218, now seen corresponding path program 87 times [2020-02-10 19:45:18,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:18,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333775959] [2020-02-10 19:45:18,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:18,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:18,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:18,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333775959] [2020-02-10 19:45:18,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:18,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:45:18,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231767343] [2020-02-10 19:45:18,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:45:18,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:18,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:45:18,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:18,667 INFO L87 Difference]: Start difference. First operand 1578 states and 7072 transitions. Second operand 11 states. [2020-02-10 19:45:18,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:18,900 INFO L93 Difference]: Finished difference Result 3005 states and 11904 transitions. [2020-02-10 19:45:18,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:45:18,900 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:45:18,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:18,907 INFO L225 Difference]: With dead ends: 3005 [2020-02-10 19:45:18,907 INFO L226 Difference]: Without dead ends: 2990 [2020-02-10 19:45:18,907 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:45:18,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2990 states. [2020-02-10 19:45:18,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2990 to 1583. [2020-02-10 19:45:18,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 19:45:18,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7081 transitions. [2020-02-10 19:45:18,975 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7081 transitions. Word has length 28 [2020-02-10 19:45:18,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:18,975 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7081 transitions. [2020-02-10 19:45:18,975 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:45:18,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7081 transitions. [2020-02-10 19:45:18,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:45:18,977 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:18,978 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:18,978 INFO L427 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:18,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:18,978 INFO L82 PathProgramCache]: Analyzing trace with hash -617211390, now seen corresponding path program 88 times [2020-02-10 19:45:18,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:18,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811424213] [2020-02-10 19:45:18,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:18,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:19,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 19:45:19,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811424213] [2020-02-10 19:45:19,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:19,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:45:19,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218860664] [2020-02-10 19:45:19,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:45:19,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:19,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:45:19,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:19,509 INFO L87 Difference]: Start difference. First operand 1583 states and 7081 transitions. Second operand 11 states. [2020-02-10 19:45:19,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:19,697 INFO L93 Difference]: Finished difference Result 3007 states and 11903 transitions. [2020-02-10 19:45:19,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:45:19,697 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:45:19,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:19,705 INFO L225 Difference]: With dead ends: 3007 [2020-02-10 19:45:19,705 INFO L226 Difference]: Without dead ends: 2985 [2020-02-10 19:45:19,705 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:45:19,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2985 states. [2020-02-10 19:45:19,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2985 to 1578. [2020-02-10 19:45:19,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 19:45:19,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7067 transitions. [2020-02-10 19:45:19,775 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7067 transitions. Word has length 28 [2020-02-10 19:45:19,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:19,775 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7067 transitions. [2020-02-10 19:45:19,775 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:45:19,775 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7067 transitions. [2020-02-10 19:45:19,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:45:19,777 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:19,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] [2020-02-10 19:45:19,778 INFO L427 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:19,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:19,778 INFO L82 PathProgramCache]: Analyzing trace with hash 492098994, now seen corresponding path program 89 times [2020-02-10 19:45:19,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:19,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502384661] [2020-02-10 19:45:19,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:19,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:20,306 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 19:45:20,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 19:45:20,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502384661] [2020-02-10 19:45:20,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:20,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:45:20,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647229884] [2020-02-10 19:45:20,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:45:20,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:20,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:45:20,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:20,315 INFO L87 Difference]: Start difference. First operand 1578 states and 7067 transitions. Second operand 11 states. [2020-02-10 19:45:20,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:20,498 INFO L93 Difference]: Finished difference Result 3013 states and 11917 transitions. [2020-02-10 19:45:20,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:45:20,499 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:45:20,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:20,506 INFO L225 Difference]: With dead ends: 3013 [2020-02-10 19:45:20,506 INFO L226 Difference]: Without dead ends: 2995 [2020-02-10 19:45:20,507 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:45:20,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2995 states. [2020-02-10 19:45:20,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2995 to 1585. [2020-02-10 19:45:20,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1585 states. [2020-02-10 19:45:20,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 7080 transitions. [2020-02-10 19:45:20,576 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 7080 transitions. Word has length 28 [2020-02-10 19:45:20,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:20,576 INFO L479 AbstractCegarLoop]: Abstraction has 1585 states and 7080 transitions. [2020-02-10 19:45:20,576 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:45:20,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 7080 transitions. [2020-02-10 19:45:20,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:45:20,578 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:20,579 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:20,579 INFO L427 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:20,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:20,579 INFO L82 PathProgramCache]: Analyzing trace with hash -79355812, now seen corresponding path program 90 times [2020-02-10 19:45:20,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:20,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143636306] [2020-02-10 19:45:20,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:20,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:21,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 19:45:21,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143636306] [2020-02-10 19:45:21,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:21,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:45:21,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735183657] [2020-02-10 19:45:21,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:45:21,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:21,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:45:21,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:21,128 INFO L87 Difference]: Start difference. First operand 1585 states and 7080 transitions. Second operand 11 states. [2020-02-10 19:45:21,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:21,348 INFO L93 Difference]: Finished difference Result 3012 states and 11908 transitions. [2020-02-10 19:45:21,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:45:21,348 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:45:21,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:21,355 INFO L225 Difference]: With dead ends: 3012 [2020-02-10 19:45:21,355 INFO L226 Difference]: Without dead ends: 2983 [2020-02-10 19:45:21,356 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:45:21,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2983 states. [2020-02-10 19:45:21,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2983 to 1573. [2020-02-10 19:45:21,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 19:45:21,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7053 transitions. [2020-02-10 19:45:21,423 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7053 transitions. Word has length 28 [2020-02-10 19:45:21,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:21,424 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7053 transitions. [2020-02-10 19:45:21,424 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:45:21,424 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7053 transitions. [2020-02-10 19:45:21,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:45:21,427 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:21,427 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:21,427 INFO L427 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:21,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:21,428 INFO L82 PathProgramCache]: Analyzing trace with hash -234223072, now seen corresponding path program 91 times [2020-02-10 19:45:21,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:21,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484926963] [2020-02-10 19:45:21,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:21,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:22,001 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 31 [2020-02-10 19:45:22,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 19:45:22,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484926963] [2020-02-10 19:45:22,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:22,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:45:22,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680772236] [2020-02-10 19:45:22,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:45:22,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:22,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:45:22,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:22,009 INFO L87 Difference]: Start difference. First operand 1573 states and 7053 transitions. Second operand 11 states. [2020-02-10 19:45:22,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:22,147 INFO L93 Difference]: Finished difference Result 3039 states and 11979 transitions. [2020-02-10 19:45:22,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:45:22,148 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:45:22,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:22,155 INFO L225 Difference]: With dead ends: 3039 [2020-02-10 19:45:22,155 INFO L226 Difference]: Without dead ends: 3019 [2020-02-10 19:45:22,155 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:45:22,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3019 states. [2020-02-10 19:45:22,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3019 to 1593. [2020-02-10 19:45:22,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1593 states. [2020-02-10 19:45:22,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 7103 transitions. [2020-02-10 19:45:22,224 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 7103 transitions. Word has length 28 [2020-02-10 19:45:22,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:22,224 INFO L479 AbstractCegarLoop]: Abstraction has 1593 states and 7103 transitions. [2020-02-10 19:45:22,224 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:45:22,224 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 7103 transitions. [2020-02-10 19:45:22,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:45:22,226 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:22,227 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:22,227 INFO L427 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:22,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:22,227 INFO L82 PathProgramCache]: Analyzing trace with hash 510479426, now seen corresponding path program 92 times [2020-02-10 19:45:22,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:22,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697213252] [2020-02-10 19:45:22,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:22,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:22,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 19:45:22,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697213252] [2020-02-10 19:45:22,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:22,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:45:22,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841889287] [2020-02-10 19:45:22,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:45:22,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:22,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:45:22,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:22,828 INFO L87 Difference]: Start difference. First operand 1593 states and 7103 transitions. Second operand 11 states. [2020-02-10 19:45:23,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:23,004 INFO L93 Difference]: Finished difference Result 3037 states and 11967 transitions. [2020-02-10 19:45:23,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:45:23,004 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:45:23,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:23,012 INFO L225 Difference]: With dead ends: 3037 [2020-02-10 19:45:23,012 INFO L226 Difference]: Without dead ends: 3009 [2020-02-10 19:45:23,012 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:45:23,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3009 states. [2020-02-10 19:45:23,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3009 to 1583. [2020-02-10 19:45:23,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 19:45:23,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7077 transitions. [2020-02-10 19:45:23,081 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7077 transitions. Word has length 28 [2020-02-10 19:45:23,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:23,081 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7077 transitions. [2020-02-10 19:45:23,081 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:45:23,081 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7077 transitions. [2020-02-10 19:45:23,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:45:23,083 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:23,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] [2020-02-10 19:45:23,084 INFO L427 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:23,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:23,084 INFO L82 PathProgramCache]: Analyzing trace with hash -769452874, now seen corresponding path program 93 times [2020-02-10 19:45:23,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:23,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977605966] [2020-02-10 19:45:23,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:23,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:23,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:23,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977605966] [2020-02-10 19:45:23,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:23,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:45:23,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667362940] [2020-02-10 19:45:23,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:45:23,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:23,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:45:23,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:23,655 INFO L87 Difference]: Start difference. First operand 1583 states and 7077 transitions. Second operand 11 states. [2020-02-10 19:45:23,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:23,816 INFO L93 Difference]: Finished difference Result 3036 states and 11964 transitions. [2020-02-10 19:45:23,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:45:23,816 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:45:23,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:23,824 INFO L225 Difference]: With dead ends: 3036 [2020-02-10 19:45:23,824 INFO L226 Difference]: Without dead ends: 3016 [2020-02-10 19:45:23,825 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:45:23,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3016 states. [2020-02-10 19:45:23,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3016 to 1591. [2020-02-10 19:45:23,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1591 states. [2020-02-10 19:45:23,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1591 states and 7091 transitions. [2020-02-10 19:45:23,900 INFO L78 Accepts]: Start accepts. Automaton has 1591 states and 7091 transitions. Word has length 28 [2020-02-10 19:45:23,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:23,900 INFO L479 AbstractCegarLoop]: Abstraction has 1591 states and 7091 transitions. [2020-02-10 19:45:23,900 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:45:23,900 INFO L276 IsEmpty]: Start isEmpty. Operand 1591 states and 7091 transitions. [2020-02-10 19:45:23,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:45:23,902 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:23,902 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:23,902 INFO L427 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:23,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:23,903 INFO L82 PathProgramCache]: Analyzing trace with hash -596205182, now seen corresponding path program 94 times [2020-02-10 19:45:23,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:23,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21022289] [2020-02-10 19:45:23,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:23,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:24,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:24,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21022289] [2020-02-10 19:45:24,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:24,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:45:24,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741295747] [2020-02-10 19:45:24,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:45:24,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:24,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:45:24,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:24,520 INFO L87 Difference]: Start difference. First operand 1591 states and 7091 transitions. Second operand 11 states. [2020-02-10 19:45:24,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:24,693 INFO L93 Difference]: Finished difference Result 3033 states and 11951 transitions. [2020-02-10 19:45:24,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:45:24,693 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:45:24,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:24,701 INFO L225 Difference]: With dead ends: 3033 [2020-02-10 19:45:24,701 INFO L226 Difference]: Without dead ends: 3008 [2020-02-10 19:45:24,701 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:45:24,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3008 states. [2020-02-10 19:45:24,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3008 to 1583. [2020-02-10 19:45:24,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 19:45:24,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7069 transitions. [2020-02-10 19:45:24,771 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7069 transitions. Word has length 28 [2020-02-10 19:45:24,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:24,771 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7069 transitions. [2020-02-10 19:45:24,771 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:45:24,771 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7069 transitions. [2020-02-10 19:45:24,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:45:24,773 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:24,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] [2020-02-10 19:45:24,773 INFO L427 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:24,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:24,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1586190582, now seen corresponding path program 95 times [2020-02-10 19:45:24,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:24,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716382214] [2020-02-10 19:45:24,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:24,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:25,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:25,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716382214] [2020-02-10 19:45:25,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:25,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:45:25,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449671210] [2020-02-10 19:45:25,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:45:25,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:25,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:45:25,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:25,315 INFO L87 Difference]: Start difference. First operand 1583 states and 7069 transitions. Second operand 11 states. [2020-02-10 19:45:25,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:25,503 INFO L93 Difference]: Finished difference Result 3031 states and 11948 transitions. [2020-02-10 19:45:25,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:45:25,504 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:45:25,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:25,512 INFO L225 Difference]: With dead ends: 3031 [2020-02-10 19:45:25,512 INFO L226 Difference]: Without dead ends: 3013 [2020-02-10 19:45:25,512 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:45:25,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3013 states. [2020-02-10 19:45:25,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3013 to 1590. [2020-02-10 19:45:25,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1590 states. [2020-02-10 19:45:25,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1590 states to 1590 states and 7082 transitions. [2020-02-10 19:45:25,580 INFO L78 Accepts]: Start accepts. Automaton has 1590 states and 7082 transitions. Word has length 28 [2020-02-10 19:45:25,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:25,580 INFO L479 AbstractCegarLoop]: Abstraction has 1590 states and 7082 transitions. [2020-02-10 19:45:25,580 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:45:25,580 INFO L276 IsEmpty]: Start isEmpty. Operand 1590 states and 7082 transitions. [2020-02-10 19:45:25,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:45:25,582 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:25,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] [2020-02-10 19:45:25,583 INFO L427 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:25,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:25,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1014735776, now seen corresponding path program 96 times [2020-02-10 19:45:25,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:25,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222290421] [2020-02-10 19:45:25,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:25,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:26,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:26,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222290421] [2020-02-10 19:45:26,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:26,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:45:26,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477209977] [2020-02-10 19:45:26,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:45:26,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:26,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:45:26,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:26,148 INFO L87 Difference]: Start difference. First operand 1590 states and 7082 transitions. Second operand 11 states. [2020-02-10 19:45:26,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:26,339 INFO L93 Difference]: Finished difference Result 3030 states and 11939 transitions. [2020-02-10 19:45:26,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:45:26,339 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:45:26,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:26,347 INFO L225 Difference]: With dead ends: 3030 [2020-02-10 19:45:26,347 INFO L226 Difference]: Without dead ends: 2988 [2020-02-10 19:45:26,348 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:45:26,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2988 states. [2020-02-10 19:45:26,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2988 to 1565. [2020-02-10 19:45:26,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1565 states. [2020-02-10 19:45:26,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 7030 transitions. [2020-02-10 19:45:26,415 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 7030 transitions. Word has length 28 [2020-02-10 19:45:26,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:26,415 INFO L479 AbstractCegarLoop]: Abstraction has 1565 states and 7030 transitions. [2020-02-10 19:45:26,415 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:45:26,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 7030 transitions. [2020-02-10 19:45:26,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:45:26,417 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:26,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] [2020-02-10 19:45:26,418 INFO L427 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:26,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:26,418 INFO L82 PathProgramCache]: Analyzing trace with hash 338356978, now seen corresponding path program 97 times [2020-02-10 19:45:26,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:26,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536746606] [2020-02-10 19:45:26,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:26,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:27,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:27,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536746606] [2020-02-10 19:45:27,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:27,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:45:27,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824827302] [2020-02-10 19:45:27,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:45:27,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:27,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:45:27,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:27,003 INFO L87 Difference]: Start difference. First operand 1565 states and 7030 transitions. Second operand 11 states. [2020-02-10 19:45:27,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:27,188 INFO L93 Difference]: Finished difference Result 3034 states and 11987 transitions. [2020-02-10 19:45:27,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:45:27,188 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:45:27,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:27,195 INFO L225 Difference]: With dead ends: 3034 [2020-02-10 19:45:27,196 INFO L226 Difference]: Without dead ends: 3018 [2020-02-10 19:45:27,196 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:45:27,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3018 states. [2020-02-10 19:45:27,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3018 to 1590. [2020-02-10 19:45:27,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1590 states. [2020-02-10 19:45:27,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1590 states to 1590 states and 7110 transitions. [2020-02-10 19:45:27,266 INFO L78 Accepts]: Start accepts. Automaton has 1590 states and 7110 transitions. Word has length 28 [2020-02-10 19:45:27,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:27,266 INFO L479 AbstractCegarLoop]: Abstraction has 1590 states and 7110 transitions. [2020-02-10 19:45:27,266 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:45:27,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1590 states and 7110 transitions. [2020-02-10 19:45:27,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:45:27,268 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:27,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] [2020-02-10 19:45:27,268 INFO L427 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:27,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:27,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1083059476, now seen corresponding path program 98 times [2020-02-10 19:45:27,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:27,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30494836] [2020-02-10 19:45:27,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:27,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:27,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:27,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30494836] [2020-02-10 19:45:27,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:27,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:45:27,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707519612] [2020-02-10 19:45:27,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:45:27,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:27,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:45:27,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:27,840 INFO L87 Difference]: Start difference. First operand 1590 states and 7110 transitions. Second operand 11 states. [2020-02-10 19:45:27,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:27,987 INFO L93 Difference]: Finished difference Result 3038 states and 11988 transitions. [2020-02-10 19:45:27,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:45:27,988 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:45:27,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:27,996 INFO L225 Difference]: With dead ends: 3038 [2020-02-10 19:45:27,996 INFO L226 Difference]: Without dead ends: 3011 [2020-02-10 19:45:27,996 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:45:28,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3011 states. [2020-02-10 19:45:28,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3011 to 1583. [2020-02-10 19:45:28,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 19:45:28,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7090 transitions. [2020-02-10 19:45:28,065 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7090 transitions. Word has length 28 [2020-02-10 19:45:28,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:28,065 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7090 transitions. [2020-02-10 19:45:28,065 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:45:28,065 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7090 transitions. [2020-02-10 19:45:28,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:45:28,067 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:28,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] [2020-02-10 19:45:28,067 INFO L427 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:28,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:28,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1949297936, now seen corresponding path program 99 times [2020-02-10 19:45:28,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:28,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719238920] [2020-02-10 19:45:28,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:28,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:28,609 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 19:45:28,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 19:45:28,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719238920] [2020-02-10 19:45:28,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:28,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:45:28,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944670377] [2020-02-10 19:45:28,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:45:28,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:28,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:45:28,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:28,617 INFO L87 Difference]: Start difference. First operand 1583 states and 7090 transitions. Second operand 11 states. [2020-02-10 19:45:28,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:28,858 INFO L93 Difference]: Finished difference Result 3031 states and 11975 transitions. [2020-02-10 19:45:28,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:45:28,859 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:45:28,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:28,866 INFO L225 Difference]: With dead ends: 3031 [2020-02-10 19:45:28,866 INFO L226 Difference]: Without dead ends: 3015 [2020-02-10 19:45:28,866 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:45:28,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3015 states. [2020-02-10 19:45:28,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3015 to 1589. [2020-02-10 19:45:28,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1589 states. [2020-02-10 19:45:28,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1589 states and 7101 transitions. [2020-02-10 19:45:28,934 INFO L78 Accepts]: Start accepts. Automaton has 1589 states and 7101 transitions. Word has length 28 [2020-02-10 19:45:28,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:28,934 INFO L479 AbstractCegarLoop]: Abstraction has 1589 states and 7101 transitions. [2020-02-10 19:45:28,934 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:45:28,934 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 7101 transitions. [2020-02-10 19:45:28,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:45:28,937 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:28,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] [2020-02-10 19:45:28,937 INFO L427 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:28,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:28,937 INFO L82 PathProgramCache]: Analyzing trace with hash -856264364, now seen corresponding path program 100 times [2020-02-10 19:45:28,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:28,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473172916] [2020-02-10 19:45:28,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:28,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:29,494 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 19:45:29,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 19:45:29,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473172916] [2020-02-10 19:45:29,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:29,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:45:29,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787136110] [2020-02-10 19:45:29,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:45:29,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:29,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:45:29,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:29,505 INFO L87 Difference]: Start difference. First operand 1589 states and 7101 transitions. Second operand 11 states. [2020-02-10 19:45:29,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:29,705 INFO L93 Difference]: Finished difference Result 3033 states and 11973 transitions. [2020-02-10 19:45:29,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:45:29,705 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:45:29,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:29,713 INFO L225 Difference]: With dead ends: 3033 [2020-02-10 19:45:29,713 INFO L226 Difference]: Without dead ends: 3009 [2020-02-10 19:45:29,714 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:45:29,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3009 states. [2020-02-10 19:45:29,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3009 to 1583. [2020-02-10 19:45:29,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 19:45:29,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7084 transitions. [2020-02-10 19:45:29,781 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7084 transitions. Word has length 28 [2020-02-10 19:45:29,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:29,782 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7084 transitions. [2020-02-10 19:45:29,782 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:45:29,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7084 transitions. [2020-02-10 19:45:29,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:45:29,784 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:29,784 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:29,784 INFO L427 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:29,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:29,784 INFO L82 PathProgramCache]: Analyzing trace with hash 9974096, now seen corresponding path program 101 times [2020-02-10 19:45:29,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:29,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747430464] [2020-02-10 19:45:29,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:29,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:30,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 19:45:30,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747430464] [2020-02-10 19:45:30,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:30,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:45:30,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011241213] [2020-02-10 19:45:30,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:45:30,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:30,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:45:30,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:30,379 INFO L87 Difference]: Start difference. First operand 1583 states and 7084 transitions. Second operand 11 states. [2020-02-10 19:45:30,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:30,541 INFO L93 Difference]: Finished difference Result 3043 states and 11992 transitions. [2020-02-10 19:45:30,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:45:30,542 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:45:30,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:30,548 INFO L225 Difference]: With dead ends: 3043 [2020-02-10 19:45:30,549 INFO L226 Difference]: Without dead ends: 3023 [2020-02-10 19:45:30,549 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:45:30,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3023 states. [2020-02-10 19:45:30,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3023 to 1593. [2020-02-10 19:45:30,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1593 states. [2020-02-10 19:45:30,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 7101 transitions. [2020-02-10 19:45:30,618 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 7101 transitions. Word has length 28 [2020-02-10 19:45:30,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:30,619 INFO L479 AbstractCegarLoop]: Abstraction has 1593 states and 7101 transitions. [2020-02-10 19:45:30,619 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:45:30,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 7101 transitions. [2020-02-10 19:45:30,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:45:30,621 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:30,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] [2020-02-10 19:45:30,621 INFO L427 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:30,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:30,622 INFO L82 PathProgramCache]: Analyzing trace with hash 754676594, now seen corresponding path program 102 times [2020-02-10 19:45:30,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:30,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126846238] [2020-02-10 19:45:30,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:30,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:31,051 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 28 [2020-02-10 19:45:31,208 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 31 [2020-02-10 19:45:31,372 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 19:45:31,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 19:45:31,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126846238] [2020-02-10 19:45:31,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:31,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:45:31,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28726686] [2020-02-10 19:45:31,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:45:31,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:31,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:45:31,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:31,387 INFO L87 Difference]: Start difference. First operand 1593 states and 7101 transitions. Second operand 11 states. [2020-02-10 19:45:31,675 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 32 [2020-02-10 19:45:31,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:31,699 INFO L93 Difference]: Finished difference Result 3041 states and 11980 transitions. [2020-02-10 19:45:31,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:45:31,700 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:45:31,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:31,712 INFO L225 Difference]: With dead ends: 3041 [2020-02-10 19:45:31,712 INFO L226 Difference]: Without dead ends: 3005 [2020-02-10 19:45:31,713 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:45:31,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3005 states. [2020-02-10 19:45:31,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3005 to 1575. [2020-02-10 19:45:31,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 19:45:31,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7061 transitions. [2020-02-10 19:45:31,873 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7061 transitions. Word has length 28 [2020-02-10 19:45:31,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:31,874 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7061 transitions. [2020-02-10 19:45:31,874 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:45:31,874 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7061 transitions. [2020-02-10 19:45:31,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:45:31,879 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:31,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] [2020-02-10 19:45:31,880 INFO L427 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:31,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:31,880 INFO L82 PathProgramCache]: Analyzing trace with hash 926102300, now seen corresponding path program 103 times [2020-02-10 19:45:31,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:31,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701009888] [2020-02-10 19:45:31,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:31,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:32,372 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 25 [2020-02-10 19:45:32,530 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 29 [2020-02-10 19:45:32,691 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 31 [2020-02-10 19:45:32,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 19:45:32,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701009888] [2020-02-10 19:45:32,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:32,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:45:32,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781808226] [2020-02-10 19:45:32,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:45:32,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:32,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:45:32,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:32,707 INFO L87 Difference]: Start difference. First operand 1575 states and 7061 transitions. Second operand 11 states. [2020-02-10 19:45:33,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:33,046 INFO L93 Difference]: Finished difference Result 3030 states and 11971 transitions. [2020-02-10 19:45:33,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:45:33,046 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:45:33,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:33,058 INFO L225 Difference]: With dead ends: 3030 [2020-02-10 19:45:33,058 INFO L226 Difference]: Without dead ends: 3014 [2020-02-10 19:45:33,059 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:45:33,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3014 states. [2020-02-10 19:45:33,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3014 to 1589. [2020-02-10 19:45:33,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1589 states. [2020-02-10 19:45:33,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1589 states and 7100 transitions. [2020-02-10 19:45:33,218 INFO L78 Accepts]: Start accepts. Automaton has 1589 states and 7100 transitions. Word has length 28 [2020-02-10 19:45:33,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:33,218 INFO L479 AbstractCegarLoop]: Abstraction has 1589 states and 7100 transitions. [2020-02-10 19:45:33,218 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:45:33,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 7100 transitions. [2020-02-10 19:45:33,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:45:33,223 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:33,224 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:33,224 INFO L427 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:33,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:33,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1670804798, now seen corresponding path program 104 times [2020-02-10 19:45:33,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:33,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024306193] [2020-02-10 19:45:33,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:33,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:33,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:33,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024306193] [2020-02-10 19:45:33,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:33,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:45:33,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914065941] [2020-02-10 19:45:33,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:45:33,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:33,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:45:33,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:33,813 INFO L87 Difference]: Start difference. First operand 1589 states and 7100 transitions. Second operand 11 states. [2020-02-10 19:45:33,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:33,997 INFO L93 Difference]: Finished difference Result 3034 states and 11972 transitions. [2020-02-10 19:45:33,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:45:33,997 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:45:33,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:34,004 INFO L225 Difference]: With dead ends: 3034 [2020-02-10 19:45:34,005 INFO L226 Difference]: Without dead ends: 3007 [2020-02-10 19:45:34,005 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:45:34,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3007 states. [2020-02-10 19:45:34,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3007 to 1582. [2020-02-10 19:45:34,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2020-02-10 19:45:34,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 7080 transitions. [2020-02-10 19:45:34,074 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 7080 transitions. Word has length 28 [2020-02-10 19:45:34,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:34,075 INFO L479 AbstractCegarLoop]: Abstraction has 1582 states and 7080 transitions. [2020-02-10 19:45:34,075 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:45:34,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 7080 transitions. [2020-02-10 19:45:34,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:45:34,077 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:34,077 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:34,077 INFO L427 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:34,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:34,080 INFO L82 PathProgramCache]: Analyzing trace with hash 2001813456, now seen corresponding path program 105 times [2020-02-10 19:45:34,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:34,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013215845] [2020-02-10 19:45:34,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:34,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:34,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:34,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013215845] [2020-02-10 19:45:34,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:34,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:45:34,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078180967] [2020-02-10 19:45:34,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:45:34,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:34,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:45:34,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:34,633 INFO L87 Difference]: Start difference. First operand 1582 states and 7080 transitions. Second operand 11 states. [2020-02-10 19:45:34,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:34,873 INFO L93 Difference]: Finished difference Result 3026 states and 11957 transitions. [2020-02-10 19:45:34,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:45:34,874 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:45:34,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:34,881 INFO L225 Difference]: With dead ends: 3026 [2020-02-10 19:45:34,882 INFO L226 Difference]: Without dead ends: 3010 [2020-02-10 19:45:34,882 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:45:34,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3010 states. [2020-02-10 19:45:34,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3010 to 1588. [2020-02-10 19:45:34,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1588 states. [2020-02-10 19:45:34,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 7091 transitions. [2020-02-10 19:45:34,951 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 7091 transitions. Word has length 28 [2020-02-10 19:45:34,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:34,951 INFO L479 AbstractCegarLoop]: Abstraction has 1588 states and 7091 transitions. [2020-02-10 19:45:34,951 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:45:34,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 7091 transitions. [2020-02-10 19:45:34,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:45:34,953 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:34,953 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:34,953 INFO L427 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:34,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:34,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1375203650, now seen corresponding path program 106 times [2020-02-10 19:45:34,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:34,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394311865] [2020-02-10 19:45:34,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:34,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:35,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 19:45:35,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394311865] [2020-02-10 19:45:35,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:35,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:45:35,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775371054] [2020-02-10 19:45:35,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:45:35,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:35,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:45:35,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:35,522 INFO L87 Difference]: Start difference. First operand 1588 states and 7091 transitions. Second operand 11 states. [2020-02-10 19:45:35,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:35,708 INFO L93 Difference]: Finished difference Result 3027 states and 11953 transitions. [2020-02-10 19:45:35,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:45:35,708 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:45:35,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:35,715 INFO L225 Difference]: With dead ends: 3027 [2020-02-10 19:45:35,715 INFO L226 Difference]: Without dead ends: 3004 [2020-02-10 19:45:35,715 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:45:35,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3004 states. [2020-02-10 19:45:35,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3004 to 1582. [2020-02-10 19:45:35,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2020-02-10 19:45:35,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 7074 transitions. [2020-02-10 19:45:35,783 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 7074 transitions. Word has length 28 [2020-02-10 19:45:35,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:35,783 INFO L479 AbstractCegarLoop]: Abstraction has 1582 states and 7074 transitions. [2020-02-10 19:45:35,784 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:45:35,784 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 7074 transitions. [2020-02-10 19:45:35,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:45:35,786 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:35,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] [2020-02-10 19:45:35,786 INFO L427 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:35,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:35,786 INFO L82 PathProgramCache]: Analyzing trace with hash 62489616, now seen corresponding path program 107 times [2020-02-10 19:45:35,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:35,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590953526] [2020-02-10 19:45:35,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:35,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:36,352 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 31 [2020-02-10 19:45:36,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 19:45:36,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590953526] [2020-02-10 19:45:36,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:36,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:45:36,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114130169] [2020-02-10 19:45:36,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:45:36,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:36,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:45:36,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:36,360 INFO L87 Difference]: Start difference. First operand 1582 states and 7074 transitions. Second operand 11 states. [2020-02-10 19:45:36,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:36,513 INFO L93 Difference]: Finished difference Result 3036 states and 11970 transitions. [2020-02-10 19:45:36,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:45:36,513 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:45:36,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:36,521 INFO L225 Difference]: With dead ends: 3036 [2020-02-10 19:45:36,521 INFO L226 Difference]: Without dead ends: 3016 [2020-02-10 19:45:36,521 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:45:36,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3016 states. [2020-02-10 19:45:36,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3016 to 1590. [2020-02-10 19:45:36,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1590 states. [2020-02-10 19:45:36,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1590 states to 1590 states and 7088 transitions. [2020-02-10 19:45:36,595 INFO L78 Accepts]: Start accepts. Automaton has 1590 states and 7088 transitions. Word has length 28 [2020-02-10 19:45:36,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:36,596 INFO L479 AbstractCegarLoop]: Abstraction has 1590 states and 7088 transitions. [2020-02-10 19:45:36,596 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:45:36,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1590 states and 7088 transitions. [2020-02-10 19:45:36,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:45:36,599 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:36,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] [2020-02-10 19:45:36,599 INFO L427 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:36,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:36,600 INFO L82 PathProgramCache]: Analyzing trace with hash 235737308, now seen corresponding path program 108 times [2020-02-10 19:45:36,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:36,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471027801] [2020-02-10 19:45:36,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:36,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:37,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 19:45:37,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471027801] [2020-02-10 19:45:37,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:37,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:45:37,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608779068] [2020-02-10 19:45:37,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:45:37,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:37,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:45:37,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:37,177 INFO L87 Difference]: Start difference. First operand 1590 states and 7088 transitions. Second operand 11 states. [2020-02-10 19:45:37,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:37,379 INFO L93 Difference]: Finished difference Result 3033 states and 11957 transitions. [2020-02-10 19:45:37,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:45:37,380 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:45:37,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:37,387 INFO L225 Difference]: With dead ends: 3033 [2020-02-10 19:45:37,387 INFO L226 Difference]: Without dead ends: 3001 [2020-02-10 19:45:37,388 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:45:37,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3001 states. [2020-02-10 19:45:37,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3001 to 1575. [2020-02-10 19:45:37,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 19:45:37,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7054 transitions. [2020-02-10 19:45:37,456 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7054 transitions. Word has length 28 [2020-02-10 19:45:37,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:37,456 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7054 transitions. [2020-02-10 19:45:37,456 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:45:37,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7054 transitions. [2020-02-10 19:45:37,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:45:37,458 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:37,458 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:37,459 INFO L427 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:37,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:37,459 INFO L82 PathProgramCache]: Analyzing trace with hash 936605404, now seen corresponding path program 109 times [2020-02-10 19:45:37,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:37,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380390883] [2020-02-10 19:45:37,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:37,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:38,021 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 31 [2020-02-10 19:45:38,152 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 19:45:38,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:38,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380390883] [2020-02-10 19:45:38,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:38,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:45:38,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128599065] [2020-02-10 19:45:38,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:45:38,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:38,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:45:38,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:38,161 INFO L87 Difference]: Start difference. First operand 1575 states and 7054 transitions. Second operand 11 states. [2020-02-10 19:45:38,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:38,388 INFO L93 Difference]: Finished difference Result 3022 states and 11949 transitions. [2020-02-10 19:45:38,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:45:38,389 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:45:38,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:38,396 INFO L225 Difference]: With dead ends: 3022 [2020-02-10 19:45:38,396 INFO L226 Difference]: Without dead ends: 3006 [2020-02-10 19:45:38,396 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:45:38,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3006 states. [2020-02-10 19:45:38,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3006 to 1587. [2020-02-10 19:45:38,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1587 states. [2020-02-10 19:45:38,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 7088 transitions. [2020-02-10 19:45:38,465 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 7088 transitions. Word has length 28 [2020-02-10 19:45:38,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:38,465 INFO L479 AbstractCegarLoop]: Abstraction has 1587 states and 7088 transitions. [2020-02-10 19:45:38,465 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:45:38,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 7088 transitions. [2020-02-10 19:45:38,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:45:38,468 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:38,468 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:38,468 INFO L427 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:38,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:38,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1868956896, now seen corresponding path program 110 times [2020-02-10 19:45:38,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:38,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924492546] [2020-02-10 19:45:38,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:38,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:39,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:39,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924492546] [2020-02-10 19:45:39,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:39,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:45:39,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234879080] [2020-02-10 19:45:39,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:45:39,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:39,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:45:39,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:39,014 INFO L87 Difference]: Start difference. First operand 1587 states and 7088 transitions. Second operand 11 states. [2020-02-10 19:45:39,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:39,245 INFO L93 Difference]: Finished difference Result 3024 states and 11947 transitions. [2020-02-10 19:45:39,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:45:39,245 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:45:39,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:39,254 INFO L225 Difference]: With dead ends: 3024 [2020-02-10 19:45:39,254 INFO L226 Difference]: Without dead ends: 3000 [2020-02-10 19:45:39,255 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:45:39,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3000 states. [2020-02-10 19:45:39,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3000 to 1581. [2020-02-10 19:45:39,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 19:45:39,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7071 transitions. [2020-02-10 19:45:39,323 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7071 transitions. Word has length 28 [2020-02-10 19:45:39,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:39,323 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7071 transitions. [2020-02-10 19:45:39,323 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:45:39,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7071 transitions. [2020-02-10 19:45:39,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:45:39,325 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:39,326 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:39,326 INFO L427 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:39,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:39,326 INFO L82 PathProgramCache]: Analyzing trace with hash 401375602, now seen corresponding path program 111 times [2020-02-10 19:45:39,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:39,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074821592] [2020-02-10 19:45:39,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:39,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:39,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:39,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074821592] [2020-02-10 19:45:39,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:39,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:45:39,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956492362] [2020-02-10 19:45:39,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:45:39,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:39,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:45:39,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:39,874 INFO L87 Difference]: Start difference. First operand 1581 states and 7071 transitions. Second operand 11 states. [2020-02-10 19:45:40,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:40,056 INFO L93 Difference]: Finished difference Result 3021 states and 11941 transitions. [2020-02-10 19:45:40,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:45:40,057 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:45:40,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:40,064 INFO L225 Difference]: With dead ends: 3021 [2020-02-10 19:45:40,064 INFO L226 Difference]: Without dead ends: 3005 [2020-02-10 19:45:40,065 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:45:40,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3005 states. [2020-02-10 19:45:40,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3005 to 1587. [2020-02-10 19:45:40,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1587 states. [2020-02-10 19:45:40,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 7082 transitions. [2020-02-10 19:45:40,133 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 7082 transitions. Word has length 28 [2020-02-10 19:45:40,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:40,133 INFO L479 AbstractCegarLoop]: Abstraction has 1587 states and 7082 transitions. [2020-02-10 19:45:40,133 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:45:40,133 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 7082 transitions. [2020-02-10 19:45:40,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:45:40,135 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:40,135 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:40,136 INFO L427 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:40,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:40,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1319325792, now seen corresponding path program 112 times [2020-02-10 19:45:40,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:40,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157287180] [2020-02-10 19:45:40,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:40,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:40,696 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 32 [2020-02-10 19:45:40,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:40,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157287180] [2020-02-10 19:45:40,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:40,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:45:40,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801316768] [2020-02-10 19:45:40,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:45:40,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:40,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:45:40,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:40,704 INFO L87 Difference]: Start difference. First operand 1587 states and 7082 transitions. Second operand 11 states. [2020-02-10 19:45:40,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:40,892 INFO L93 Difference]: Finished difference Result 3022 states and 11937 transitions. [2020-02-10 19:45:40,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:45:40,892 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:45:40,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:40,900 INFO L225 Difference]: With dead ends: 3022 [2020-02-10 19:45:40,901 INFO L226 Difference]: Without dead ends: 2999 [2020-02-10 19:45:40,901 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:45:40,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2999 states. [2020-02-10 19:45:40,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2999 to 1581. [2020-02-10 19:45:40,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 19:45:40,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7065 transitions. [2020-02-10 19:45:40,969 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7065 transitions. Word has length 28 [2020-02-10 19:45:40,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:40,970 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7065 transitions. [2020-02-10 19:45:40,970 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:45:40,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7065 transitions. [2020-02-10 19:45:40,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:45:40,972 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:40,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] [2020-02-10 19:45:40,972 INFO L427 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:40,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:40,972 INFO L82 PathProgramCache]: Analyzing trace with hash 817695218, now seen corresponding path program 113 times [2020-02-10 19:45:40,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:40,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774125112] [2020-02-10 19:45:40,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:40,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:41,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:41,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774125112] [2020-02-10 19:45:41,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:41,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:45:41,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722964708] [2020-02-10 19:45:41,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:45:41,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:41,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:45:41,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:41,525 INFO L87 Difference]: Start difference. First operand 1581 states and 7065 transitions. Second operand 11 states. [2020-02-10 19:45:41,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:41,740 INFO L93 Difference]: Finished difference Result 3026 states and 11946 transitions. [2020-02-10 19:45:41,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:45:41,741 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:45:41,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:41,749 INFO L225 Difference]: With dead ends: 3026 [2020-02-10 19:45:41,749 INFO L226 Difference]: Without dead ends: 3008 [2020-02-10 19:45:41,749 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:45:41,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3008 states. [2020-02-10 19:45:41,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3008 to 1588. [2020-02-10 19:45:41,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1588 states. [2020-02-10 19:45:41,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 7078 transitions. [2020-02-10 19:45:41,838 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 7078 transitions. Word has length 28 [2020-02-10 19:45:41,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:41,838 INFO L479 AbstractCegarLoop]: Abstraction has 1588 states and 7078 transitions. [2020-02-10 19:45:41,839 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:45:41,839 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 7078 transitions. [2020-02-10 19:45:41,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:45:41,841 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:41,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] [2020-02-10 19:45:41,841 INFO L427 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:41,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:41,841 INFO L82 PathProgramCache]: Analyzing trace with hash 246240412, now seen corresponding path program 114 times [2020-02-10 19:45:41,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:41,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838256410] [2020-02-10 19:45:41,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:41,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:42,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 19:45:42,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838256410] [2020-02-10 19:45:42,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:42,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:45:42,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244101058] [2020-02-10 19:45:42,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:45:42,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:42,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:45:42,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:42,385 INFO L87 Difference]: Start difference. First operand 1588 states and 7078 transitions. Second operand 11 states. [2020-02-10 19:45:42,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:42,593 INFO L93 Difference]: Finished difference Result 3025 states and 11937 transitions. [2020-02-10 19:45:42,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:45:42,593 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:45:42,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:42,601 INFO L225 Difference]: With dead ends: 3025 [2020-02-10 19:45:42,601 INFO L226 Difference]: Without dead ends: 2995 [2020-02-10 19:45:42,602 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:45:42,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2995 states. [2020-02-10 19:45:42,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2995 to 1575. [2020-02-10 19:45:42,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 19:45:42,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7048 transitions. [2020-02-10 19:45:42,669 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7048 transitions. Word has length 28 [2020-02-10 19:45:42,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:42,669 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7048 transitions. [2020-02-10 19:45:42,669 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:45:42,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7048 transitions. [2020-02-10 19:45:42,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:45:42,672 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:42,672 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:42,672 INFO L427 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:42,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:42,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1691811006, now seen corresponding path program 115 times [2020-02-10 19:45:42,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:42,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278874733] [2020-02-10 19:45:42,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:42,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45: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 19:45:43,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278874733] [2020-02-10 19:45:43,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:43,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:45:43,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196871477] [2020-02-10 19:45:43,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:45:43,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:43,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:45:43,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:43,230 INFO L87 Difference]: Start difference. First operand 1575 states and 7048 transitions. Second operand 11 states. [2020-02-10 19:45:43,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:43,403 INFO L93 Difference]: Finished difference Result 3048 states and 11997 transitions. [2020-02-10 19:45:43,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:45:43,403 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:45:43,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:43,410 INFO L225 Difference]: With dead ends: 3048 [2020-02-10 19:45:43,411 INFO L226 Difference]: Without dead ends: 3028 [2020-02-10 19:45:43,411 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:45:43,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3028 states. [2020-02-10 19:45:43,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3028 to 1595. [2020-02-10 19:45:43,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1595 states. [2020-02-10 19:45:43,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1595 states to 1595 states and 7098 transitions. [2020-02-10 19:45:43,479 INFO L78 Accepts]: Start accepts. Automaton has 1595 states and 7098 transitions. Word has length 28 [2020-02-10 19:45:43,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:43,479 INFO L479 AbstractCegarLoop]: Abstraction has 1595 states and 7098 transitions. [2020-02-10 19:45:43,479 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:45:43,479 INFO L276 IsEmpty]: Start isEmpty. Operand 1595 states and 7098 transitions. [2020-02-10 19:45:43,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:45:43,482 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:43,482 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:43,482 INFO L427 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:43,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:43,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1858453792, now seen corresponding path program 116 times [2020-02-10 19:45:43,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:43,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563990405] [2020-02-10 19:45:43,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:43,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:44,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 19:45:44,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563990405] [2020-02-10 19:45:44,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:44,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:45:44,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416359037] [2020-02-10 19:45:44,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:45:44,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:44,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:45:44,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:44,064 INFO L87 Difference]: Start difference. First operand 1595 states and 7098 transitions. Second operand 11 states. [2020-02-10 19:45:44,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:44,253 INFO L93 Difference]: Finished difference Result 3046 states and 11985 transitions. [2020-02-10 19:45:44,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:45:44,253 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:45:44,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:44,261 INFO L225 Difference]: With dead ends: 3046 [2020-02-10 19:45:44,261 INFO L226 Difference]: Without dead ends: 3018 [2020-02-10 19:45:44,261 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:45:44,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3018 states. [2020-02-10 19:45:44,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3018 to 1585. [2020-02-10 19:45:44,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1585 states. [2020-02-10 19:45:44,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 7072 transitions. [2020-02-10 19:45:44,329 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 7072 transitions. Word has length 28 [2020-02-10 19:45:44,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:44,329 INFO L479 AbstractCegarLoop]: Abstraction has 1585 states and 7072 transitions. [2020-02-10 19:45:44,329 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:45:44,329 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 7072 transitions. [2020-02-10 19:45:44,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:45:44,332 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:44,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] [2020-02-10 19:45:44,332 INFO L427 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:44,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:44,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1156581204, now seen corresponding path program 117 times [2020-02-10 19:45:44,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:44,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757904907] [2020-02-10 19:45:44,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:44,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:44,883 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 31 [2020-02-10 19:45:44,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:44,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757904907] [2020-02-10 19:45:44,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:44,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:45:44,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746441088] [2020-02-10 19:45:44,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:45:44,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:44,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:45:44,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:44,892 INFO L87 Difference]: Start difference. First operand 1585 states and 7072 transitions. Second operand 11 states. [2020-02-10 19:45:45,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:45,065 INFO L93 Difference]: Finished difference Result 3045 states and 11982 transitions. [2020-02-10 19:45:45,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:45:45,066 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:45:45,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:45,073 INFO L225 Difference]: With dead ends: 3045 [2020-02-10 19:45:45,073 INFO L226 Difference]: Without dead ends: 3025 [2020-02-10 19:45:45,073 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:45:45,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3025 states. [2020-02-10 19:45:45,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3025 to 1593. [2020-02-10 19:45:45,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1593 states. [2020-02-10 19:45:45,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 7086 transitions. [2020-02-10 19:45:45,141 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 7086 transitions. Word has length 28 [2020-02-10 19:45:45,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:45,142 INFO L479 AbstractCegarLoop]: Abstraction has 1593 states and 7086 transitions. [2020-02-10 19:45:45,142 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:45:45,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 7086 transitions. [2020-02-10 19:45:45,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:45:45,144 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:45,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] [2020-02-10 19:45:45,144 INFO L427 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:45,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:45,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1329828896, now seen corresponding path program 118 times [2020-02-10 19:45:45,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:45,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731265934] [2020-02-10 19:45:45,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:45,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:45,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 19:45:45,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731265934] [2020-02-10 19:45:45,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:45,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:45:45,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211907103] [2020-02-10 19:45:45,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:45:45,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:45,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:45:45,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:45,801 INFO L87 Difference]: Start difference. First operand 1593 states and 7086 transitions. Second operand 11 states. [2020-02-10 19:45:46,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:46,013 INFO L93 Difference]: Finished difference Result 3042 states and 11969 transitions. [2020-02-10 19:45:46,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:45:46,014 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:45:46,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:46,021 INFO L225 Difference]: With dead ends: 3042 [2020-02-10 19:45:46,021 INFO L226 Difference]: Without dead ends: 3017 [2020-02-10 19:45:46,022 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:45:46,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3017 states. [2020-02-10 19:45:46,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3017 to 1585. [2020-02-10 19:45:46,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1585 states. [2020-02-10 19:45:46,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 7064 transitions. [2020-02-10 19:45:46,090 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 7064 transitions. Word has length 28 [2020-02-10 19:45:46,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:46,090 INFO L479 AbstractCegarLoop]: Abstraction has 1585 states and 7064 transitions. [2020-02-10 19:45:46,090 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:45:46,090 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 7064 transitions. [2020-02-10 19:45:46,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:45:46,092 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:46,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] [2020-02-10 19:45:46,093 INFO L427 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:46,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:46,093 INFO L82 PathProgramCache]: Analyzing trace with hash -782742636, now seen corresponding path program 119 times [2020-02-10 19:45:46,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:46,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685156622] [2020-02-10 19:45:46,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:46,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:46,659 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 33 [2020-02-10 19:45:46,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 19:45:46,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685156622] [2020-02-10 19:45:46,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:46,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:45:46,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704059936] [2020-02-10 19:45:46,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:45:46,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:46,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:45:46,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:46,669 INFO L87 Difference]: Start difference. First operand 1585 states and 7064 transitions. Second operand 11 states. [2020-02-10 19:45:46,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:46,902 INFO L93 Difference]: Finished difference Result 3040 states and 11966 transitions. [2020-02-10 19:45:46,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:45:46,902 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:45:46,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:46,910 INFO L225 Difference]: With dead ends: 3040 [2020-02-10 19:45:46,910 INFO L226 Difference]: Without dead ends: 3022 [2020-02-10 19:45:46,910 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:45:46,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3022 states. [2020-02-10 19:45:46,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3022 to 1592. [2020-02-10 19:45:46,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1592 states. [2020-02-10 19:45:46,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1592 states to 1592 states and 7077 transitions. [2020-02-10 19:45:46,977 INFO L78 Accepts]: Start accepts. Automaton has 1592 states and 7077 transitions. Word has length 28 [2020-02-10 19:45:46,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:46,978 INFO L479 AbstractCegarLoop]: Abstraction has 1592 states and 7077 transitions. [2020-02-10 19:45:46,978 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:45:46,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1592 states and 7077 transitions. [2020-02-10 19:45:46,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:45:46,980 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:46,980 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:46,981 INFO L427 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:46,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:46,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1354197442, now seen corresponding path program 120 times [2020-02-10 19:45:46,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:46,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353149816] [2020-02-10 19:45:46,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:46,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:47,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 19:45:47,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353149816] [2020-02-10 19:45:47,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:47,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:45:47,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593494284] [2020-02-10 19:45:47,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:45:47,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:47,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:45:47,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:47,541 INFO L87 Difference]: Start difference. First operand 1592 states and 7077 transitions. Second operand 11 states. [2020-02-10 19:45:47,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:47,814 INFO L93 Difference]: Finished difference Result 3039 states and 11957 transitions. [2020-02-10 19:45:47,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:45:47,815 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:45:47,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:47,821 INFO L225 Difference]: With dead ends: 3039 [2020-02-10 19:45:47,822 INFO L226 Difference]: Without dead ends: 2985 [2020-02-10 19:45:47,822 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:45:47,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2985 states. [2020-02-10 19:45:47,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2985 to 1555. [2020-02-10 19:45:47,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1555 states. [2020-02-10 19:45:47,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 7003 transitions. [2020-02-10 19:45:47,895 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 7003 transitions. Word has length 28 [2020-02-10 19:45:47,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:47,895 INFO L479 AbstractCegarLoop]: Abstraction has 1555 states and 7003 transitions. [2020-02-10 19:45:47,896 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:45:47,896 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 7003 transitions. [2020-02-10 19:45:47,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:45:47,898 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:47,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] [2020-02-10 19:45:47,899 INFO L427 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:47,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:47,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1151658060, now seen corresponding path program 121 times [2020-02-10 19:45:47,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:47,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774193533] [2020-02-10 19:45:47,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:47,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:48,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:48,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774193533] [2020-02-10 19:45:48,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:48,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:45:48,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330923977] [2020-02-10 19:45:48,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:45:48,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:48,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:45:48,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:48,443 INFO L87 Difference]: Start difference. First operand 1555 states and 7003 transitions. Second operand 11 states. [2020-02-10 19:45:48,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:48,715 INFO L93 Difference]: Finished difference Result 2966 states and 11803 transitions. [2020-02-10 19:45:48,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:45:48,716 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:45:48,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:48,724 INFO L225 Difference]: With dead ends: 2966 [2020-02-10 19:45:48,724 INFO L226 Difference]: Without dead ends: 2951 [2020-02-10 19:45:48,724 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:45:48,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2020-02-10 19:45:48,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 1579. [2020-02-10 19:45:48,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 19:45:48,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7097 transitions. [2020-02-10 19:45:48,792 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7097 transitions. Word has length 28 [2020-02-10 19:45:48,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:48,793 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7097 transitions. [2020-02-10 19:45:48,793 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:45:48,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7097 transitions. [2020-02-10 19:45:48,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:45:48,795 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:48,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] [2020-02-10 19:45:48,795 INFO L427 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:48,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:48,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1896360558, now seen corresponding path program 122 times [2020-02-10 19:45:48,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:48,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689075944] [2020-02-10 19:45:48,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:48,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:49,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 19:45:49,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689075944] [2020-02-10 19:45:49,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:49,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:45:49,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005301533] [2020-02-10 19:45:49,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:45:49,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:49,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:45:49,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:49,323 INFO L87 Difference]: Start difference. First operand 1579 states and 7097 transitions. Second operand 11 states. [2020-02-10 19:45:49,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:49,571 INFO L93 Difference]: Finished difference Result 2967 states and 11800 transitions. [2020-02-10 19:45:49,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:45:49,574 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:45:49,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:49,580 INFO L225 Difference]: With dead ends: 2967 [2020-02-10 19:45:49,580 INFO L226 Difference]: Without dead ends: 2946 [2020-02-10 19:45:49,580 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:45:49,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2946 states. [2020-02-10 19:45:49,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2946 to 1574. [2020-02-10 19:45:49,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 19:45:49,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7083 transitions. [2020-02-10 19:45:49,649 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7083 transitions. Word has length 28 [2020-02-10 19:45:49,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:49,649 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7083 transitions. [2020-02-10 19:45:49,649 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:45:49,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7083 transitions. [2020-02-10 19:45:49,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:45:49,652 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45: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] [2020-02-10 19:45:49,652 INFO L427 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:49,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:49,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1532368278, now seen corresponding path program 123 times [2020-02-10 19:45:49,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:49,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591334546] [2020-02-10 19:45:49,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:49,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:50,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 19:45:50,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591334546] [2020-02-10 19:45:50,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:50,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:45:50,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855171110] [2020-02-10 19:45:50,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:45:50,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:50,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:45:50,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:50,190 INFO L87 Difference]: Start difference. First operand 1574 states and 7083 transitions. Second operand 11 states. [2020-02-10 19:45:50,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:50,434 INFO L93 Difference]: Finished difference Result 2971 states and 11807 transitions. [2020-02-10 19:45:50,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:45:50,435 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:45:50,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:50,443 INFO L225 Difference]: With dead ends: 2971 [2020-02-10 19:45:50,443 INFO L226 Difference]: Without dead ends: 2956 [2020-02-10 19:45:50,443 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:45:50,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2020-02-10 19:45:50,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 1580. [2020-02-10 19:45:50,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 19:45:50,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7094 transitions. [2020-02-10 19:45:50,511 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7094 transitions. Word has length 28 [2020-02-10 19:45:50,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:50,511 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7094 transitions. [2020-02-10 19:45:50,511 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:45:50,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7094 transitions. [2020-02-10 19:45:50,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:45:50,514 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:50,514 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:50,514 INFO L427 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:50,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:50,514 INFO L82 PathProgramCache]: Analyzing trace with hash -42963282, now seen corresponding path program 124 times [2020-02-10 19:45:50,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:50,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706660511] [2020-02-10 19:45:50,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:50,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:51,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:51,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706660511] [2020-02-10 19:45:51,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:51,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:45:51,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200495933] [2020-02-10 19:45:51,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:45:51,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:51,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:45:51,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:51,053 INFO L87 Difference]: Start difference. First operand 1580 states and 7094 transitions. Second operand 11 states. [2020-02-10 19:45:51,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:51,260 INFO L93 Difference]: Finished difference Result 2976 states and 11811 transitions. [2020-02-10 19:45:51,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:45:51,261 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:45:51,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:51,268 INFO L225 Difference]: With dead ends: 2976 [2020-02-10 19:45:51,269 INFO L226 Difference]: Without dead ends: 2950 [2020-02-10 19:45:51,269 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:45:51,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2020-02-10 19:45:51,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 1574. [2020-02-10 19:45:51,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 19:45:51,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7077 transitions. [2020-02-10 19:45:51,338 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7077 transitions. Word has length 28 [2020-02-10 19:45:51,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:51,338 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7077 transitions. [2020-02-10 19:45:51,338 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:45:51,338 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7077 transitions. [2020-02-10 19:45:51,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:45:51,363 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:51,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] [2020-02-10 19:45:51,363 INFO L427 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:51,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:51,363 INFO L82 PathProgramCache]: Analyzing trace with hash 823275178, now seen corresponding path program 125 times [2020-02-10 19:45:51,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:51,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078148085] [2020-02-10 19:45:51,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:51,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:51,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:51,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078148085] [2020-02-10 19:45:51,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:51,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:45:51,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713575279] [2020-02-10 19:45:51,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:45:51,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:51,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:45:51,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:51,894 INFO L87 Difference]: Start difference. First operand 1574 states and 7077 transitions. Second operand 11 states. [2020-02-10 19:45:52,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:52,155 INFO L93 Difference]: Finished difference Result 2974 states and 11808 transitions. [2020-02-10 19:45:52,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:45:52,156 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:45:52,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:52,163 INFO L225 Difference]: With dead ends: 2974 [2020-02-10 19:45:52,164 INFO L226 Difference]: Without dead ends: 2958 [2020-02-10 19:45:52,164 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:45:52,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2958 states. [2020-02-10 19:45:52,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2958 to 1581. [2020-02-10 19:45:52,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 19:45:52,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7090 transitions. [2020-02-10 19:45:52,232 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7090 transitions. Word has length 28 [2020-02-10 19:45:52,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:52,232 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7090 transitions. [2020-02-10 19:45:52,232 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:45:52,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7090 transitions. [2020-02-10 19:45:52,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:45:52,234 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:52,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] [2020-02-10 19:45:52,234 INFO L427 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:52,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:52,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1567977676, now seen corresponding path program 126 times [2020-02-10 19:45:52,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:52,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259383319] [2020-02-10 19:45:52,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:52,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:52,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:52,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259383319] [2020-02-10 19:45:52,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:52,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:45:52,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672286104] [2020-02-10 19:45:52,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:45:52,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:52,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:45:52,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:52,777 INFO L87 Difference]: Start difference. First operand 1581 states and 7090 transitions. Second operand 11 states. [2020-02-10 19:45:52,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:52,950 INFO L93 Difference]: Finished difference Result 2978 states and 11809 transitions. [2020-02-10 19:45:52,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:45:52,950 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:45:52,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:52,958 INFO L225 Difference]: With dead ends: 2978 [2020-02-10 19:45:52,958 INFO L226 Difference]: Without dead ends: 2945 [2020-02-10 19:45:52,958 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:45:53,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2945 states. [2020-02-10 19:45:53,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2945 to 1568. [2020-02-10 19:45:53,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 19:45:53,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7060 transitions. [2020-02-10 19:45:53,030 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7060 transitions. Word has length 28 [2020-02-10 19:45:53,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:53,030 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7060 transitions. [2020-02-10 19:45:53,030 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:45:53,031 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7060 transitions. [2020-02-10 19:45:53,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:45:53,033 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:53,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] [2020-02-10 19:45:53,033 INFO L427 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:53,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:53,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1871670534, now seen corresponding path program 127 times [2020-02-10 19:45:53,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:53,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142295560] [2020-02-10 19:45:53,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:53,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:53,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:53,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142295560] [2020-02-10 19:45:53,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:53,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:45:53,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099779296] [2020-02-10 19:45:53,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:45:53,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:53,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:45:53,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:53,568 INFO L87 Difference]: Start difference. First operand 1568 states and 7060 transitions. Second operand 11 states. [2020-02-10 19:45:53,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:53,803 INFO L93 Difference]: Finished difference Result 2961 states and 11787 transitions. [2020-02-10 19:45:53,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:45:53,804 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:45:53,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:53,812 INFO L225 Difference]: With dead ends: 2961 [2020-02-10 19:45:53,813 INFO L226 Difference]: Without dead ends: 2946 [2020-02-10 19:45:53,813 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:45:53,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2946 states. [2020-02-10 19:45:53,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2946 to 1578. [2020-02-10 19:45:53,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 19:45:53,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7088 transitions. [2020-02-10 19:45:53,897 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7088 transitions. Word has length 28 [2020-02-10 19:45:53,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:53,897 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7088 transitions. [2020-02-10 19:45:53,897 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:45:53,897 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7088 transitions. [2020-02-10 19:45:53,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:45:53,899 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:53,899 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:53,899 INFO L427 AbstractCegarLoop]: === Iteration 136 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:53,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:53,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1678594264, now seen corresponding path program 128 times [2020-02-10 19:45:53,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:53,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912751241] [2020-02-10 19:45:53,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:53,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:54,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 19:45:54,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912751241] [2020-02-10 19:45:54,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:54,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:45:54,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121258953] [2020-02-10 19:45:54,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:45:54,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:54,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:45:54,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:54,432 INFO L87 Difference]: Start difference. First operand 1578 states and 7088 transitions. Second operand 11 states. [2020-02-10 19:45:54,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:54,650 INFO L93 Difference]: Finished difference Result 2962 states and 11784 transitions. [2020-02-10 19:45:54,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:45:54,650 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:45:54,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:54,658 INFO L225 Difference]: With dead ends: 2962 [2020-02-10 19:45:54,658 INFO L226 Difference]: Without dead ends: 2941 [2020-02-10 19:45:54,659 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:45:54,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2941 states. [2020-02-10 19:45:54,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2941 to 1573. [2020-02-10 19:45:54,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 19:45:54,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7074 transitions. [2020-02-10 19:45:54,725 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7074 transitions. Word has length 28 [2020-02-10 19:45:54,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:54,725 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7074 transitions. [2020-02-10 19:45:54,725 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:45:54,726 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7074 transitions. [2020-02-10 19:45:54,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:45:54,728 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:54,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] [2020-02-10 19:45:54,728 INFO L427 AbstractCegarLoop]: === Iteration 137 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:54,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:54,728 INFO L82 PathProgramCache]: Analyzing trace with hash 798585154, now seen corresponding path program 129 times [2020-02-10 19:45:54,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:54,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293233794] [2020-02-10 19:45:54,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:54,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:55,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 19:45:55,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293233794] [2020-02-10 19:45:55,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:55,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:45:55,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146916401] [2020-02-10 19:45:55,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:45:55,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:55,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:45:55,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:55,255 INFO L87 Difference]: Start difference. First operand 1573 states and 7074 transitions. Second operand 11 states. [2020-02-10 19:45:55,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:55,521 INFO L93 Difference]: Finished difference Result 2963 states and 11786 transitions. [2020-02-10 19:45:55,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:45:55,522 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:45:55,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:55,529 INFO L225 Difference]: With dead ends: 2963 [2020-02-10 19:45:55,529 INFO L226 Difference]: Without dead ends: 2948 [2020-02-10 19:45:55,529 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:45:55,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2948 states. [2020-02-10 19:45:55,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2948 to 1578. [2020-02-10 19:45:55,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 19:45:55,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7083 transitions. [2020-02-10 19:45:55,597 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7083 transitions. Word has length 28 [2020-02-10 19:45:55,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:55,597 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7083 transitions. [2020-02-10 19:45:55,597 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:45:55,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7083 transitions. [2020-02-10 19:45:55,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:45:55,600 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:55,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] [2020-02-10 19:45:55,600 INFO L427 AbstractCegarLoop]: === Iteration 138 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:55,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:55,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1262274648, now seen corresponding path program 130 times [2020-02-10 19:45:55,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:55,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467657356] [2020-02-10 19:45:55,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:55,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:56,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:56,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467657356] [2020-02-10 19:45:56,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:56,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:45:56,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686216485] [2020-02-10 19:45:56,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:45:56,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:56,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:45:56,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:56,125 INFO L87 Difference]: Start difference. First operand 1578 states and 7083 transitions. Second operand 11 states. [2020-02-10 19:45:56,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:56,351 INFO L93 Difference]: Finished difference Result 2966 states and 11787 transitions. [2020-02-10 19:45:56,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:45:56,351 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:45:56,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:56,359 INFO L225 Difference]: With dead ends: 2966 [2020-02-10 19:45:56,359 INFO L226 Difference]: Without dead ends: 2943 [2020-02-10 19:45:56,359 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:45:56,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2943 states. [2020-02-10 19:45:56,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2943 to 1573. [2020-02-10 19:45:56,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 19:45:56,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7069 transitions. [2020-02-10 19:45:56,427 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7069 transitions. Word has length 28 [2020-02-10 19:45:56,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:56,427 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7069 transitions. [2020-02-10 19:45:56,427 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:45:56,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7069 transitions. [2020-02-10 19:45:56,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:45:56,429 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:56,429 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:56,429 INFO L427 AbstractCegarLoop]: === Iteration 139 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:56,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:56,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1140738686, now seen corresponding path program 131 times [2020-02-10 19:45:56,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:56,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838413626] [2020-02-10 19:45:56,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:56,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:56,953 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 19:45:56,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:56,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838413626] [2020-02-10 19:45:56,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:56,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:45:56,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003223201] [2020-02-10 19:45:56,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:45:56,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:56,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:45:56,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:56,962 INFO L87 Difference]: Start difference. First operand 1573 states and 7069 transitions. Second operand 11 states. [2020-02-10 19:45:57,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:57,138 INFO L93 Difference]: Finished difference Result 2966 states and 11788 transitions. [2020-02-10 19:45:57,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:45:57,138 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:45:57,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:57,146 INFO L225 Difference]: With dead ends: 2966 [2020-02-10 19:45:57,146 INFO L226 Difference]: Without dead ends: 2950 [2020-02-10 19:45:57,146 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:45:57,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2020-02-10 19:45:57,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 1579. [2020-02-10 19:45:57,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 19:45:57,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7080 transitions. [2020-02-10 19:45:57,213 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7080 transitions. Word has length 28 [2020-02-10 19:45:57,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:57,214 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7080 transitions. [2020-02-10 19:45:57,214 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:45:57,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7080 transitions. [2020-02-10 19:45:57,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:45:57,216 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:57,216 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:57,216 INFO L427 AbstractCegarLoop]: === Iteration 140 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:57,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:57,216 INFO L82 PathProgramCache]: Analyzing trace with hash 348666310, now seen corresponding path program 132 times [2020-02-10 19:45:57,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:57,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050836436] [2020-02-10 19:45:57,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:57,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:57,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:45:57,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050836436] [2020-02-10 19:45:57,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:57,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:45:57,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977173699] [2020-02-10 19:45:57,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:45:57,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:57,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:45:57,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:57,740 INFO L87 Difference]: Start difference. First operand 1579 states and 7080 transitions. Second operand 11 states. [2020-02-10 19:45:57,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:57,920 INFO L93 Difference]: Finished difference Result 2968 states and 11786 transitions. [2020-02-10 19:45:57,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:45:57,920 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:45:57,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:57,928 INFO L225 Difference]: With dead ends: 2968 [2020-02-10 19:45:57,928 INFO L226 Difference]: Without dead ends: 2939 [2020-02-10 19:45:57,928 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:45:57,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2939 states. [2020-02-10 19:45:57,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2939 to 1568. [2020-02-10 19:45:57,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 19:45:57,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7055 transitions. [2020-02-10 19:45:57,996 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7055 transitions. Word has length 28 [2020-02-10 19:45:57,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:57,996 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7055 transitions. [2020-02-10 19:45:57,996 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:45:57,996 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7055 transitions. [2020-02-10 19:45:57,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:45:57,998 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:57,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] [2020-02-10 19:45:57,999 INFO L427 AbstractCegarLoop]: === Iteration 141 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:57,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:57,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1882173638, now seen corresponding path program 133 times [2020-02-10 19:45:57,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:57,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142562037] [2020-02-10 19:45:57,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:58,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:58,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 19:45:58,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142562037] [2020-02-10 19:45:58,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:58,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:45:58,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629868557] [2020-02-10 19:45:58,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:45:58,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:58,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:45:58,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:58,540 INFO L87 Difference]: Start difference. First operand 1568 states and 7055 transitions. Second operand 11 states. [2020-02-10 19:45:58,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:58,717 INFO L93 Difference]: Finished difference Result 2977 states and 11814 transitions. [2020-02-10 19:45:58,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:45:58,717 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:45:58,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:58,725 INFO L225 Difference]: With dead ends: 2977 [2020-02-10 19:45:58,725 INFO L226 Difference]: Without dead ends: 2962 [2020-02-10 19:45:58,725 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:45:58,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2962 states. [2020-02-10 19:45:58,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2962 to 1581. [2020-02-10 19:45:58,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 19:45:58,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7090 transitions. [2020-02-10 19:45:58,792 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7090 transitions. Word has length 28 [2020-02-10 19:45:58,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:58,793 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7090 transitions. [2020-02-10 19:45:58,793 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:45:58,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7090 transitions. [2020-02-10 19:45:58,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:45:58,795 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:58,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] [2020-02-10 19:45:58,795 INFO L427 AbstractCegarLoop]: === Iteration 142 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:58,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:58,795 INFO L82 PathProgramCache]: Analyzing trace with hash -923388662, now seen corresponding path program 134 times [2020-02-10 19:45:58,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:58,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528889039] [2020-02-10 19:45:58,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:58,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:45:59,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 19:45:59,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528889039] [2020-02-10 19:45:59,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:45:59,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:45:59,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105595430] [2020-02-10 19:45:59,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:45:59,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:45:59,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:45:59,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:45:59,327 INFO L87 Difference]: Start difference. First operand 1581 states and 7090 transitions. Second operand 11 states. [2020-02-10 19:45:59,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:45:59,469 INFO L93 Difference]: Finished difference Result 2982 states and 11818 transitions. [2020-02-10 19:45:59,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:45:59,469 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:45:59,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:45:59,476 INFO L225 Difference]: With dead ends: 2982 [2020-02-10 19:45:59,477 INFO L226 Difference]: Without dead ends: 2956 [2020-02-10 19:45:59,477 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:45:59,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2020-02-10 19:45:59,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 1575. [2020-02-10 19:45:59,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 19:45:59,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7073 transitions. [2020-02-10 19:45:59,544 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7073 transitions. Word has length 28 [2020-02-10 19:45:59,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:45:59,544 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7073 transitions. [2020-02-10 19:45:59,545 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:45:59,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7073 transitions. [2020-02-10 19:45:59,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:45:59,547 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:45:59,547 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:45:59,547 INFO L427 AbstractCegarLoop]: === Iteration 143 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:45:59,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:45:59,547 INFO L82 PathProgramCache]: Analyzing trace with hash -801852700, now seen corresponding path program 135 times [2020-02-10 19:45:59,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:45:59,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115364730] [2020-02-10 19:45:59,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:45:59,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:00,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:00,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115364730] [2020-02-10 19:46:00,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:00,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:46:00,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452951670] [2020-02-10 19:46:00,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:46:00,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:00,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:46:00,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:00,079 INFO L87 Difference]: Start difference. First operand 1575 states and 7073 transitions. Second operand 11 states. [2020-02-10 19:46:00,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:00,257 INFO L93 Difference]: Finished difference Result 2974 states and 11803 transitions. [2020-02-10 19:46:00,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:46:00,257 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:46:00,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:00,265 INFO L225 Difference]: With dead ends: 2974 [2020-02-10 19:46:00,265 INFO L226 Difference]: Without dead ends: 2959 [2020-02-10 19:46:00,265 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:46:00,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2959 states. [2020-02-10 19:46:00,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2959 to 1580. [2020-02-10 19:46:00,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 19:46:00,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7082 transitions. [2020-02-10 19:46:00,333 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7082 transitions. Word has length 28 [2020-02-10 19:46:00,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:00,333 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7082 transitions. [2020-02-10 19:46:00,333 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:46:00,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7082 transitions. [2020-02-10 19:46:00,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:46:00,335 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:00,335 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:00,335 INFO L427 AbstractCegarLoop]: === Iteration 144 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:00,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:00,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1432254794, now seen corresponding path program 136 times [2020-02-10 19:46:00,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:00,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011583738] [2020-02-10 19:46:00,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:00,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:00,877 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 31 [2020-02-10 19:46:00,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:00,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011583738] [2020-02-10 19:46:00,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:00,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:46:00,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185681571] [2020-02-10 19:46:00,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:46:00,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:00,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:46:00,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:00,885 INFO L87 Difference]: Start difference. First operand 1580 states and 7082 transitions. Second operand 11 states. [2020-02-10 19:46:01,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:01,062 INFO L93 Difference]: Finished difference Result 2977 states and 11804 transitions. [2020-02-10 19:46:01,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:46:01,063 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:46:01,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:01,070 INFO L225 Difference]: With dead ends: 2977 [2020-02-10 19:46:01,070 INFO L226 Difference]: Without dead ends: 2954 [2020-02-10 19:46:01,071 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:46:01,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2020-02-10 19:46:01,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 1575. [2020-02-10 19:46:01,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 19:46:01,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7068 transitions. [2020-02-10 19:46:01,138 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7068 transitions. Word has length 28 [2020-02-10 19:46:01,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:01,138 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7068 transitions. [2020-02-10 19:46:01,138 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:46:01,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7068 transitions. [2020-02-10 19:46:01,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:46:01,141 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:01,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] [2020-02-10 19:46:01,141 INFO L427 AbstractCegarLoop]: === Iteration 145 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:01,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:01,141 INFO L82 PathProgramCache]: Analyzing trace with hash -385533084, now seen corresponding path program 137 times [2020-02-10 19:46:01,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:01,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554261301] [2020-02-10 19:46:01,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:01,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:01,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 19:46:01,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554261301] [2020-02-10 19:46:01,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:01,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:46:01,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632655452] [2020-02-10 19:46:01,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:46:01,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:01,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:46:01,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:01,713 INFO L87 Difference]: Start difference. First operand 1575 states and 7068 transitions. Second operand 11 states. [2020-02-10 19:46:01,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:01,855 INFO L93 Difference]: Finished difference Result 2989 states and 11828 transitions. [2020-02-10 19:46:01,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:46:01,855 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:46:01,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:01,863 INFO L225 Difference]: With dead ends: 2989 [2020-02-10 19:46:01,863 INFO L226 Difference]: Without dead ends: 2969 [2020-02-10 19:46:01,864 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:46:01,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2969 states. [2020-02-10 19:46:01,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2969 to 1585. [2020-02-10 19:46:01,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1585 states. [2020-02-10 19:46:01,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 7085 transitions. [2020-02-10 19:46:01,931 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 7085 transitions. Word has length 28 [2020-02-10 19:46:01,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:01,931 INFO L479 AbstractCegarLoop]: Abstraction has 1585 states and 7085 transitions. [2020-02-10 19:46:01,931 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:46:01,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 7085 transitions. [2020-02-10 19:46:01,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:46:01,933 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:01,934 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:01,934 INFO L427 AbstractCegarLoop]: === Iteration 146 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:01,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:01,934 INFO L82 PathProgramCache]: Analyzing trace with hash 359169414, now seen corresponding path program 138 times [2020-02-10 19:46:01,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:01,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970629185] [2020-02-10 19:46:01,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:01,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:02,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:02,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970629185] [2020-02-10 19:46:02,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:02,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:46:02,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725355214] [2020-02-10 19:46:02,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:46:02,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:02,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:46:02,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:02,506 INFO L87 Difference]: Start difference. First operand 1585 states and 7085 transitions. Second operand 11 states. [2020-02-10 19:46:02,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:02,775 INFO L93 Difference]: Finished difference Result 2987 states and 11816 transitions. [2020-02-10 19:46:02,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:46:02,776 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:46:02,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:02,785 INFO L225 Difference]: With dead ends: 2987 [2020-02-10 19:46:02,785 INFO L226 Difference]: Without dead ends: 2952 [2020-02-10 19:46:02,785 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:46:02,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2952 states. [2020-02-10 19:46:02,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2952 to 1568. [2020-02-10 19:46:02,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 19:46:02,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7048 transitions. [2020-02-10 19:46:02,932 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7048 transitions. Word has length 28 [2020-02-10 19:46:02,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:02,932 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7048 transitions. [2020-02-10 19:46:02,933 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:46:02,933 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7048 transitions. [2020-02-10 19:46:02,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:46:02,938 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:02,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] [2020-02-10 19:46:02,938 INFO L427 AbstractCegarLoop]: === Iteration 147 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:02,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:02,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1657588056, now seen corresponding path program 139 times [2020-02-10 19:46:02,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:02,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954090826] [2020-02-10 19:46:02,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:02,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:03,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:03,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954090826] [2020-02-10 19:46:03,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:03,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:46:03,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400986227] [2020-02-10 19:46:03,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:46:03,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:03,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:46:03,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:03,622 INFO L87 Difference]: Start difference. First operand 1568 states and 7048 transitions. Second operand 11 states. [2020-02-10 19:46:03,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:03,791 INFO L93 Difference]: Finished difference Result 2984 states and 11826 transitions. [2020-02-10 19:46:03,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:46:03,792 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:46:03,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:03,799 INFO L225 Difference]: With dead ends: 2984 [2020-02-10 19:46:03,799 INFO L226 Difference]: Without dead ends: 2968 [2020-02-10 19:46:03,800 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:46:03,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2968 states. [2020-02-10 19:46:03,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2968 to 1583. [2020-02-10 19:46:03,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 19:46:03,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7089 transitions. [2020-02-10 19:46:03,867 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7089 transitions. Word has length 28 [2020-02-10 19:46:03,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:03,868 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7089 transitions. [2020-02-10 19:46:03,868 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:46:03,868 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7089 transitions. [2020-02-10 19:46:03,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:46:03,870 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:03,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] [2020-02-10 19:46:03,870 INFO L427 AbstractCegarLoop]: === Iteration 148 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:03,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:03,870 INFO L82 PathProgramCache]: Analyzing trace with hash -912885558, now seen corresponding path program 140 times [2020-02-10 19:46:03,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:03,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894094803] [2020-02-10 19:46:03,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:03,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:04,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 19:46:04,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894094803] [2020-02-10 19:46:04,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:04,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:46:04,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521748437] [2020-02-10 19:46:04,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:46:04,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:04,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:46:04,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:04,429 INFO L87 Difference]: Start difference. First operand 1583 states and 7089 transitions. Second operand 11 states. [2020-02-10 19:46:04,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:04,570 INFO L93 Difference]: Finished difference Result 2988 states and 11827 transitions. [2020-02-10 19:46:04,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:46:04,571 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:46:04,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:04,578 INFO L225 Difference]: With dead ends: 2988 [2020-02-10 19:46:04,579 INFO L226 Difference]: Without dead ends: 2961 [2020-02-10 19:46:04,579 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:46:04,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2961 states. [2020-02-10 19:46:04,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2961 to 1576. [2020-02-10 19:46:04,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 19:46:04,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7069 transitions. [2020-02-10 19:46:04,646 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7069 transitions. Word has length 28 [2020-02-10 19:46:04,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:04,646 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7069 transitions. [2020-02-10 19:46:04,646 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:46:04,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7069 transitions. [2020-02-10 19:46:04,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:46:04,649 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:04,649 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:04,649 INFO L427 AbstractCegarLoop]: === Iteration 149 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:04,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:04,649 INFO L82 PathProgramCache]: Analyzing trace with hash -46647098, now seen corresponding path program 141 times [2020-02-10 19:46:04,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:04,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430746670] [2020-02-10 19:46:04,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:04,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:05,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 19:46:05,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430746670] [2020-02-10 19:46:05,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:05,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:46:05,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713063005] [2020-02-10 19:46:05,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:46:05,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:05,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:46:05,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:05,189 INFO L87 Difference]: Start difference. First operand 1576 states and 7069 transitions. Second operand 11 states. [2020-02-10 19:46:05,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:05,369 INFO L93 Difference]: Finished difference Result 2981 states and 11814 transitions. [2020-02-10 19:46:05,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:46:05,370 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:46:05,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:05,378 INFO L225 Difference]: With dead ends: 2981 [2020-02-10 19:46:05,378 INFO L226 Difference]: Without dead ends: 2965 [2020-02-10 19:46:05,378 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:46:05,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2965 states. [2020-02-10 19:46:05,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2965 to 1582. [2020-02-10 19:46:05,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2020-02-10 19:46:05,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 7080 transitions. [2020-02-10 19:46:05,451 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 7080 transitions. Word has length 28 [2020-02-10 19:46:05,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:05,451 INFO L479 AbstractCegarLoop]: Abstraction has 1582 states and 7080 transitions. [2020-02-10 19:46:05,451 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:46:05,451 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 7080 transitions. [2020-02-10 19:46:05,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:46:05,454 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:05,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] [2020-02-10 19:46:05,454 INFO L427 AbstractCegarLoop]: === Iteration 150 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:05,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:05,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1442757898, now seen corresponding path program 142 times [2020-02-10 19:46:05,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:05,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601319695] [2020-02-10 19:46:05,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:05,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:06,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:06,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601319695] [2020-02-10 19:46:06,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:06,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:46:06,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295104049] [2020-02-10 19:46:06,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:46:06,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:06,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:46:06,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:06,023 INFO L87 Difference]: Start difference. First operand 1582 states and 7080 transitions. Second operand 11 states. [2020-02-10 19:46:06,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:06,230 INFO L93 Difference]: Finished difference Result 2983 states and 11812 transitions. [2020-02-10 19:46:06,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:46:06,231 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:46:06,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:06,238 INFO L225 Difference]: With dead ends: 2983 [2020-02-10 19:46:06,238 INFO L226 Difference]: Without dead ends: 2959 [2020-02-10 19:46:06,238 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:46:06,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2959 states. [2020-02-10 19:46:06,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2959 to 1576. [2020-02-10 19:46:06,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 19:46:06,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7063 transitions. [2020-02-10 19:46:06,306 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7063 transitions. Word has length 28 [2020-02-10 19:46:06,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:06,306 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7063 transitions. [2020-02-10 19:46:06,306 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:46:06,307 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7063 transitions. [2020-02-10 19:46:06,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:46:06,310 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:06,310 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:06,310 INFO L427 AbstractCegarLoop]: === Iteration 151 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:06,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:06,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1985970938, now seen corresponding path program 143 times [2020-02-10 19:46:06,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:06,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588787142] [2020-02-10 19:46:06,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:06,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:06,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:06,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588787142] [2020-02-10 19:46:06,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:06,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:46:06,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082989361] [2020-02-10 19:46:06,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:46:06,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:06,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:46:06,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:06,881 INFO L87 Difference]: Start difference. First operand 1576 states and 7063 transitions. Second operand 11 states. [2020-02-10 19:46:07,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:07,020 INFO L93 Difference]: Finished difference Result 2993 states and 11831 transitions. [2020-02-10 19:46:07,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:46:07,021 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:46:07,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:07,028 INFO L225 Difference]: With dead ends: 2993 [2020-02-10 19:46:07,029 INFO L226 Difference]: Without dead ends: 2973 [2020-02-10 19:46:07,029 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:46:07,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2973 states. [2020-02-10 19:46:07,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2973 to 1586. [2020-02-10 19:46:07,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1586 states. [2020-02-10 19:46:07,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1586 states and 7080 transitions. [2020-02-10 19:46:07,097 INFO L78 Accepts]: Start accepts. Automaton has 1586 states and 7080 transitions. Word has length 28 [2020-02-10 19:46:07,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:07,097 INFO L479 AbstractCegarLoop]: Abstraction has 1586 states and 7080 transitions. [2020-02-10 19:46:07,097 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:46:07,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1586 states and 7080 transitions. [2020-02-10 19:46:07,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:46:07,099 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:07,099 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:07,099 INFO L427 AbstractCegarLoop]: === Iteration 152 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:07,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:07,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1241268440, now seen corresponding path program 144 times [2020-02-10 19:46:07,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:07,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023165583] [2020-02-10 19:46:07,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:07,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:07,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 19:46:07,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023165583] [2020-02-10 19:46:07,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:07,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:46:07,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327450117] [2020-02-10 19:46:07,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:46:07,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:07,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:46:07,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:07,640 INFO L87 Difference]: Start difference. First operand 1586 states and 7080 transitions. Second operand 11 states. [2020-02-10 19:46:07,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:07,825 INFO L93 Difference]: Finished difference Result 2991 states and 11819 transitions. [2020-02-10 19:46:07,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:46:07,825 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:46:07,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:07,832 INFO L225 Difference]: With dead ends: 2991 [2020-02-10 19:46:07,832 INFO L226 Difference]: Without dead ends: 2948 [2020-02-10 19:46:07,833 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:46:07,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2948 states. [2020-02-10 19:46:07,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2948 to 1561. [2020-02-10 19:46:07,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1561 states. [2020-02-10 19:46:07,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 7029 transitions. [2020-02-10 19:46:07,900 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 7029 transitions. Word has length 28 [2020-02-10 19:46:07,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:07,900 INFO L479 AbstractCegarLoop]: Abstraction has 1561 states and 7029 transitions. [2020-02-10 19:46:07,900 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:46:07,900 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 7029 transitions. [2020-02-10 19:46:07,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:46:07,902 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:07,902 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:07,902 INFO L427 AbstractCegarLoop]: === Iteration 153 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:07,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:07,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1398945230, now seen corresponding path program 145 times [2020-02-10 19:46:07,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:07,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415730562] [2020-02-10 19:46:07,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:07,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:08,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:08,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415730562] [2020-02-10 19:46:08,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:08,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:46:08,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880641414] [2020-02-10 19:46:08,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:46:08,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:08,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:46:08,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:08,444 INFO L87 Difference]: Start difference. First operand 1561 states and 7029 transitions. Second operand 11 states. [2020-02-10 19:46:08,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:08,627 INFO L93 Difference]: Finished difference Result 2946 states and 11739 transitions. [2020-02-10 19:46:08,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:46:08,627 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:46:08,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:08,635 INFO L225 Difference]: With dead ends: 2946 [2020-02-10 19:46:08,635 INFO L226 Difference]: Without dead ends: 2931 [2020-02-10 19:46:08,635 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:46:08,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2931 states. [2020-02-10 19:46:08,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2931 to 1577. [2020-02-10 19:46:08,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 19:46:08,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7083 transitions. [2020-02-10 19:46:08,703 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7083 transitions. Word has length 28 [2020-02-10 19:46:08,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:08,703 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7083 transitions. [2020-02-10 19:46:08,703 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:46:08,703 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7083 transitions. [2020-02-10 19:46:08,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:46:08,706 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:08,706 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:08,706 INFO L427 AbstractCegarLoop]: === Iteration 154 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:08,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:08,706 INFO L82 PathProgramCache]: Analyzing trace with hash -654242732, now seen corresponding path program 146 times [2020-02-10 19:46:08,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:08,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339688562] [2020-02-10 19:46:08,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:08,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:09,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 19:46:09,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339688562] [2020-02-10 19:46:09,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:09,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:46:09,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251995523] [2020-02-10 19:46:09,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:46:09,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:09,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:46:09,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:09,244 INFO L87 Difference]: Start difference. First operand 1577 states and 7083 transitions. Second operand 11 states. [2020-02-10 19:46:09,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:09,417 INFO L93 Difference]: Finished difference Result 2947 states and 11736 transitions. [2020-02-10 19:46:09,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:46:09,417 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:46:09,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:09,424 INFO L225 Difference]: With dead ends: 2947 [2020-02-10 19:46:09,424 INFO L226 Difference]: Without dead ends: 2926 [2020-02-10 19:46:09,425 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:46:09,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2926 states. [2020-02-10 19:46:09,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2926 to 1572. [2020-02-10 19:46:09,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 19:46:09,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7069 transitions. [2020-02-10 19:46:09,492 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7069 transitions. Word has length 28 [2020-02-10 19:46:09,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:09,492 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7069 transitions. [2020-02-10 19:46:09,492 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:46:09,492 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7069 transitions. [2020-02-10 19:46:09,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:46:09,494 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:09,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] [2020-02-10 19:46:09,494 INFO L427 AbstractCegarLoop]: === Iteration 155 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:09,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:09,495 INFO L82 PathProgramCache]: Analyzing trace with hash 211995728, now seen corresponding path program 147 times [2020-02-10 19:46:09,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:09,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130737394] [2020-02-10 19:46:09,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:09,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:10,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 19:46:10,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130737394] [2020-02-10 19:46:10,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:10,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:46:10,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199798707] [2020-02-10 19:46:10,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:46:10,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:10,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:46:10,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:10,027 INFO L87 Difference]: Start difference. First operand 1572 states and 7069 transitions. Second operand 11 states. [2020-02-10 19:46:10,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:10,244 INFO L93 Difference]: Finished difference Result 2951 states and 11743 transitions. [2020-02-10 19:46:10,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:46:10,245 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:46:10,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:10,252 INFO L225 Difference]: With dead ends: 2951 [2020-02-10 19:46:10,252 INFO L226 Difference]: Without dead ends: 2936 [2020-02-10 19:46:10,253 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:46:10,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2936 states. [2020-02-10 19:46:10,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2936 to 1578. [2020-02-10 19:46:10,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 19:46:10,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7080 transitions. [2020-02-10 19:46:10,320 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7080 transitions. Word has length 28 [2020-02-10 19:46:10,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:10,320 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7080 transitions. [2020-02-10 19:46:10,320 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:46:10,320 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7080 transitions. [2020-02-10 19:46:10,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:46:10,322 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:10,322 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:10,322 INFO L427 AbstractCegarLoop]: === Iteration 156 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:10,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:10,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1701400724, now seen corresponding path program 148 times [2020-02-10 19:46:10,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:10,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315077850] [2020-02-10 19:46:10,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:10,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:10,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:10,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315077850] [2020-02-10 19:46:10,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:10,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:46:10,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775906576] [2020-02-10 19:46:10,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:46:10,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:10,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:46:10,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:10,887 INFO L87 Difference]: Start difference. First operand 1578 states and 7080 transitions. Second operand 11 states. [2020-02-10 19:46:11,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:11,037 INFO L93 Difference]: Finished difference Result 2956 states and 11747 transitions. [2020-02-10 19:46:11,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:46:11,037 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:46:11,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:11,044 INFO L225 Difference]: With dead ends: 2956 [2020-02-10 19:46:11,045 INFO L226 Difference]: Without dead ends: 2930 [2020-02-10 19:46:11,045 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:46:11,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2020-02-10 19:46:11,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 1572. [2020-02-10 19:46:11,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 19:46:11,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7063 transitions. [2020-02-10 19:46:11,112 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7063 transitions. Word has length 28 [2020-02-10 19:46:11,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:11,112 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7063 transitions. [2020-02-10 19:46:11,112 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:46:11,112 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7063 transitions. [2020-02-10 19:46:11,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:46:11,115 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:11,115 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:11,115 INFO L427 AbstractCegarLoop]: === Iteration 157 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:11,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:11,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1727328112, now seen corresponding path program 149 times [2020-02-10 19:46:11,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:11,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486800707] [2020-02-10 19:46:11,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:11,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:11,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:11,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486800707] [2020-02-10 19:46:11,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:11,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:46:11,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614876216] [2020-02-10 19:46:11,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:46:11,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:11,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:46:11,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:11,660 INFO L87 Difference]: Start difference. First operand 1572 states and 7063 transitions. Second operand 11 states. [2020-02-10 19:46:11,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:11,835 INFO L93 Difference]: Finished difference Result 2954 states and 11744 transitions. [2020-02-10 19:46:11,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:46:11,836 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:46:11,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:11,843 INFO L225 Difference]: With dead ends: 2954 [2020-02-10 19:46:11,843 INFO L226 Difference]: Without dead ends: 2938 [2020-02-10 19:46:11,844 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:46:11,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2938 states. [2020-02-10 19:46:11,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2938 to 1579. [2020-02-10 19:46:11,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 19:46:11,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7076 transitions. [2020-02-10 19:46:11,911 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7076 transitions. Word has length 28 [2020-02-10 19:46:11,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:11,911 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7076 transitions. [2020-02-10 19:46:11,911 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:46:11,911 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7076 transitions. [2020-02-10 19:46:11,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:46:11,914 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:11,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] [2020-02-10 19:46:11,914 INFO L427 AbstractCegarLoop]: === Iteration 158 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:11,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:11,914 INFO L82 PathProgramCache]: Analyzing trace with hash -982625614, now seen corresponding path program 150 times [2020-02-10 19:46:11,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:11,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870943635] [2020-02-10 19:46:11,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:11,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:12,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:12,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870943635] [2020-02-10 19:46:12,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:12,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:46:12,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593522022] [2020-02-10 19:46:12,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:46:12,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:12,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:46:12,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:12,467 INFO L87 Difference]: Start difference. First operand 1579 states and 7076 transitions. Second operand 11 states. [2020-02-10 19:46:12,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:12,611 INFO L93 Difference]: Finished difference Result 2958 states and 11745 transitions. [2020-02-10 19:46:12,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:46:12,611 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:46:12,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:12,619 INFO L225 Difference]: With dead ends: 2958 [2020-02-10 19:46:12,619 INFO L226 Difference]: Without dead ends: 2925 [2020-02-10 19:46:12,619 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:46:12,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2925 states. [2020-02-10 19:46:12,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2925 to 1566. [2020-02-10 19:46:12,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1566 states. [2020-02-10 19:46:12,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 7047 transitions. [2020-02-10 19:46:12,686 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 7047 transitions. Word has length 28 [2020-02-10 19:46:12,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:12,686 INFO L479 AbstractCegarLoop]: Abstraction has 1566 states and 7047 transitions. [2020-02-10 19:46:12,686 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:46:12,687 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 7047 transitions. [2020-02-10 19:46:12,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:46:12,689 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:12,689 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:12,689 INFO L427 AbstractCegarLoop]: === Iteration 159 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:12,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:12,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1606068116, now seen corresponding path program 151 times [2020-02-10 19:46:12,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:12,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9489922] [2020-02-10 19:46:12,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:12,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:13,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 19:46:13,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9489922] [2020-02-10 19:46:13,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:13,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:46:13,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237187730] [2020-02-10 19:46:13,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:46:13,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:13,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:46:13,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:13,220 INFO L87 Difference]: Start difference. First operand 1566 states and 7047 transitions. Second operand 11 states. [2020-02-10 19:46:13,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:13,403 INFO L93 Difference]: Finished difference Result 2933 states and 11703 transitions. [2020-02-10 19:46:13,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:46:13,403 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:46:13,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:13,410 INFO L225 Difference]: With dead ends: 2933 [2020-02-10 19:46:13,410 INFO L226 Difference]: Without dead ends: 2918 [2020-02-10 19:46:13,410 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:46:13,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2918 states. [2020-02-10 19:46:13,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2918 to 1575. [2020-02-10 19:46:13,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 19:46:13,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7071 transitions. [2020-02-10 19:46:13,483 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7071 transitions. Word has length 28 [2020-02-10 19:46:13,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:13,483 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7071 transitions. [2020-02-10 19:46:13,483 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:46:13,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7071 transitions. [2020-02-10 19:46:13,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:46:13,485 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:13,485 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:13,485 INFO L427 AbstractCegarLoop]: === Iteration 160 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:13,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:13,485 INFO L82 PathProgramCache]: Analyzing trace with hash -861365618, now seen corresponding path program 152 times [2020-02-10 19:46:13,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:13,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089150352] [2020-02-10 19:46:13,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:13,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:14,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:14,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089150352] [2020-02-10 19:46:14,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:14,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:46:14,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847637962] [2020-02-10 19:46:14,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:46:14,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:14,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:46:14,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:14,014 INFO L87 Difference]: Start difference. First operand 1575 states and 7071 transitions. Second operand 11 states. [2020-02-10 19:46:14,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:14,215 INFO L93 Difference]: Finished difference Result 2934 states and 11700 transitions. [2020-02-10 19:46:14,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:46:14,215 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:46:14,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:14,224 INFO L225 Difference]: With dead ends: 2934 [2020-02-10 19:46:14,224 INFO L226 Difference]: Without dead ends: 2913 [2020-02-10 19:46:14,225 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:46:14,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2913 states. [2020-02-10 19:46:14,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2913 to 1570. [2020-02-10 19:46:14,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 19:46:14,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7058 transitions. [2020-02-10 19:46:14,298 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7058 transitions. Word has length 28 [2020-02-10 19:46:14,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:14,298 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7058 transitions. [2020-02-10 19:46:14,298 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:46:14,298 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7058 transitions. [2020-02-10 19:46:14,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:46:14,301 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:14,301 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:14,301 INFO L427 AbstractCegarLoop]: === Iteration 161 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:14,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:14,301 INFO L82 PathProgramCache]: Analyzing trace with hash -2141297918, now seen corresponding path program 153 times [2020-02-10 19:46:14,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:14,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195425484] [2020-02-10 19:46:14,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:14,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:14,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 19:46:14,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195425484] [2020-02-10 19:46:14,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:14,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:46:14,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501472568] [2020-02-10 19:46:14,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:46:14,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:14,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:46:14,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:14,854 INFO L87 Difference]: Start difference. First operand 1570 states and 7058 transitions. Second operand 11 states. [2020-02-10 19:46:15,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:15,054 INFO L93 Difference]: Finished difference Result 2930 states and 11692 transitions. [2020-02-10 19:46:15,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:46:15,055 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:46:15,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:15,062 INFO L225 Difference]: With dead ends: 2930 [2020-02-10 19:46:15,062 INFO L226 Difference]: Without dead ends: 2915 [2020-02-10 19:46:15,062 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:46:15,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2915 states. [2020-02-10 19:46:15,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2915 to 1574. [2020-02-10 19:46:15,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 19:46:15,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7065 transitions. [2020-02-10 19:46:15,129 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7065 transitions. Word has length 28 [2020-02-10 19:46:15,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:15,129 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7065 transitions. [2020-02-10 19:46:15,130 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:46:15,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7065 transitions. [2020-02-10 19:46:15,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:46:15,132 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:15,132 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:15,132 INFO L427 AbstractCegarLoop]: === Iteration 162 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:15,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:15,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1968050226, now seen corresponding path program 154 times [2020-02-10 19:46:15,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:15,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394479385] [2020-02-10 19:46:15,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:15,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:15,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 19:46:15,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394479385] [2020-02-10 19:46:15,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:15,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:46:15,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179451340] [2020-02-10 19:46:15,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:46:15,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:15,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:46:15,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:15,689 INFO L87 Difference]: Start difference. First operand 1574 states and 7065 transitions. Second operand 11 states. [2020-02-10 19:46:15,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:15,873 INFO L93 Difference]: Finished difference Result 2929 states and 11686 transitions. [2020-02-10 19:46:15,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:46:15,873 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:46:15,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:15,881 INFO L225 Difference]: With dead ends: 2929 [2020-02-10 19:46:15,881 INFO L226 Difference]: Without dead ends: 2911 [2020-02-10 19:46:15,881 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:46:15,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2911 states. [2020-02-10 19:46:15,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2911 to 1570. [2020-02-10 19:46:15,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 19:46:15,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7054 transitions. [2020-02-10 19:46:15,948 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7054 transitions. Word has length 28 [2020-02-10 19:46:15,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:15,948 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7054 transitions. [2020-02-10 19:46:15,948 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:46:15,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7054 transitions. [2020-02-10 19:46:15,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:46:15,950 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:15,950 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:15,950 INFO L427 AbstractCegarLoop]: === Iteration 163 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:15,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:15,951 INFO L82 PathProgramCache]: Analyzing trace with hash 214345538, now seen corresponding path program 155 times [2020-02-10 19:46:15,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:15,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196959315] [2020-02-10 19:46:15,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:15,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:16,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:16,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196959315] [2020-02-10 19:46:16,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:16,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:46:16,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615125574] [2020-02-10 19:46:16,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:46:16,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:16,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:46:16,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:16,485 INFO L87 Difference]: Start difference. First operand 1570 states and 7054 transitions. Second operand 11 states. [2020-02-10 19:46:16,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:16,682 INFO L93 Difference]: Finished difference Result 2932 states and 11692 transitions. [2020-02-10 19:46:16,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:46:16,688 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:46:16,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:16,696 INFO L225 Difference]: With dead ends: 2932 [2020-02-10 19:46:16,696 INFO L226 Difference]: Without dead ends: 2916 [2020-02-10 19:46:16,696 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:46:16,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2916 states. [2020-02-10 19:46:16,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2916 to 1574. [2020-02-10 19:46:16,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 19:46:16,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7061 transitions. [2020-02-10 19:46:16,797 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7061 transitions. Word has length 28 [2020-02-10 19:46:16,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:16,798 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7061 transitions. [2020-02-10 19:46:16,798 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:46:16,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7061 transitions. [2020-02-10 19:46:16,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:46:16,803 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:16,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] [2020-02-10 19:46:16,804 INFO L427 AbstractCegarLoop]: === Iteration 164 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:16,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:16,804 INFO L82 PathProgramCache]: Analyzing trace with hash -357109268, now seen corresponding path program 156 times [2020-02-10 19:46:16,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:16,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312448449] [2020-02-10 19:46:16,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:16,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:17,387 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 30 [2020-02-10 19:46:17,548 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 19:46:17,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 19:46:17,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312448449] [2020-02-10 19:46:17,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:17,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:46:17,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530913048] [2020-02-10 19:46:17,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:46:17,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:17,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:46:17,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:17,562 INFO L87 Difference]: Start difference. First operand 1574 states and 7061 transitions. Second operand 11 states. [2020-02-10 19:46:17,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:17,747 INFO L93 Difference]: Finished difference Result 2930 states and 11684 transitions. [2020-02-10 19:46:17,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:46:17,748 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:46:17,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:17,755 INFO L225 Difference]: With dead ends: 2930 [2020-02-10 19:46:17,755 INFO L226 Difference]: Without dead ends: 2908 [2020-02-10 19:46:17,755 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:46:17,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2908 states. [2020-02-10 19:46:17,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2908 to 1566. [2020-02-10 19:46:17,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1566 states. [2020-02-10 19:46:17,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 7043 transitions. [2020-02-10 19:46:17,824 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 7043 transitions. Word has length 28 [2020-02-10 19:46:17,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:17,824 INFO L479 AbstractCegarLoop]: Abstraction has 1566 states and 7043 transitions. [2020-02-10 19:46:17,824 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:46:17,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 7043 transitions. [2020-02-10 19:46:17,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:46:17,826 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:17,826 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:17,826 INFO L427 AbstractCegarLoop]: === Iteration 165 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:17,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:17,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1595565012, now seen corresponding path program 157 times [2020-02-10 19:46:17,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:17,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621553678] [2020-02-10 19:46:17,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:17,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:18,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 19:46:18,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621553678] [2020-02-10 19:46:18,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:18,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:46:18,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699629900] [2020-02-10 19:46:18,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:46:18,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:18,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:46:18,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:18,349 INFO L87 Difference]: Start difference. First operand 1566 states and 7043 transitions. Second operand 11 states. [2020-02-10 19:46:18,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:18,522 INFO L93 Difference]: Finished difference Result 2945 states and 11722 transitions. [2020-02-10 19:46:18,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:46:18,522 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:46:18,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:18,530 INFO L225 Difference]: With dead ends: 2945 [2020-02-10 19:46:18,530 INFO L226 Difference]: Without dead ends: 2930 [2020-02-10 19:46:18,530 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:46:18,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2020-02-10 19:46:18,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 1577. [2020-02-10 19:46:18,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 19:46:18,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7072 transitions. [2020-02-10 19:46:18,603 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7072 transitions. Word has length 28 [2020-02-10 19:46:18,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:18,603 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7072 transitions. [2020-02-10 19:46:18,604 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:46:18,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7072 transitions. [2020-02-10 19:46:18,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:46:18,606 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:18,606 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:18,606 INFO L427 AbstractCegarLoop]: === Iteration 166 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:18,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:18,606 INFO L82 PathProgramCache]: Analyzing trace with hash -106160016, now seen corresponding path program 158 times [2020-02-10 19:46:18,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:18,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45049034] [2020-02-10 19:46:18,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:18,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:19,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:19,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45049034] [2020-02-10 19:46:19,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:19,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:46:19,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298330241] [2020-02-10 19:46:19,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:46:19,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:19,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:46:19,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:19,140 INFO L87 Difference]: Start difference. First operand 1577 states and 7072 transitions. Second operand 11 states. [2020-02-10 19:46:19,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:19,282 INFO L93 Difference]: Finished difference Result 2950 states and 11726 transitions. [2020-02-10 19:46:19,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:46:19,282 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:46:19,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:19,290 INFO L225 Difference]: With dead ends: 2950 [2020-02-10 19:46:19,290 INFO L226 Difference]: Without dead ends: 2924 [2020-02-10 19:46:19,290 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:46:19,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2924 states. [2020-02-10 19:46:19,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2924 to 1571. [2020-02-10 19:46:19,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 19:46:19,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7056 transitions. [2020-02-10 19:46:19,359 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7056 transitions. Word has length 28 [2020-02-10 19:46:19,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:19,359 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7056 transitions. [2020-02-10 19:46:19,359 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:46:19,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7056 transitions. [2020-02-10 19:46:19,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:46:19,361 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:19,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] [2020-02-10 19:46:19,362 INFO L427 AbstractCegarLoop]: === Iteration 167 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:19,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:19,362 INFO L82 PathProgramCache]: Analyzing trace with hash 553231524, now seen corresponding path program 159 times [2020-02-10 19:46:19,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:19,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087871212] [2020-02-10 19:46:19,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:19,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:19,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:19,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087871212] [2020-02-10 19:46:19,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:19,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:46:19,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615659642] [2020-02-10 19:46:19,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:46:19,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:19,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:46:19,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:19,888 INFO L87 Difference]: Start difference. First operand 1571 states and 7056 transitions. Second operand 11 states. [2020-02-10 19:46:20,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:20,114 INFO L93 Difference]: Finished difference Result 2937 states and 11701 transitions. [2020-02-10 19:46:20,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:46:20,114 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:46:20,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:20,121 INFO L225 Difference]: With dead ends: 2937 [2020-02-10 19:46:20,121 INFO L226 Difference]: Without dead ends: 2922 [2020-02-10 19:46:20,121 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:46:20,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2922 states. [2020-02-10 19:46:20,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2922 to 1575. [2020-02-10 19:46:20,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 19:46:20,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7063 transitions. [2020-02-10 19:46:20,189 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7063 transitions. Word has length 28 [2020-02-10 19:46:20,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:20,189 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7063 transitions. [2020-02-10 19:46:20,189 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:46:20,189 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7063 transitions. [2020-02-10 19:46:20,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:46:20,191 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:20,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] [2020-02-10 19:46:20,191 INFO L427 AbstractCegarLoop]: === Iteration 168 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:20,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:20,192 INFO L82 PathProgramCache]: Analyzing trace with hash 726479216, now seen corresponding path program 160 times [2020-02-10 19:46:20,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:20,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441460673] [2020-02-10 19:46:20,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:20,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:20,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:20,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441460673] [2020-02-10 19:46:20,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:20,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:46:20,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812878260] [2020-02-10 19:46:20,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:46:20,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:20,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:46:20,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:20,744 INFO L87 Difference]: Start difference. First operand 1575 states and 7063 transitions. Second operand 11 states. [2020-02-10 19:46:20,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:20,927 INFO L93 Difference]: Finished difference Result 2936 states and 11695 transitions. [2020-02-10 19:46:20,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:46:20,928 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:46:20,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:20,935 INFO L225 Difference]: With dead ends: 2936 [2020-02-10 19:46:20,936 INFO L226 Difference]: Without dead ends: 2918 [2020-02-10 19:46:20,936 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:46:20,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2918 states. [2020-02-10 19:46:20,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2918 to 1571. [2020-02-10 19:46:20,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 19:46:21,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7052 transitions. [2020-02-10 19:46:21,003 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7052 transitions. Word has length 28 [2020-02-10 19:46:21,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:21,003 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7052 transitions. [2020-02-10 19:46:21,003 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:46:21,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7052 transitions. [2020-02-10 19:46:21,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:46:21,006 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:21,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] [2020-02-10 19:46:21,006 INFO L427 AbstractCegarLoop]: === Iteration 169 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:21,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:21,006 INFO L82 PathProgramCache]: Analyzing trace with hash 969551140, now seen corresponding path program 161 times [2020-02-10 19:46:21,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:21,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944102143] [2020-02-10 19:46:21,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:21,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:21,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:21,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944102143] [2020-02-10 19:46:21,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:21,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:46:21,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965331092] [2020-02-10 19:46:21,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:46:21,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:21,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:46:21,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:21,525 INFO L87 Difference]: Start difference. First operand 1571 states and 7052 transitions. Second operand 11 states. [2020-02-10 19:46:21,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:21,686 INFO L93 Difference]: Finished difference Result 2948 states and 11717 transitions. [2020-02-10 19:46:21,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:46:21,687 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:46:21,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:21,694 INFO L225 Difference]: With dead ends: 2948 [2020-02-10 19:46:21,694 INFO L226 Difference]: Without dead ends: 2928 [2020-02-10 19:46:21,694 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:46:21,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2928 states. [2020-02-10 19:46:21,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2928 to 1576. [2020-02-10 19:46:21,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 19:46:21,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7060 transitions. [2020-02-10 19:46:21,762 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7060 transitions. Word has length 28 [2020-02-10 19:46:21,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:21,762 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7060 transitions. [2020-02-10 19:46:21,762 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:46:21,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7060 transitions. [2020-02-10 19:46:21,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:46:21,765 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:21,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] [2020-02-10 19:46:21,765 INFO L427 AbstractCegarLoop]: === Iteration 170 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:21,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:21,765 INFO L82 PathProgramCache]: Analyzing trace with hash -346606164, now seen corresponding path program 162 times [2020-02-10 19:46:21,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:21,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821634015] [2020-02-10 19:46:21,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:21,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:22,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 19:46:22,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821634015] [2020-02-10 19:46:22,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:22,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:46:22,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528009589] [2020-02-10 19:46:22,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:46:22,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:22,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:46:22,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:22,303 INFO L87 Difference]: Start difference. First operand 1576 states and 7060 transitions. Second operand 11 states. [2020-02-10 19:46:22,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:22,535 INFO L93 Difference]: Finished difference Result 2942 states and 11701 transitions. [2020-02-10 19:46:22,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:46:22,536 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:46:22,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:22,543 INFO L225 Difference]: With dead ends: 2942 [2020-02-10 19:46:22,544 INFO L226 Difference]: Without dead ends: 2918 [2020-02-10 19:46:22,544 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:46:22,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2918 states. [2020-02-10 19:46:22,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2918 to 1566. [2020-02-10 19:46:22,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1566 states. [2020-02-10 19:46:22,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 7038 transitions. [2020-02-10 19:46:22,612 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 7038 transitions. Word has length 28 [2020-02-10 19:46:22,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:22,612 INFO L479 AbstractCegarLoop]: Abstraction has 1566 states and 7038 transitions. [2020-02-10 19:46:22,612 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:46:22,612 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 7038 transitions. [2020-02-10 19:46:22,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:46:22,615 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:22,615 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:22,615 INFO L427 AbstractCegarLoop]: === Iteration 171 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:22,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:22,615 INFO L82 PathProgramCache]: Analyzing trace with hash -840359410, now seen corresponding path program 163 times [2020-02-10 19:46:22,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:22,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332641666] [2020-02-10 19:46:22,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:22,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:23,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:23,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332641666] [2020-02-10 19:46:23,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:23,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:46:23,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640864648] [2020-02-10 19:46:23,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:46:23,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:23,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:46:23,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:23,153 INFO L87 Difference]: Start difference. First operand 1566 states and 7038 transitions. Second operand 11 states. [2020-02-10 19:46:23,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:23,336 INFO L93 Difference]: Finished difference Result 2950 states and 11729 transitions. [2020-02-10 19:46:23,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:46:23,337 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:46:23,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:23,344 INFO L225 Difference]: With dead ends: 2950 [2020-02-10 19:46:23,344 INFO L226 Difference]: Without dead ends: 2934 [2020-02-10 19:46:23,345 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:46:23,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2934 states. [2020-02-10 19:46:23,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2934 to 1578. [2020-02-10 19:46:23,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 19:46:23,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7069 transitions. [2020-02-10 19:46:23,431 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7069 transitions. Word has length 28 [2020-02-10 19:46:23,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:23,431 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7069 transitions. [2020-02-10 19:46:23,431 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:46:23,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7069 transitions. [2020-02-10 19:46:23,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:46:23,434 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:23,434 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:23,434 INFO L427 AbstractCegarLoop]: === Iteration 172 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:23,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:23,434 INFO L82 PathProgramCache]: Analyzing trace with hash -95656912, now seen corresponding path program 164 times [2020-02-10 19:46:23,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:23,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855655759] [2020-02-10 19:46:23,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:23,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:23,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:23,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855655759] [2020-02-10 19:46:23,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:23,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:46:23,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401085942] [2020-02-10 19:46:23,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:46:23,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:23,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:46:23,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:23,981 INFO L87 Difference]: Start difference. First operand 1578 states and 7069 transitions. Second operand 11 states. [2020-02-10 19:46:24,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:24,170 INFO L93 Difference]: Finished difference Result 2954 states and 11730 transitions. [2020-02-10 19:46:24,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:46:24,171 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:46:24,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:24,178 INFO L225 Difference]: With dead ends: 2954 [2020-02-10 19:46:24,178 INFO L226 Difference]: Without dead ends: 2927 [2020-02-10 19:46:24,179 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:46:24,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2927 states. [2020-02-10 19:46:24,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2927 to 1571. [2020-02-10 19:46:24,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 19:46:24,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7051 transitions. [2020-02-10 19:46:24,246 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7051 transitions. Word has length 28 [2020-02-10 19:46:24,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:24,246 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7051 transitions. [2020-02-10 19:46:24,246 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:46:24,246 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7051 transitions. [2020-02-10 19:46:24,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:46:24,248 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:24,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] [2020-02-10 19:46:24,248 INFO L427 AbstractCegarLoop]: === Iteration 173 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:24,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:24,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1308437126, now seen corresponding path program 165 times [2020-02-10 19:46:24,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:24,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434244835] [2020-02-10 19:46:24,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:24,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:24,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:24,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434244835] [2020-02-10 19:46:24,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:24,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:46:24,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374337529] [2020-02-10 19:46:24,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:46:24,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:24,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:46:24,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:24,761 INFO L87 Difference]: Start difference. First operand 1571 states and 7051 transitions. Second operand 11 states. [2020-02-10 19:46:24,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:24,949 INFO L93 Difference]: Finished difference Result 2941 states and 11705 transitions. [2020-02-10 19:46:24,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:46:24,950 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:46:24,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:24,957 INFO L225 Difference]: With dead ends: 2941 [2020-02-10 19:46:24,957 INFO L226 Difference]: Without dead ends: 2925 [2020-02-10 19:46:24,957 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:46:25,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2925 states. [2020-02-10 19:46:25,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2925 to 1575. [2020-02-10 19:46:25,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 19:46:25,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7058 transitions. [2020-02-10 19:46:25,025 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7058 transitions. Word has length 28 [2020-02-10 19:46:25,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:25,025 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7058 transitions. [2020-02-10 19:46:25,025 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:46:25,025 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7058 transitions. [2020-02-10 19:46:25,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:46:25,027 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:25,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] [2020-02-10 19:46:25,027 INFO L427 AbstractCegarLoop]: === Iteration 174 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:25,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:25,028 INFO L82 PathProgramCache]: Analyzing trace with hash 736982320, now seen corresponding path program 166 times [2020-02-10 19:46:25,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:25,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718667266] [2020-02-10 19:46:25,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:25,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:25,568 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 19:46:25,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:25,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718667266] [2020-02-10 19:46:25,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:25,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:46:25,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138592668] [2020-02-10 19:46:25,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:46:25,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:25,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:46:25,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:25,576 INFO L87 Difference]: Start difference. First operand 1575 states and 7058 transitions. Second operand 11 states. [2020-02-10 19:46:25,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:25,783 INFO L93 Difference]: Finished difference Result 2939 states and 11697 transitions. [2020-02-10 19:46:25,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:46:25,783 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:46:25,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:25,790 INFO L225 Difference]: With dead ends: 2939 [2020-02-10 19:46:25,791 INFO L226 Difference]: Without dead ends: 2921 [2020-02-10 19:46:25,791 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:46:25,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2921 states. [2020-02-10 19:46:25,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2921 to 1571. [2020-02-10 19:46:25,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 19:46:25,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7047 transitions. [2020-02-10 19:46:25,858 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7047 transitions. Word has length 28 [2020-02-10 19:46:25,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:25,858 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7047 transitions. [2020-02-10 19:46:25,858 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:46:25,859 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7047 transitions. [2020-02-10 19:46:25,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:46:25,861 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:25,861 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:25,861 INFO L427 AbstractCegarLoop]: === Iteration 175 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:25,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:25,861 INFO L82 PathProgramCache]: Analyzing trace with hash -630886714, now seen corresponding path program 167 times [2020-02-10 19:46:25,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:25,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54969233] [2020-02-10 19:46:25,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:25,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:26,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:26,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54969233] [2020-02-10 19:46:26,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:26,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:46:26,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247853296] [2020-02-10 19:46:26,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:46:26,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:26,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:46:26,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:26,387 INFO L87 Difference]: Start difference. First operand 1571 states and 7047 transitions. Second operand 11 states. [2020-02-10 19:46:26,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:26,618 INFO L93 Difference]: Finished difference Result 2950 states and 11717 transitions. [2020-02-10 19:46:26,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:46:26,618 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:46:26,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:26,625 INFO L225 Difference]: With dead ends: 2950 [2020-02-10 19:46:26,625 INFO L226 Difference]: Without dead ends: 2930 [2020-02-10 19:46:26,625 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:46:26,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2020-02-10 19:46:26,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 1576. [2020-02-10 19:46:26,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 19:46:26,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7055 transitions. [2020-02-10 19:46:26,692 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7055 transitions. Word has length 28 [2020-02-10 19:46:26,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:26,692 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7055 transitions. [2020-02-10 19:46:26,692 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:46:26,692 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7055 transitions. [2020-02-10 19:46:26,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:46:26,695 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:26,695 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:26,695 INFO L427 AbstractCegarLoop]: === Iteration 176 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:26,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:26,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1947044018, now seen corresponding path program 168 times [2020-02-10 19:46:26,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:26,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979270161] [2020-02-10 19:46:26,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:26,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:27,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 19:46:27,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979270161] [2020-02-10 19:46:27,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:27,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:46:27,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181517396] [2020-02-10 19:46:27,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:46:27,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:27,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:46:27,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:27,244 INFO L87 Difference]: Start difference. First operand 1576 states and 7055 transitions. Second operand 11 states. [2020-02-10 19:46:27,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:27,443 INFO L93 Difference]: Finished difference Result 2944 states and 11701 transitions. [2020-02-10 19:46:27,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:46:27,444 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:46:27,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:27,451 INFO L225 Difference]: With dead ends: 2944 [2020-02-10 19:46:27,451 INFO L226 Difference]: Without dead ends: 2915 [2020-02-10 19:46:27,451 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:46:27,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2915 states. [2020-02-10 19:46:27,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2915 to 1561. [2020-02-10 19:46:27,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1561 states. [2020-02-10 19:46:27,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 7024 transitions. [2020-02-10 19:46:27,518 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 7024 transitions. Word has length 28 [2020-02-10 19:46:27,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:27,518 INFO L479 AbstractCegarLoop]: Abstraction has 1561 states and 7024 transitions. [2020-02-10 19:46:27,518 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:46:27,519 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 7024 transitions. [2020-02-10 19:46:27,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:46:27,521 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:27,521 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:27,521 INFO L427 AbstractCegarLoop]: === Iteration 177 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:27,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:27,521 INFO L82 PathProgramCache]: Analyzing trace with hash -254171636, now seen corresponding path program 169 times [2020-02-10 19:46:27,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:27,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722888439] [2020-02-10 19:46:27,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:27,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:28,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 19:46:28,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722888439] [2020-02-10 19:46:28,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:28,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:46:28,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355127228] [2020-02-10 19:46:28,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:46:28,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:28,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:46:28,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:28,046 INFO L87 Difference]: Start difference. First operand 1561 states and 7024 transitions. Second operand 11 states. [2020-02-10 19:46:28,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:28,263 INFO L93 Difference]: Finished difference Result 2932 states and 11702 transitions. [2020-02-10 19:46:28,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:46:28,263 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:46:28,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:28,271 INFO L225 Difference]: With dead ends: 2932 [2020-02-10 19:46:28,271 INFO L226 Difference]: Without dead ends: 2917 [2020-02-10 19:46:28,272 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:46:28,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2917 states. [2020-02-10 19:46:28,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2917 to 1575. [2020-02-10 19:46:28,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 19:46:28,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7071 transitions. [2020-02-10 19:46:28,339 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7071 transitions. Word has length 28 [2020-02-10 19:46:28,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:28,339 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7071 transitions. [2020-02-10 19:46:28,339 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:46:28,339 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7071 transitions. [2020-02-10 19:46:28,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:46:28,341 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:28,341 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:28,342 INFO L427 AbstractCegarLoop]: === Iteration 178 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:28,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:28,342 INFO L82 PathProgramCache]: Analyzing trace with hash 490530862, now seen corresponding path program 170 times [2020-02-10 19:46:28,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:28,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295515827] [2020-02-10 19:46:28,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:28,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:28,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:28,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295515827] [2020-02-10 19:46:28,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:28,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:46:28,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221184393] [2020-02-10 19:46:28,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:46:28,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:28,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:46:28,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:28,882 INFO L87 Difference]: Start difference. First operand 1575 states and 7071 transitions. Second operand 11 states. [2020-02-10 19:46:29,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:29,121 INFO L93 Difference]: Finished difference Result 2933 states and 11699 transitions. [2020-02-10 19:46:29,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:46:29,123 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:46:29,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:29,128 INFO L225 Difference]: With dead ends: 2933 [2020-02-10 19:46:29,128 INFO L226 Difference]: Without dead ends: 2912 [2020-02-10 19:46:29,128 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:46:29,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2912 states. [2020-02-10 19:46:29,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2912 to 1570. [2020-02-10 19:46:29,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 19:46:29,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7057 transitions. [2020-02-10 19:46:29,196 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7057 transitions. Word has length 28 [2020-02-10 19:46:29,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:29,196 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7057 transitions. [2020-02-10 19:46:29,196 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:46:29,196 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7057 transitions. [2020-02-10 19:46:29,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:46:29,198 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:29,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] [2020-02-10 19:46:29,198 INFO L427 AbstractCegarLoop]: === Iteration 179 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:29,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:29,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1327257016, now seen corresponding path program 171 times [2020-02-10 19:46:29,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:29,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577500179] [2020-02-10 19:46:29,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:29,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:29,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 19:46:29,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577500179] [2020-02-10 19:46:29,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:29,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:46:29,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319650221] [2020-02-10 19:46:29,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:46:29,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:29,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:46:29,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:29,715 INFO L87 Difference]: Start difference. First operand 1570 states and 7057 transitions. Second operand 11 states. [2020-02-10 19:46:29,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:29,907 INFO L93 Difference]: Finished difference Result 2934 states and 11701 transitions. [2020-02-10 19:46:29,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:46:29,908 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:46:29,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:29,915 INFO L225 Difference]: With dead ends: 2934 [2020-02-10 19:46:29,915 INFO L226 Difference]: Without dead ends: 2919 [2020-02-10 19:46:29,916 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:46:29,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2919 states. [2020-02-10 19:46:29,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2919 to 1575. [2020-02-10 19:46:29,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 19:46:29,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7066 transitions. [2020-02-10 19:46:29,983 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7066 transitions. Word has length 28 [2020-02-10 19:46:29,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:29,983 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7066 transitions. [2020-02-10 19:46:29,983 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:46:29,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7066 transitions. [2020-02-10 19:46:29,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:46:29,985 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:29,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] [2020-02-10 19:46:29,986 INFO L427 AbstractCegarLoop]: === Iteration 180 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:29,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:29,986 INFO L82 PathProgramCache]: Analyzing trace with hash 906850478, now seen corresponding path program 172 times [2020-02-10 19:46:29,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:29,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513522721] [2020-02-10 19:46:29,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:29,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:30,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 19:46:30,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513522721] [2020-02-10 19:46:30,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:30,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:46:30,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948721538] [2020-02-10 19:46:30,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:46:30,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:30,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:46:30,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:30,539 INFO L87 Difference]: Start difference. First operand 1575 states and 7066 transitions. Second operand 11 states. [2020-02-10 19:46:30,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:30,763 INFO L93 Difference]: Finished difference Result 2937 states and 11702 transitions. [2020-02-10 19:46:30,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:46:30,764 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:46:30,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:30,771 INFO L225 Difference]: With dead ends: 2937 [2020-02-10 19:46:30,771 INFO L226 Difference]: Without dead ends: 2914 [2020-02-10 19:46:30,771 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:46:30,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2914 states. [2020-02-10 19:46:30,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2914 to 1570. [2020-02-10 19:46:30,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 19:46:30,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7052 transitions. [2020-02-10 19:46:30,839 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7052 transitions. Word has length 28 [2020-02-10 19:46:30,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:30,839 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7052 transitions. [2020-02-10 19:46:30,839 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:46:30,839 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7052 transitions. [2020-02-10 19:46:30,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:46:30,841 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:30,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] [2020-02-10 19:46:30,841 INFO L427 AbstractCegarLoop]: === Iteration 181 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:30,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:30,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1028386440, now seen corresponding path program 173 times [2020-02-10 19:46:30,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:30,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462167476] [2020-02-10 19:46:30,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:30,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:31,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:31,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462167476] [2020-02-10 19:46:31,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:31,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:46:31,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840064160] [2020-02-10 19:46:31,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:46:31,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:31,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:46:31,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:31,359 INFO L87 Difference]: Start difference. First operand 1570 states and 7052 transitions. Second operand 11 states. [2020-02-10 19:46:31,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:31,574 INFO L93 Difference]: Finished difference Result 2937 states and 11703 transitions. [2020-02-10 19:46:31,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:46:31,575 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:46:31,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:31,582 INFO L225 Difference]: With dead ends: 2937 [2020-02-10 19:46:31,582 INFO L226 Difference]: Without dead ends: 2921 [2020-02-10 19:46:31,582 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:46:31,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2921 states. [2020-02-10 19:46:31,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2921 to 1576. [2020-02-10 19:46:31,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 19:46:31,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7063 transitions. [2020-02-10 19:46:31,649 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7063 transitions. Word has length 28 [2020-02-10 19:46:31,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:31,650 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7063 transitions. [2020-02-10 19:46:31,650 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:46:31,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7063 transitions. [2020-02-10 19:46:31,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:46:31,652 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:31,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] [2020-02-10 19:46:31,652 INFO L427 AbstractCegarLoop]: === Iteration 182 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:31,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:31,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1777175860, now seen corresponding path program 174 times [2020-02-10 19:46:31,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:31,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235352913] [2020-02-10 19:46:31,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:31,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:32,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 19:46:32,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235352913] [2020-02-10 19:46:32,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:32,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:46:32,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887750694] [2020-02-10 19:46:32,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:46:32,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:32,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:46:32,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:32,178 INFO L87 Difference]: Start difference. First operand 1576 states and 7063 transitions. Second operand 11 states. [2020-02-10 19:46:32,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:32,357 INFO L93 Difference]: Finished difference Result 2939 states and 11701 transitions. [2020-02-10 19:46:32,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:46:32,358 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:46:32,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:32,365 INFO L225 Difference]: With dead ends: 2939 [2020-02-10 19:46:32,365 INFO L226 Difference]: Without dead ends: 2910 [2020-02-10 19:46:32,366 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:46:32,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2910 states. [2020-02-10 19:46:32,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2910 to 1565. [2020-02-10 19:46:32,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1565 states. [2020-02-10 19:46:32,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 7039 transitions. [2020-02-10 19:46:32,433 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 7039 transitions. Word has length 28 [2020-02-10 19:46:32,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:32,433 INFO L479 AbstractCegarLoop]: Abstraction has 1565 states and 7039 transitions. [2020-02-10 19:46:32,433 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:46:32,433 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 7039 transitions. [2020-02-10 19:46:32,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:46:32,435 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:32,435 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:32,435 INFO L427 AbstractCegarLoop]: === Iteration 183 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:32,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:32,436 INFO L82 PathProgramCache]: Analyzing trace with hash -760517902, now seen corresponding path program 175 times [2020-02-10 19:46:32,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:32,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748375647] [2020-02-10 19:46:32,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:32,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:32,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:32,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748375647] [2020-02-10 19:46:32,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:32,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:46:32,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660610526] [2020-02-10 19:46:32,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:46:32,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:32,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:46:32,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:32,969 INFO L87 Difference]: Start difference. First operand 1565 states and 7039 transitions. Second operand 11 states. [2020-02-10 19:46:33,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:33,159 INFO L93 Difference]: Finished difference Result 2924 states and 11677 transitions. [2020-02-10 19:46:33,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:46:33,159 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:46:33,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:33,167 INFO L225 Difference]: With dead ends: 2924 [2020-02-10 19:46:33,167 INFO L226 Difference]: Without dead ends: 2909 [2020-02-10 19:46:33,167 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:46:33,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2909 states. [2020-02-10 19:46:33,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2909 to 1574. [2020-02-10 19:46:33,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 19:46:33,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7063 transitions. [2020-02-10 19:46:33,234 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7063 transitions. Word has length 28 [2020-02-10 19:46:33,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:33,235 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7063 transitions. [2020-02-10 19:46:33,235 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:46:33,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7063 transitions. [2020-02-10 19:46:33,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:46:33,237 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:33,237 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:33,237 INFO L427 AbstractCegarLoop]: === Iteration 184 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:33,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:33,237 INFO L82 PathProgramCache]: Analyzing trace with hash -15815404, now seen corresponding path program 176 times [2020-02-10 19:46:33,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:33,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528701651] [2020-02-10 19:46:33,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:33,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:33,767 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 19:46:33,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:33,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528701651] [2020-02-10 19:46:33,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:33,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:46:33,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853644918] [2020-02-10 19:46:33,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:46:33,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:33,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:46:33,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:33,776 INFO L87 Difference]: Start difference. First operand 1574 states and 7063 transitions. Second operand 11 states. [2020-02-10 19:46:33,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:33,969 INFO L93 Difference]: Finished difference Result 2925 states and 11674 transitions. [2020-02-10 19:46:33,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:46:33,970 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:46:33,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:33,977 INFO L225 Difference]: With dead ends: 2925 [2020-02-10 19:46:33,977 INFO L226 Difference]: Without dead ends: 2904 [2020-02-10 19:46:33,977 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:46:34,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2904 states. [2020-02-10 19:46:34,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2904 to 1569. [2020-02-10 19:46:34,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 19:46:34,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7050 transitions. [2020-02-10 19:46:34,044 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7050 transitions. Word has length 28 [2020-02-10 19:46:34,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:34,044 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7050 transitions. [2020-02-10 19:46:34,045 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:46:34,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7050 transitions. [2020-02-10 19:46:34,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:46:34,047 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:34,047 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:34,047 INFO L427 AbstractCegarLoop]: === Iteration 185 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:34,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:34,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1295747704, now seen corresponding path program 177 times [2020-02-10 19:46:34,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:34,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562200368] [2020-02-10 19:46:34,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:34,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:34,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 19:46:34,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562200368] [2020-02-10 19:46:34,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:34,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:46:34,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452632816] [2020-02-10 19:46:34,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:46:34,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:34,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:46:34,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:34,584 INFO L87 Difference]: Start difference. First operand 1569 states and 7050 transitions. Second operand 11 states. [2020-02-10 19:46:34,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:34,773 INFO L93 Difference]: Finished difference Result 2921 states and 11666 transitions. [2020-02-10 19:46:34,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:46:34,774 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:46:34,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:34,781 INFO L225 Difference]: With dead ends: 2921 [2020-02-10 19:46:34,782 INFO L226 Difference]: Without dead ends: 2906 [2020-02-10 19:46:34,782 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:46:34,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2906 states. [2020-02-10 19:46:34,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2906 to 1573. [2020-02-10 19:46:34,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 19:46:34,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7057 transitions. [2020-02-10 19:46:34,848 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7057 transitions. Word has length 28 [2020-02-10 19:46:34,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:34,849 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7057 transitions. [2020-02-10 19:46:34,849 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:46:34,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7057 transitions. [2020-02-10 19:46:34,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:46:34,851 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:34,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] [2020-02-10 19:46:34,851 INFO L427 AbstractCegarLoop]: === Iteration 186 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:34,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:34,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1122500012, now seen corresponding path program 178 times [2020-02-10 19:46:34,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:34,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422688672] [2020-02-10 19:46:34,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:34,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:35,415 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 19:46:35,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 19:46:35,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422688672] [2020-02-10 19:46:35,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:35,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:46:35,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862194921] [2020-02-10 19:46:35,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:46:35,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:35,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:46:35,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:35,423 INFO L87 Difference]: Start difference. First operand 1573 states and 7057 transitions. Second operand 11 states. [2020-02-10 19:46:35,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:35,613 INFO L93 Difference]: Finished difference Result 2920 states and 11660 transitions. [2020-02-10 19:46:35,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:46:35,613 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:46:35,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:35,620 INFO L225 Difference]: With dead ends: 2920 [2020-02-10 19:46:35,620 INFO L226 Difference]: Without dead ends: 2902 [2020-02-10 19:46:35,620 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:46:35,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2902 states. [2020-02-10 19:46:35,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2902 to 1569. [2020-02-10 19:46:35,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 19:46:35,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7046 transitions. [2020-02-10 19:46:35,687 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7046 transitions. Word has length 28 [2020-02-10 19:46:35,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:35,688 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7046 transitions. [2020-02-10 19:46:35,688 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:46:35,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7046 transitions. [2020-02-10 19:46:35,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:46:35,690 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:35,690 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:35,690 INFO L427 AbstractCegarLoop]: === Iteration 187 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:35,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:35,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1059895752, now seen corresponding path program 179 times [2020-02-10 19:46:35,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:35,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559073239] [2020-02-10 19:46:35,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:35,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:36,212 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 19:46:36,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 19:46:36,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559073239] [2020-02-10 19:46:36,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:36,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:46:36,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135143429] [2020-02-10 19:46:36,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:46:36,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:36,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:46:36,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:36,220 INFO L87 Difference]: Start difference. First operand 1569 states and 7046 transitions. Second operand 11 states. [2020-02-10 19:46:36,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:36,434 INFO L93 Difference]: Finished difference Result 2923 states and 11666 transitions. [2020-02-10 19:46:36,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:46:36,434 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:46:36,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:36,442 INFO L225 Difference]: With dead ends: 2923 [2020-02-10 19:46:36,442 INFO L226 Difference]: Without dead ends: 2907 [2020-02-10 19:46:36,442 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:46:36,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2907 states. [2020-02-10 19:46:36,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2907 to 1573. [2020-02-10 19:46:36,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 19:46:36,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7053 transitions. [2020-02-10 19:46:36,509 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7053 transitions. Word has length 28 [2020-02-10 19:46:36,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:36,509 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7053 transitions. [2020-02-10 19:46:36,509 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:46:36,509 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7053 transitions. [2020-02-10 19:46:36,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:46:36,512 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:36,512 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:36,512 INFO L427 AbstractCegarLoop]: === Iteration 188 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:36,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:36,512 INFO L82 PathProgramCache]: Analyzing trace with hash 488440946, now seen corresponding path program 180 times [2020-02-10 19:46:36,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:36,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411562292] [2020-02-10 19:46:36,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:36,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:37,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:37,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411562292] [2020-02-10 19:46:37,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:37,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:46:37,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042383260] [2020-02-10 19:46:37,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:46:37,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:37,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:46:37,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:37,037 INFO L87 Difference]: Start difference. First operand 1573 states and 7053 transitions. Second operand 11 states. [2020-02-10 19:46:37,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:37,232 INFO L93 Difference]: Finished difference Result 2921 states and 11658 transitions. [2020-02-10 19:46:37,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:46:37,233 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:46:37,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:37,240 INFO L225 Difference]: With dead ends: 2921 [2020-02-10 19:46:37,240 INFO L226 Difference]: Without dead ends: 2899 [2020-02-10 19:46:37,241 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:46:37,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2899 states. [2020-02-10 19:46:37,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2899 to 1565. [2020-02-10 19:46:37,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1565 states. [2020-02-10 19:46:37,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 7035 transitions. [2020-02-10 19:46:37,309 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 7035 transitions. Word has length 28 [2020-02-10 19:46:37,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:37,310 INFO L479 AbstractCegarLoop]: Abstraction has 1565 states and 7035 transitions. [2020-02-10 19:46:37,310 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:46:37,310 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 7035 transitions. [2020-02-10 19:46:37,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:46:37,313 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:37,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] [2020-02-10 19:46:37,313 INFO L427 AbstractCegarLoop]: === Iteration 189 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:37,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:37,314 INFO L82 PathProgramCache]: Analyzing trace with hash -739511694, now seen corresponding path program 181 times [2020-02-10 19:46:37,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:37,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524740054] [2020-02-10 19:46:37,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:37,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:37,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 19:46:37,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524740054] [2020-02-10 19:46:37,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:37,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:46:37,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112853026] [2020-02-10 19:46:37,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:46:37,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:37,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:46:37,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:37,838 INFO L87 Difference]: Start difference. First operand 1565 states and 7035 transitions. Second operand 11 states. [2020-02-10 19:46:38,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:38,024 INFO L93 Difference]: Finished difference Result 2928 states and 11681 transitions. [2020-02-10 19:46:38,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:46:38,024 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:46:38,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:38,033 INFO L225 Difference]: With dead ends: 2928 [2020-02-10 19:46:38,033 INFO L226 Difference]: Without dead ends: 2913 [2020-02-10 19:46:38,033 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:46:38,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2913 states. [2020-02-10 19:46:38,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2913 to 1574. [2020-02-10 19:46:38,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 19:46:38,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7059 transitions. [2020-02-10 19:46:38,106 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7059 transitions. Word has length 28 [2020-02-10 19:46:38,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:38,106 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7059 transitions. [2020-02-10 19:46:38,106 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:46:38,106 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7059 transitions. [2020-02-10 19:46:38,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:46:38,109 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:38,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] [2020-02-10 19:46:38,109 INFO L427 AbstractCegarLoop]: === Iteration 190 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:38,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:38,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1494595800, now seen corresponding path program 182 times [2020-02-10 19:46:38,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:38,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34093842] [2020-02-10 19:46:38,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:38,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:38,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:38,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34093842] [2020-02-10 19:46:38,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:38,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:46:38,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569359912] [2020-02-10 19:46:38,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:46:38,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:38,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:46:38,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:38,632 INFO L87 Difference]: Start difference. First operand 1574 states and 7059 transitions. Second operand 11 states. [2020-02-10 19:46:38,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:38,846 INFO L93 Difference]: Finished difference Result 2931 states and 11682 transitions. [2020-02-10 19:46:38,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:46:38,847 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:46:38,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:38,854 INFO L225 Difference]: With dead ends: 2931 [2020-02-10 19:46:38,854 INFO L226 Difference]: Without dead ends: 2908 [2020-02-10 19:46:38,855 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:46:38,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2908 states. [2020-02-10 19:46:38,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2908 to 1569. [2020-02-10 19:46:38,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 19:46:38,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7046 transitions. [2020-02-10 19:46:38,921 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7046 transitions. Word has length 28 [2020-02-10 19:46:38,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:38,922 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7046 transitions. [2020-02-10 19:46:38,922 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:46:38,922 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7046 transitions. [2020-02-10 19:46:38,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:46:38,924 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:38,924 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:38,924 INFO L427 AbstractCegarLoop]: === Iteration 191 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:38,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:38,924 INFO L82 PathProgramCache]: Analyzing trace with hash -201656116, now seen corresponding path program 183 times [2020-02-10 19:46:38,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:38,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323355085] [2020-02-10 19:46:38,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:38,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:39,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:39,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323355085] [2020-02-10 19:46:39,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:39,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:46:39,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534686085] [2020-02-10 19:46:39,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:46:39,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:39,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:46:39,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:39,464 INFO L87 Difference]: Start difference. First operand 1569 states and 7046 transitions. Second operand 11 states. [2020-02-10 19:46:39,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:39,658 INFO L93 Difference]: Finished difference Result 2923 states and 11666 transitions. [2020-02-10 19:46:39,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:46:39,658 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:46:39,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:39,666 INFO L225 Difference]: With dead ends: 2923 [2020-02-10 19:46:39,666 INFO L226 Difference]: Without dead ends: 2908 [2020-02-10 19:46:39,666 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:46:39,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2908 states. [2020-02-10 19:46:39,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2908 to 1573. [2020-02-10 19:46:39,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 19:46:39,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7053 transitions. [2020-02-10 19:46:39,733 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7053 transitions. Word has length 28 [2020-02-10 19:46:39,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:39,733 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7053 transitions. [2020-02-10 19:46:39,734 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:46:39,734 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7053 transitions. [2020-02-10 19:46:39,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:46:39,736 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:39,736 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:39,736 INFO L427 AbstractCegarLoop]: === Iteration 192 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:39,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:39,736 INFO L82 PathProgramCache]: Analyzing trace with hash -28408424, now seen corresponding path program 184 times [2020-02-10 19:46:39,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:39,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338220602] [2020-02-10 19:46:39,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:39,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:40,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:40,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338220602] [2020-02-10 19:46:40,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:40,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:46:40,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409843974] [2020-02-10 19:46:40,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:46:40,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:40,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:46:40,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:40,306 INFO L87 Difference]: Start difference. First operand 1573 states and 7053 transitions. Second operand 11 states. [2020-02-10 19:46:40,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:40,517 INFO L93 Difference]: Finished difference Result 2922 states and 11660 transitions. [2020-02-10 19:46:40,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:46:40,517 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:46:40,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:40,525 INFO L225 Difference]: With dead ends: 2922 [2020-02-10 19:46:40,525 INFO L226 Difference]: Without dead ends: 2904 [2020-02-10 19:46:40,525 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:46:40,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2904 states. [2020-02-10 19:46:40,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2904 to 1569. [2020-02-10 19:46:40,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 19:46:40,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7042 transitions. [2020-02-10 19:46:40,593 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7042 transitions. Word has length 28 [2020-02-10 19:46:40,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:40,594 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7042 transitions. [2020-02-10 19:46:40,594 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:46:40,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7042 transitions. [2020-02-10 19:46:40,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:46:40,596 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:40,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] [2020-02-10 19:46:40,597 INFO L427 AbstractCegarLoop]: === Iteration 193 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:40,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:40,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1724660340, now seen corresponding path program 185 times [2020-02-10 19:46:40,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:40,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652334771] [2020-02-10 19:46:40,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:40,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:41,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:41,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652334771] [2020-02-10 19:46:41,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:41,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:46:41,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998233933] [2020-02-10 19:46:41,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:46:41,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:41,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:46:41,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:41,112 INFO L87 Difference]: Start difference. First operand 1569 states and 7042 transitions. Second operand 11 states. [2020-02-10 19:46:41,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:41,345 INFO L93 Difference]: Finished difference Result 2929 states and 11674 transitions. [2020-02-10 19:46:41,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:46:41,346 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:46:41,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:41,354 INFO L225 Difference]: With dead ends: 2929 [2020-02-10 19:46:41,354 INFO L226 Difference]: Without dead ends: 2911 [2020-02-10 19:46:41,354 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:46:41,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2911 states. [2020-02-10 19:46:41,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2911 to 1573. [2020-02-10 19:46:41,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 19:46:41,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7049 transitions. [2020-02-10 19:46:41,423 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7049 transitions. Word has length 28 [2020-02-10 19:46:41,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:41,423 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7049 transitions. [2020-02-10 19:46:41,423 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:46:41,423 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7049 transitions. [2020-02-10 19:46:41,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:46:41,426 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46: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] [2020-02-10 19:46:41,426 INFO L427 AbstractCegarLoop]: === Iteration 194 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:41,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:41,426 INFO L82 PathProgramCache]: Analyzing trace with hash 509447154, now seen corresponding path program 186 times [2020-02-10 19:46:41,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:41,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467835705] [2020-02-10 19:46:41,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:41,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:41,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 19:46:41,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467835705] [2020-02-10 19:46:41,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:41,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:46:41,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420339165] [2020-02-10 19:46:41,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:46:41,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:41,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:46:41,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:41,940 INFO L87 Difference]: Start difference. First operand 1573 states and 7049 transitions. Second operand 11 states. [2020-02-10 19:46:42,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:42,186 INFO L93 Difference]: Finished difference Result 2925 states and 11662 transitions. [2020-02-10 19:46:42,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:46:42,187 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:46:42,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:42,194 INFO L225 Difference]: With dead ends: 2925 [2020-02-10 19:46:42,194 INFO L226 Difference]: Without dead ends: 2903 [2020-02-10 19:46:42,194 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:46:42,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2903 states. [2020-02-10 19:46:42,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2903 to 1565. [2020-02-10 19:46:42,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1565 states. [2020-02-10 19:46:42,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 7031 transitions. [2020-02-10 19:46:42,261 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 7031 transitions. Word has length 28 [2020-02-10 19:46:42,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:42,261 INFO L479 AbstractCegarLoop]: Abstraction has 1565 states and 7031 transitions. [2020-02-10 19:46:42,261 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:46:42,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 7031 transitions. [2020-02-10 19:46:42,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:46:42,264 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46: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] [2020-02-10 19:46:42,264 INFO L427 AbstractCegarLoop]: === Iteration 195 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:42,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:42,264 INFO L82 PathProgramCache]: Analyzing trace with hash 15693908, now seen corresponding path program 187 times [2020-02-10 19:46:42,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:42,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49759175] [2020-02-10 19:46:42,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:42,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:42,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:42,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49759175] [2020-02-10 19:46:42,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:42,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:46:42,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013298977] [2020-02-10 19:46:42,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:46:42,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:42,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:46:42,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:42,788 INFO L87 Difference]: Start difference. First operand 1565 states and 7031 transitions. Second operand 11 states. [2020-02-10 19:46:42,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:42,975 INFO L93 Difference]: Finished difference Result 2933 states and 11689 transitions. [2020-02-10 19:46:42,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:46:42,975 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:46:42,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:42,982 INFO L225 Difference]: With dead ends: 2933 [2020-02-10 19:46:42,982 INFO L226 Difference]: Without dead ends: 2917 [2020-02-10 19:46:42,982 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:46:43,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2917 states. [2020-02-10 19:46:43,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2917 to 1575. [2020-02-10 19:46:43,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 19:46:43,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7057 transitions. [2020-02-10 19:46:43,049 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7057 transitions. Word has length 28 [2020-02-10 19:46:43,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:43,050 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7057 transitions. [2020-02-10 19:46:43,050 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:46:43,050 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7057 transitions. [2020-02-10 19:46:43,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:46:43,052 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:43,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] [2020-02-10 19:46:43,052 INFO L427 AbstractCegarLoop]: === Iteration 196 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:43,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:43,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1505098904, now seen corresponding path program 188 times [2020-02-10 19:46:43,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:43,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984354688] [2020-02-10 19:46:43,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:43,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:43,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:43,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984354688] [2020-02-10 19:46:43,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:43,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:46:43,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672357771] [2020-02-10 19:46:43,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:46:43,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:43,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:46:43,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:43,580 INFO L87 Difference]: Start difference. First operand 1575 states and 7057 transitions. Second operand 11 states. [2020-02-10 19:46:43,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:43,768 INFO L93 Difference]: Finished difference Result 2935 states and 11687 transitions. [2020-02-10 19:46:43,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:46:43,769 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:46:43,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:43,776 INFO L225 Difference]: With dead ends: 2935 [2020-02-10 19:46:43,776 INFO L226 Difference]: Without dead ends: 2911 [2020-02-10 19:46:43,776 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:46:43,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2911 states. [2020-02-10 19:46:43,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2911 to 1569. [2020-02-10 19:46:43,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 19:46:43,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7042 transitions. [2020-02-10 19:46:43,845 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7042 transitions. Word has length 28 [2020-02-10 19:46:43,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:43,845 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7042 transitions. [2020-02-10 19:46:43,845 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:46:43,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7042 transitions. [2020-02-10 19:46:43,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:46:43,848 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:43,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] [2020-02-10 19:46:43,848 INFO L427 AbstractCegarLoop]: === Iteration 197 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:43,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:43,848 INFO L82 PathProgramCache]: Analyzing trace with hash 553549486, now seen corresponding path program 189 times [2020-02-10 19:46:43,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:43,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985503488] [2020-02-10 19:46:43,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:43,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:44,376 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 19:46:44,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:44,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985503488] [2020-02-10 19:46:44,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:44,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:46:44,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363798160] [2020-02-10 19:46:44,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:46:44,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:44,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:46:44,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:44,384 INFO L87 Difference]: Start difference. First operand 1569 states and 7042 transitions. Second operand 11 states. [2020-02-10 19:46:44,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:44,585 INFO L93 Difference]: Finished difference Result 2927 states and 11671 transitions. [2020-02-10 19:46:44,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:46:44,585 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:46:44,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:44,592 INFO L225 Difference]: With dead ends: 2927 [2020-02-10 19:46:44,592 INFO L226 Difference]: Without dead ends: 2911 [2020-02-10 19:46:44,592 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:46:44,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2911 states. [2020-02-10 19:46:44,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2911 to 1573. [2020-02-10 19:46:44,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 19:46:44,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7049 transitions. [2020-02-10 19:46:44,662 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7049 transitions. Word has length 28 [2020-02-10 19:46:44,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:44,662 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7049 transitions. [2020-02-10 19:46:44,662 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:46:44,662 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7049 transitions. [2020-02-10 19:46:44,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:46:44,664 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:44,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] [2020-02-10 19:46:44,665 INFO L427 AbstractCegarLoop]: === Iteration 198 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:44,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:44,665 INFO L82 PathProgramCache]: Analyzing trace with hash -17905320, now seen corresponding path program 190 times [2020-02-10 19:46:44,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:44,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990702136] [2020-02-10 19:46:44,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:44,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:45,094 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 31 [2020-02-10 19:46:45,209 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 19:46:45,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 19:46:45,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990702136] [2020-02-10 19:46:45,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:45,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:46:45,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394577034] [2020-02-10 19:46:45,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:46:45,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:45,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:46:45,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:45,218 INFO L87 Difference]: Start difference. First operand 1573 states and 7049 transitions. Second operand 11 states. [2020-02-10 19:46:45,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:45,462 INFO L93 Difference]: Finished difference Result 2925 states and 11663 transitions. [2020-02-10 19:46:45,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:46:45,462 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:46:45,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:45,469 INFO L225 Difference]: With dead ends: 2925 [2020-02-10 19:46:45,469 INFO L226 Difference]: Without dead ends: 2907 [2020-02-10 19:46:45,469 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:46:45,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2907 states. [2020-02-10 19:46:45,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2907 to 1569. [2020-02-10 19:46:45,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 19:46:45,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7038 transitions. [2020-02-10 19:46:45,539 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7038 transitions. Word has length 28 [2020-02-10 19:46:45,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:45,539 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7038 transitions. [2020-02-10 19:46:45,539 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:46:45,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7038 transitions. [2020-02-10 19:46:45,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:46:45,541 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:45,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] [2020-02-10 19:46:45,541 INFO L427 AbstractCegarLoop]: === Iteration 199 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:45,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:45,542 INFO L82 PathProgramCache]: Analyzing trace with hash 969869102, now seen corresponding path program 191 times [2020-02-10 19:46:45,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:45,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317269827] [2020-02-10 19:46:45,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:45,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:46,071 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 19:46:46,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 19:46:46,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317269827] [2020-02-10 19:46:46,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:46,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:46:46,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316256990] [2020-02-10 19:46:46,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:46:46,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:46,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:46:46,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:46,080 INFO L87 Difference]: Start difference. First operand 1569 states and 7038 transitions. Second operand 11 states. [2020-02-10 19:46:46,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:46,318 INFO L93 Difference]: Finished difference Result 2931 states and 11675 transitions. [2020-02-10 19:46:46,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:46:46,318 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:46:46,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:46,325 INFO L225 Difference]: With dead ends: 2931 [2020-02-10 19:46:46,325 INFO L226 Difference]: Without dead ends: 2913 [2020-02-10 19:46:46,325 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:46:46,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2913 states. [2020-02-10 19:46:46,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2913 to 1573. [2020-02-10 19:46:46,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 19:46:46,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7045 transitions. [2020-02-10 19:46:46,393 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7045 transitions. Word has length 28 [2020-02-10 19:46:46,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:46,393 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7045 transitions. [2020-02-10 19:46:46,393 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:46:46,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7045 transitions. [2020-02-10 19:46:46,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:46:46,395 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:46,395 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:46,396 INFO L427 AbstractCegarLoop]: === Iteration 200 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:46,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:46,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1090990700, now seen corresponding path program 192 times [2020-02-10 19:46:46,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:46,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672053236] [2020-02-10 19:46:46,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:46,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:46,917 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 19:46:46,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:46,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672053236] [2020-02-10 19:46:46,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:46,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:46:46,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586532688] [2020-02-10 19:46:46,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:46:46,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:46,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:46:46,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:46,927 INFO L87 Difference]: Start difference. First operand 1573 states and 7045 transitions. Second operand 11 states. [2020-02-10 19:46:47,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:47,115 INFO L93 Difference]: Finished difference Result 2927 states and 11663 transitions. [2020-02-10 19:46:47,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:46:47,116 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:46:47,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:47,123 INFO L225 Difference]: With dead ends: 2927 [2020-02-10 19:46:47,123 INFO L226 Difference]: Without dead ends: 2901 [2020-02-10 19:46:47,123 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:46:47,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2901 states. [2020-02-10 19:46:47,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2901 to 1561. [2020-02-10 19:46:47,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1561 states. [2020-02-10 19:46:47,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 7020 transitions. [2020-02-10 19:46:47,192 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 7020 transitions. Word has length 28 [2020-02-10 19:46:47,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:47,192 INFO L479 AbstractCegarLoop]: Abstraction has 1561 states and 7020 transitions. [2020-02-10 19:46:47,192 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:46:47,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 7020 transitions. [2020-02-10 19:46:47,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:46:47,195 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:47,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] [2020-02-10 19:46:47,195 INFO L427 AbstractCegarLoop]: === Iteration 201 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:47,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:47,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1682365546, now seen corresponding path program 193 times [2020-02-10 19:46:47,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:47,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294296304] [2020-02-10 19:46:47,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:47,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:47,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 19:46:47,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294296304] [2020-02-10 19:46:47,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:47,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:46:47,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563334880] [2020-02-10 19:46:47,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:46:47,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:47,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:46:47,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:47,726 INFO L87 Difference]: Start difference. First operand 1561 states and 7020 transitions. Second operand 11 states. [2020-02-10 19:46:47,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:47,910 INFO L93 Difference]: Finished difference Result 2965 states and 11770 transitions. [2020-02-10 19:46:47,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:46:47,910 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:46:47,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:47,918 INFO L225 Difference]: With dead ends: 2965 [2020-02-10 19:46:47,918 INFO L226 Difference]: Without dead ends: 2950 [2020-02-10 19:46:47,918 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:46:47,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2020-02-10 19:46:47,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 1580. [2020-02-10 19:46:47,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 19:46:47,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7081 transitions. [2020-02-10 19:46:47,987 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7081 transitions. Word has length 28 [2020-02-10 19:46:47,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:47,987 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7081 transitions. [2020-02-10 19:46:47,987 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:46:47,987 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7081 transitions. [2020-02-10 19:46:47,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:46:47,990 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:47,990 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:47,990 INFO L427 AbstractCegarLoop]: === Iteration 202 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:47,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:47,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1123196754, now seen corresponding path program 194 times [2020-02-10 19:46:47,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:47,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640180804] [2020-02-10 19:46:47,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:47,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:48,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:48,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640180804] [2020-02-10 19:46:48,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:48,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:46:48,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300144044] [2020-02-10 19:46:48,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:46:48,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:48,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:46:48,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:48,519 INFO L87 Difference]: Start difference. First operand 1580 states and 7081 transitions. Second operand 11 states. [2020-02-10 19:46:48,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:48,684 INFO L93 Difference]: Finished difference Result 2970 states and 11774 transitions. [2020-02-10 19:46:48,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:46:48,684 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:46:48,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:48,691 INFO L225 Difference]: With dead ends: 2970 [2020-02-10 19:46:48,691 INFO L226 Difference]: Without dead ends: 2944 [2020-02-10 19:46:48,692 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:46:48,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2944 states. [2020-02-10 19:46:48,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2944 to 1574. [2020-02-10 19:46:48,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 19:46:48,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7064 transitions. [2020-02-10 19:46:48,761 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7064 transitions. Word has length 28 [2020-02-10 19:46:48,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:48,761 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7064 transitions. [2020-02-10 19:46:48,761 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:46:48,761 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7064 transitions. [2020-02-10 19:46:48,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:46:48,763 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:48,763 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:48,764 INFO L427 AbstractCegarLoop]: === Iteration 203 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:48,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:48,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1001660792, now seen corresponding path program 195 times [2020-02-10 19:46:48,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:48,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517912804] [2020-02-10 19:46:48,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:48,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:49,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 19:46:49,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517912804] [2020-02-10 19:46:49,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:49,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:46:49,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225039631] [2020-02-10 19:46:49,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:46:49,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:49,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:46:49,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:49,284 INFO L87 Difference]: Start difference. First operand 1574 states and 7064 transitions. Second operand 11 states. [2020-02-10 19:46:49,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:49,514 INFO L93 Difference]: Finished difference Result 2962 states and 11759 transitions. [2020-02-10 19:46:49,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:46:49,514 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:46:49,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:49,522 INFO L225 Difference]: With dead ends: 2962 [2020-02-10 19:46:49,522 INFO L226 Difference]: Without dead ends: 2947 [2020-02-10 19:46:49,522 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:46:49,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2947 states. [2020-02-10 19:46:49,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2947 to 1579. [2020-02-10 19:46:49,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 19:46:49,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7073 transitions. [2020-02-10 19:46:49,590 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7073 transitions. Word has length 28 [2020-02-10 19:46:49,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:49,590 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7073 transitions. [2020-02-10 19:46:49,590 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:46:49,590 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7073 transitions. [2020-02-10 19:46:49,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:46:49,592 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:49,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] [2020-02-10 19:46:49,593 INFO L427 AbstractCegarLoop]: === Iteration 204 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:49,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:49,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1232446702, now seen corresponding path program 196 times [2020-02-10 19:46:49,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:49,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235716641] [2020-02-10 19:46:49,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:49,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:50,025 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 30 [2020-02-10 19:46:50,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:50,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235716641] [2020-02-10 19:46:50,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:50,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:46:50,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082539342] [2020-02-10 19:46:50,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:46:50,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:50,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:46:50,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:50,147 INFO L87 Difference]: Start difference. First operand 1579 states and 7073 transitions. Second operand 11 states. [2020-02-10 19:46:50,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:50,341 INFO L93 Difference]: Finished difference Result 2965 states and 11760 transitions. [2020-02-10 19:46:50,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:46:50,341 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:46:50,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:50,350 INFO L225 Difference]: With dead ends: 2965 [2020-02-10 19:46:50,350 INFO L226 Difference]: Without dead ends: 2942 [2020-02-10 19:46:50,351 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:46:50,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2942 states. [2020-02-10 19:46:50,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2942 to 1574. [2020-02-10 19:46:50,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 19:46:50,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7059 transitions. [2020-02-10 19:46:50,421 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7059 transitions. Word has length 28 [2020-02-10 19:46:50,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:50,421 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7059 transitions. [2020-02-10 19:46:50,421 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:46:50,421 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7059 transitions. [2020-02-10 19:46:50,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:46:50,423 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:50,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] [2020-02-10 19:46:50,423 INFO L427 AbstractCegarLoop]: === Iteration 205 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:50,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:50,424 INFO L82 PathProgramCache]: Analyzing trace with hash -585341176, now seen corresponding path program 197 times [2020-02-10 19:46:50,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:50,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161458986] [2020-02-10 19:46:50,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:50,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:50,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 19:46:50,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161458986] [2020-02-10 19:46:50,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:50,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:46:50,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187783248] [2020-02-10 19:46:50,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:46:50,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:50,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:46:50,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:50,964 INFO L87 Difference]: Start difference. First operand 1574 states and 7059 transitions. Second operand 11 states. [2020-02-10 19:46:51,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:51,107 INFO L93 Difference]: Finished difference Result 2977 states and 11784 transitions. [2020-02-10 19:46:51,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:46:51,107 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:46:51,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:51,115 INFO L225 Difference]: With dead ends: 2977 [2020-02-10 19:46:51,115 INFO L226 Difference]: Without dead ends: 2957 [2020-02-10 19:46:51,116 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:46:51,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2957 states. [2020-02-10 19:46:51,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2957 to 1584. [2020-02-10 19:46:51,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1584 states. [2020-02-10 19:46:51,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 7076 transitions. [2020-02-10 19:46:51,184 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 7076 transitions. Word has length 28 [2020-02-10 19:46:51,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:51,184 INFO L479 AbstractCegarLoop]: Abstraction has 1584 states and 7076 transitions. [2020-02-10 19:46:51,184 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:46:51,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 7076 transitions. [2020-02-10 19:46:51,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:46:51,187 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:51,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] [2020-02-10 19:46:51,187 INFO L427 AbstractCegarLoop]: === Iteration 206 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:51,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:51,187 INFO L82 PathProgramCache]: Analyzing trace with hash 159361322, now seen corresponding path program 198 times [2020-02-10 19:46:51,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:51,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388828239] [2020-02-10 19:46:51,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:51,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:51,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:51,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388828239] [2020-02-10 19:46:51,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:51,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:46:51,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300951086] [2020-02-10 19:46:51,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:46:51,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:51,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:46:51,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:51,729 INFO L87 Difference]: Start difference. First operand 1584 states and 7076 transitions. Second operand 11 states. [2020-02-10 19:46:51,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:51,934 INFO L93 Difference]: Finished difference Result 2975 states and 11772 transitions. [2020-02-10 19:46:51,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:46:51,934 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:46:51,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:51,942 INFO L225 Difference]: With dead ends: 2975 [2020-02-10 19:46:51,942 INFO L226 Difference]: Without dead ends: 2940 [2020-02-10 19:46:51,942 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:46:51,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2940 states. [2020-02-10 19:46:52,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2940 to 1567. [2020-02-10 19:46:52,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 19:46:52,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7040 transitions. [2020-02-10 19:46:52,011 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7040 transitions. Word has length 28 [2020-02-10 19:46:52,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:52,011 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7040 transitions. [2020-02-10 19:46:52,011 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:46:52,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7040 transitions. [2020-02-10 19:46:52,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:46:52,014 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:52,014 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:52,014 INFO L427 AbstractCegarLoop]: === Iteration 207 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:52,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:52,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1176019280, now seen corresponding path program 199 times [2020-02-10 19:46:52,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:52,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841644342] [2020-02-10 19:46:52,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:52,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:52,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 19:46:52,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841644342] [2020-02-10 19:46:52,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:52,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:46:52,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818884196] [2020-02-10 19:46:52,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:46:52,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:52,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:46:52,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:52,536 INFO L87 Difference]: Start difference. First operand 1567 states and 7040 transitions. Second operand 11 states. [2020-02-10 19:46:52,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:52,740 INFO L93 Difference]: Finished difference Result 2953 states and 11734 transitions. [2020-02-10 19:46:52,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:46:52,741 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:46:52,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:52,749 INFO L225 Difference]: With dead ends: 2953 [2020-02-10 19:46:52,749 INFO L226 Difference]: Without dead ends: 2938 [2020-02-10 19:46:52,749 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:46:52,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2938 states. [2020-02-10 19:46:52,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2938 to 1578. [2020-02-10 19:46:52,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 19:46:52,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7069 transitions. [2020-02-10 19:46:52,816 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7069 transitions. Word has length 28 [2020-02-10 19:46:52,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:52,816 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7069 transitions. [2020-02-10 19:46:52,817 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:46:52,817 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7069 transitions. [2020-02-10 19:46:52,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:46:52,819 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:52,819 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:52,819 INFO L427 AbstractCegarLoop]: === Iteration 208 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:52,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:52,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1629543020, now seen corresponding path program 200 times [2020-02-10 19:46:52,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:52,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323309714] [2020-02-10 19:46:52,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:52,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:53,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 19:46:53,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323309714] [2020-02-10 19:46:53,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:53,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:46:53,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732308380] [2020-02-10 19:46:53,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:46:53,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:53,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:46:53,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:53,344 INFO L87 Difference]: Start difference. First operand 1578 states and 7069 transitions. Second operand 11 states. [2020-02-10 19:46:53,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:53,490 INFO L93 Difference]: Finished difference Result 2958 states and 11738 transitions. [2020-02-10 19:46:53,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:46:53,491 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:46:53,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:53,498 INFO L225 Difference]: With dead ends: 2958 [2020-02-10 19:46:53,498 INFO L226 Difference]: Without dead ends: 2932 [2020-02-10 19:46:53,499 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:46:53,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2932 states. [2020-02-10 19:46:53,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2932 to 1572. [2020-02-10 19:46:53,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 19:46:53,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7053 transitions. [2020-02-10 19:46:53,566 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7053 transitions. Word has length 28 [2020-02-10 19:46:53,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:53,566 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7053 transitions. [2020-02-10 19:46:53,566 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:46:53,566 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7053 transitions. [2020-02-10 19:46:53,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:46:53,568 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:53,568 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:53,569 INFO L427 AbstractCegarLoop]: === Iteration 209 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:53,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:53,569 INFO L82 PathProgramCache]: Analyzing trace with hash -970151480, now seen corresponding path program 201 times [2020-02-10 19:46:53,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:53,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829471241] [2020-02-10 19:46:53,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:53,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:54,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 19:46:54,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829471241] [2020-02-10 19:46:54,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:54,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:46:54,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469260127] [2020-02-10 19:46:54,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:46:54,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:54,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:46:54,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:54,098 INFO L87 Difference]: Start difference. First operand 1572 states and 7053 transitions. Second operand 11 states. [2020-02-10 19:46:54,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:54,310 INFO L93 Difference]: Finished difference Result 2945 states and 11713 transitions. [2020-02-10 19:46:54,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:46:54,311 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:46:54,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:54,318 INFO L225 Difference]: With dead ends: 2945 [2020-02-10 19:46:54,319 INFO L226 Difference]: Without dead ends: 2930 [2020-02-10 19:46:54,319 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:46:54,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2020-02-10 19:46:54,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 1576. [2020-02-10 19:46:54,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 19:46:54,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7060 transitions. [2020-02-10 19:46:54,386 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7060 transitions. Word has length 28 [2020-02-10 19:46:54,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:54,386 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7060 transitions. [2020-02-10 19:46:54,387 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:46:54,387 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7060 transitions. [2020-02-10 19:46:54,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:46:54,389 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:54,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] [2020-02-10 19:46:54,389 INFO L427 AbstractCegarLoop]: === Iteration 210 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:54,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:54,389 INFO L82 PathProgramCache]: Analyzing trace with hash -796903788, now seen corresponding path program 202 times [2020-02-10 19:46:54,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:54,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012158875] [2020-02-10 19:46:54,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:54,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:54,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 19:46:54,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012158875] [2020-02-10 19:46:54,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:54,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:46:54,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635550631] [2020-02-10 19:46:54,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:46:54,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:54,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:46:54,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:54,922 INFO L87 Difference]: Start difference. First operand 1576 states and 7060 transitions. Second operand 11 states. [2020-02-10 19:46:55,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:55,125 INFO L93 Difference]: Finished difference Result 2944 states and 11707 transitions. [2020-02-10 19:46:55,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:46:55,125 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:46:55,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:55,133 INFO L225 Difference]: With dead ends: 2944 [2020-02-10 19:46:55,133 INFO L226 Difference]: Without dead ends: 2926 [2020-02-10 19:46:55,133 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:46:55,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2926 states. [2020-02-10 19:46:55,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2926 to 1572. [2020-02-10 19:46:55,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 19:46:55,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7049 transitions. [2020-02-10 19:46:55,201 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7049 transitions. Word has length 28 [2020-02-10 19:46:55,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:55,201 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7049 transitions. [2020-02-10 19:46:55,201 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:46:55,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7049 transitions. [2020-02-10 19:46:55,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:46:55,204 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:55,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] [2020-02-10 19:46:55,204 INFO L427 AbstractCegarLoop]: === Iteration 211 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:55,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:55,204 INFO L82 PathProgramCache]: Analyzing trace with hash -553831864, now seen corresponding path program 203 times [2020-02-10 19:46:55,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:55,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444221568] [2020-02-10 19:46:55,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:55,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:55,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 19:46:55,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444221568] [2020-02-10 19:46:55,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:55,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:46:55,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040075063] [2020-02-10 19:46:55,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:46:55,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:55,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:46:55,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:55,730 INFO L87 Difference]: Start difference. First operand 1572 states and 7049 transitions. Second operand 11 states. [2020-02-10 19:46:55,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:55,896 INFO L93 Difference]: Finished difference Result 2956 states and 11729 transitions. [2020-02-10 19:46:55,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:46:55,897 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:46:55,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:55,904 INFO L225 Difference]: With dead ends: 2956 [2020-02-10 19:46:55,904 INFO L226 Difference]: Without dead ends: 2936 [2020-02-10 19:46:55,904 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:46:55,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2936 states. [2020-02-10 19:46:55,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2936 to 1577. [2020-02-10 19:46:55,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 19:46:55,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7057 transitions. [2020-02-10 19:46:55,972 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7057 transitions. Word has length 28 [2020-02-10 19:46:55,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:55,972 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7057 transitions. [2020-02-10 19:46:55,972 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:46:55,972 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7057 transitions. [2020-02-10 19:46:55,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:46:55,974 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:55,974 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:55,975 INFO L427 AbstractCegarLoop]: === Iteration 212 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:55,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:55,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1869989168, now seen corresponding path program 204 times [2020-02-10 19:46:55,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:55,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744833610] [2020-02-10 19:46:55,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:55,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:56,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 19:46:56,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744833610] [2020-02-10 19:46:56,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:56,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:46:56,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265415486] [2020-02-10 19:46:56,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:46:56,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:56,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:46:56,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:56,487 INFO L87 Difference]: Start difference. First operand 1577 states and 7057 transitions. Second operand 11 states. [2020-02-10 19:46:56,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:56,679 INFO L93 Difference]: Finished difference Result 2950 states and 11713 transitions. [2020-02-10 19:46:56,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:46:56,680 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:46:56,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:56,687 INFO L225 Difference]: With dead ends: 2950 [2020-02-10 19:46:56,687 INFO L226 Difference]: Without dead ends: 2926 [2020-02-10 19:46:56,687 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:46:56,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2926 states. [2020-02-10 19:46:56,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2926 to 1567. [2020-02-10 19:46:56,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 19:46:56,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7035 transitions. [2020-02-10 19:46:56,755 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7035 transitions. Word has length 28 [2020-02-10 19:46:56,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:56,755 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7035 transitions. [2020-02-10 19:46:56,755 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:46:56,755 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7035 transitions. [2020-02-10 19:46:56,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:46:56,757 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:56,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] [2020-02-10 19:46:56,758 INFO L427 AbstractCegarLoop]: === Iteration 213 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:56,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:56,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1186522384, now seen corresponding path program 205 times [2020-02-10 19:46:56,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:56,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563233347] [2020-02-10 19:46:56,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:56,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:57,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:57,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563233347] [2020-02-10 19:46:57,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:57,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:46:57,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995615773] [2020-02-10 19:46:57,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:46:57,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:57,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:46:57,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:57,275 INFO L87 Difference]: Start difference. First operand 1567 states and 7035 transitions. Second operand 11 states. [2020-02-10 19:46:57,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:57,468 INFO L93 Difference]: Finished difference Result 2945 states and 11714 transitions. [2020-02-10 19:46:57,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:46:57,469 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:46:57,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:57,476 INFO L225 Difference]: With dead ends: 2945 [2020-02-10 19:46:57,476 INFO L226 Difference]: Without dead ends: 2930 [2020-02-10 19:46:57,476 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:46:57,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2020-02-10 19:46:57,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 1576. [2020-02-10 19:46:57,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 19:46:57,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7059 transitions. [2020-02-10 19:46:57,552 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7059 transitions. Word has length 28 [2020-02-10 19:46:57,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:57,552 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7059 transitions. [2020-02-10 19:46:57,552 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:46:57,552 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7059 transitions. [2020-02-10 19:46:57,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:46:57,554 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:57,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] [2020-02-10 19:46:57,554 INFO L427 AbstractCegarLoop]: === Iteration 214 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:57,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:57,555 INFO L82 PathProgramCache]: Analyzing trace with hash -874337418, now seen corresponding path program 206 times [2020-02-10 19:46:57,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:57,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276527418] [2020-02-10 19:46:57,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:57,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:58,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:58,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276527418] [2020-02-10 19:46:58,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:58,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:46:58,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813588220] [2020-02-10 19:46:58,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:46:58,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:58,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:46:58,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:58,068 INFO L87 Difference]: Start difference. First operand 1576 states and 7059 transitions. Second operand 11 states. [2020-02-10 19:46:58,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:58,262 INFO L93 Difference]: Finished difference Result 2948 states and 11715 transitions. [2020-02-10 19:46:58,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:46:58,263 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:46:58,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:58,270 INFO L225 Difference]: With dead ends: 2948 [2020-02-10 19:46:58,270 INFO L226 Difference]: Without dead ends: 2925 [2020-02-10 19:46:58,271 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:46:58,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2925 states. [2020-02-10 19:46:58,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2925 to 1571. [2020-02-10 19:46:58,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 19:46:58,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7046 transitions. [2020-02-10 19:46:58,339 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7046 transitions. Word has length 28 [2020-02-10 19:46:58,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:58,339 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7046 transitions. [2020-02-10 19:46:58,339 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:46:58,339 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7046 transitions. [2020-02-10 19:46:58,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:46:58,341 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:58,341 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:58,341 INFO L427 AbstractCegarLoop]: === Iteration 215 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:58,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:58,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1724377962, now seen corresponding path program 207 times [2020-02-10 19:46:58,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:58,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661307592] [2020-02-10 19:46:58,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:58,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:58,856 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 31 [2020-02-10 19:46:58,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:58,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661307592] [2020-02-10 19:46:58,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:58,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:46:58,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247392633] [2020-02-10 19:46:58,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:46:58,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:58,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:46:58,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:58,864 INFO L87 Difference]: Start difference. First operand 1571 states and 7046 transitions. Second operand 11 states. [2020-02-10 19:46:59,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:59,133 INFO L93 Difference]: Finished difference Result 2940 states and 11699 transitions. [2020-02-10 19:46:59,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:46:59,133 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:46:59,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:59,140 INFO L225 Difference]: With dead ends: 2940 [2020-02-10 19:46:59,141 INFO L226 Difference]: Without dead ends: 2925 [2020-02-10 19:46:59,141 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:46:59,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2925 states. [2020-02-10 19:46:59,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2925 to 1575. [2020-02-10 19:46:59,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 19:46:59,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7053 transitions. [2020-02-10 19:46:59,208 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7053 transitions. Word has length 28 [2020-02-10 19:46:59,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:46:59,208 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7053 transitions. [2020-02-10 19:46:59,209 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:46:59,209 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7053 transitions. [2020-02-10 19:46:59,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:46:59,211 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:46:59,211 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:46:59,211 INFO L427 AbstractCegarLoop]: === Iteration 216 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:46:59,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:46:59,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1897625654, now seen corresponding path program 208 times [2020-02-10 19:46:59,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:46:59,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43783589] [2020-02-10 19:46:59,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:46:59,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:46:59,736 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 19:46:59,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:46:59,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43783589] [2020-02-10 19:46:59,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:46:59,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:46:59,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374421692] [2020-02-10 19:46:59,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:46:59,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:46:59,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:46:59,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:46:59,745 INFO L87 Difference]: Start difference. First operand 1575 states and 7053 transitions. Second operand 11 states. [2020-02-10 19:46:59,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:46:59,980 INFO L93 Difference]: Finished difference Result 2939 states and 11693 transitions. [2020-02-10 19:46:59,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:46:59,981 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:46:59,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:46:59,988 INFO L225 Difference]: With dead ends: 2939 [2020-02-10 19:46:59,988 INFO L226 Difference]: Without dead ends: 2921 [2020-02-10 19:46:59,988 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:47:00,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2921 states. [2020-02-10 19:47:00,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2921 to 1571. [2020-02-10 19:47:00,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 19:47:00,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7042 transitions. [2020-02-10 19:47:00,057 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7042 transitions. Word has length 28 [2020-02-10 19:47:00,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:00,057 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7042 transitions. [2020-02-10 19:47:00,057 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:47:00,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7042 transitions. [2020-02-10 19:47:00,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:47:00,060 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:00,060 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:00,060 INFO L427 AbstractCegarLoop]: === Iteration 217 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:00,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:00,060 INFO L82 PathProgramCache]: Analyzing trace with hash 201373738, now seen corresponding path program 209 times [2020-02-10 19:47:00,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:00,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121144048] [2020-02-10 19:47:00,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:00,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:00,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:00,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121144048] [2020-02-10 19:47:00,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:00,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:47:00,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501991274] [2020-02-10 19:47:00,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:47:00,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:00,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:47:00,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:00,578 INFO L87 Difference]: Start difference. First operand 1571 states and 7042 transitions. Second operand 11 states. [2020-02-10 19:47:00,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:00,844 INFO L93 Difference]: Finished difference Result 2946 states and 11707 transitions. [2020-02-10 19:47:00,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:47:00,844 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:47:00,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:00,852 INFO L225 Difference]: With dead ends: 2946 [2020-02-10 19:47:00,852 INFO L226 Difference]: Without dead ends: 2928 [2020-02-10 19:47:00,852 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:47:00,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2928 states. [2020-02-10 19:47:00,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2928 to 1575. [2020-02-10 19:47:00,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 19:47:00,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7049 transitions. [2020-02-10 19:47:00,921 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7049 transitions. Word has length 28 [2020-02-10 19:47:00,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:00,921 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7049 transitions. [2020-02-10 19:47:00,921 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:47:00,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7049 transitions. [2020-02-10 19:47:00,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:47:00,923 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:00,924 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:00,924 INFO L427 AbstractCegarLoop]: === Iteration 218 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:00,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:00,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1859486064, now seen corresponding path program 210 times [2020-02-10 19:47:00,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:00,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92835748] [2020-02-10 19:47:00,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:00,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:01,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:01,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92835748] [2020-02-10 19:47:01,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:01,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:47:01,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348087656] [2020-02-10 19:47:01,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:47:01,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:01,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:47:01,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:01,442 INFO L87 Difference]: Start difference. First operand 1575 states and 7049 transitions. Second operand 11 states. [2020-02-10 19:47:01,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:01,711 INFO L93 Difference]: Finished difference Result 2942 states and 11695 transitions. [2020-02-10 19:47:01,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:47:01,712 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:47:01,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:01,719 INFO L225 Difference]: With dead ends: 2942 [2020-02-10 19:47:01,719 INFO L226 Difference]: Without dead ends: 2920 [2020-02-10 19:47:01,720 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:47:01,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2920 states. [2020-02-10 19:47:01,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2920 to 1567. [2020-02-10 19:47:01,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 19:47:01,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7031 transitions. [2020-02-10 19:47:01,786 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7031 transitions. Word has length 28 [2020-02-10 19:47:01,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:01,787 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7031 transitions. [2020-02-10 19:47:01,787 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:47:01,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7031 transitions. [2020-02-10 19:47:01,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:47:01,789 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:01,789 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:01,789 INFO L427 AbstractCegarLoop]: === Iteration 219 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:01,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:01,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1598033708, now seen corresponding path program 211 times [2020-02-10 19:47:01,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:01,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278143571] [2020-02-10 19:47:01,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:01,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:02,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:02,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278143571] [2020-02-10 19:47:02,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:02,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:47:02,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392425338] [2020-02-10 19:47:02,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:47:02,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:02,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:47:02,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:02,355 INFO L87 Difference]: Start difference. First operand 1567 states and 7031 transitions. Second operand 11 states. [2020-02-10 19:47:02,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:02,540 INFO L93 Difference]: Finished difference Result 2973 states and 11768 transitions. [2020-02-10 19:47:02,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:47:02,540 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:47:02,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:02,547 INFO L225 Difference]: With dead ends: 2973 [2020-02-10 19:47:02,547 INFO L226 Difference]: Without dead ends: 2953 [2020-02-10 19:47:02,548 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:47:02,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2953 states. [2020-02-10 19:47:02,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2953 to 1583. [2020-02-10 19:47:02,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 19:47:02,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7068 transitions. [2020-02-10 19:47:02,615 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7068 transitions. Word has length 28 [2020-02-10 19:47:02,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:02,615 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7068 transitions. [2020-02-10 19:47:02,615 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:47:02,615 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7068 transitions. [2020-02-10 19:47:02,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:47:02,618 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:02,618 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:02,618 INFO L427 AbstractCegarLoop]: === Iteration 220 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:02,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:02,618 INFO L82 PathProgramCache]: Analyzing trace with hash -853331210, now seen corresponding path program 212 times [2020-02-10 19:47:02,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:02,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045240317] [2020-02-10 19:47:02,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:02,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:03,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:03,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045240317] [2020-02-10 19:47:03,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:03,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:47:03,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933023244] [2020-02-10 19:47:03,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:47:03,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:03,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:47:03,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:03,155 INFO L87 Difference]: Start difference. First operand 1583 states and 7068 transitions. Second operand 11 states. [2020-02-10 19:47:03,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:03,425 INFO L93 Difference]: Finished difference Result 2971 states and 11756 transitions. [2020-02-10 19:47:03,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:47:03,425 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:47:03,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:03,433 INFO L225 Difference]: With dead ends: 2971 [2020-02-10 19:47:03,433 INFO L226 Difference]: Without dead ends: 2943 [2020-02-10 19:47:03,433 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:47:03,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2943 states. [2020-02-10 19:47:03,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2943 to 1573. [2020-02-10 19:47:03,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 19:47:03,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7045 transitions. [2020-02-10 19:47:03,503 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7045 transitions. Word has length 28 [2020-02-10 19:47:03,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:03,503 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7045 transitions. [2020-02-10 19:47:03,503 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:47:03,503 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7045 transitions. [2020-02-10 19:47:03,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:47:03,505 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:03,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] [2020-02-10 19:47:03,506 INFO L427 AbstractCegarLoop]: === Iteration 221 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:03,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:03,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1060178130, now seen corresponding path program 213 times [2020-02-10 19:47:03,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:03,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837146282] [2020-02-10 19:47:03,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:03,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:04,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:04,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837146282] [2020-02-10 19:47:04,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:04,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:47:04,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375388181] [2020-02-10 19:47:04,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:47:04,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:04,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:47:04,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:04,051 INFO L87 Difference]: Start difference. First operand 1573 states and 7045 transitions. Second operand 11 states. [2020-02-10 19:47:04,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:04,282 INFO L93 Difference]: Finished difference Result 2964 states and 11741 transitions. [2020-02-10 19:47:04,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:47:04,282 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:47:04,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:04,290 INFO L225 Difference]: With dead ends: 2964 [2020-02-10 19:47:04,290 INFO L226 Difference]: Without dead ends: 2944 [2020-02-10 19:47:04,290 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:47:04,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2944 states. [2020-02-10 19:47:04,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2944 to 1578. [2020-02-10 19:47:04,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 19:47:04,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7053 transitions. [2020-02-10 19:47:04,358 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7053 transitions. Word has length 28 [2020-02-10 19:47:04,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:04,358 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7053 transitions. [2020-02-10 19:47:04,358 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:47:04,358 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7053 transitions. [2020-02-10 19:47:04,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:47:04,360 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:04,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] [2020-02-10 19:47:04,360 INFO L427 AbstractCegarLoop]: === Iteration 222 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:04,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:04,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1918631862, now seen corresponding path program 214 times [2020-02-10 19:47:04,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:04,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370642327] [2020-02-10 19:47:04,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:04,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:04,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:04,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370642327] [2020-02-10 19:47:04,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:04,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:47:04,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014383225] [2020-02-10 19:47:04,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:47:04,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:04,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:47:04,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:04,878 INFO L87 Difference]: Start difference. First operand 1578 states and 7053 transitions. Second operand 11 states. [2020-02-10 19:47:05,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:05,101 INFO L93 Difference]: Finished difference Result 2958 states and 11725 transitions. [2020-02-10 19:47:05,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:47:05,101 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:47:05,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:05,109 INFO L225 Difference]: With dead ends: 2958 [2020-02-10 19:47:05,109 INFO L226 Difference]: Without dead ends: 2939 [2020-02-10 19:47:05,109 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:47:05,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2939 states. [2020-02-10 19:47:05,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2939 to 1573. [2020-02-10 19:47:05,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 19:47:05,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7040 transitions. [2020-02-10 19:47:05,176 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7040 transitions. Word has length 28 [2020-02-10 19:47:05,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:05,176 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7040 transitions. [2020-02-10 19:47:05,176 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:47:05,176 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7040 transitions. [2020-02-10 19:47:05,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:47:05,179 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:05,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] [2020-02-10 19:47:05,179 INFO L427 AbstractCegarLoop]: === Iteration 223 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:05,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:05,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1295465326, now seen corresponding path program 215 times [2020-02-10 19:47:05,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:05,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600547988] [2020-02-10 19:47:05,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:05,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:05,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 19:47:05,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600547988] [2020-02-10 19:47:05,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:05,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:47:05,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572763389] [2020-02-10 19:47:05,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:47:05,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:05,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:47:05,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:05,694 INFO L87 Difference]: Start difference. First operand 1573 states and 7040 transitions. Second operand 11 states. [2020-02-10 19:47:05,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:05,966 INFO L93 Difference]: Finished difference Result 2959 states and 11728 transitions. [2020-02-10 19:47:05,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:47:05,967 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:47:05,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:05,974 INFO L225 Difference]: With dead ends: 2959 [2020-02-10 19:47:05,975 INFO L226 Difference]: Without dead ends: 2941 [2020-02-10 19:47:05,975 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:47:06,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2941 states. [2020-02-10 19:47:06,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2941 to 1577. [2020-02-10 19:47:06,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 19:47:06,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7047 transitions. [2020-02-10 19:47:06,044 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7047 transitions. Word has length 28 [2020-02-10 19:47:06,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:06,044 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7047 transitions. [2020-02-10 19:47:06,044 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:47:06,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7047 transitions. [2020-02-10 19:47:06,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:47:06,046 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:06,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] [2020-02-10 19:47:06,046 INFO L427 AbstractCegarLoop]: === Iteration 224 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:06,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:06,047 INFO L82 PathProgramCache]: Analyzing trace with hash -765394476, now seen corresponding path program 216 times [2020-02-10 19:47:06,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:06,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757920971] [2020-02-10 19:47:06,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:06,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:06,557 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 19:47:06,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:06,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757920971] [2020-02-10 19:47:06,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:06,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:47:06,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428078402] [2020-02-10 19:47:06,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:47:06,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:06,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:47:06,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:06,565 INFO L87 Difference]: Start difference. First operand 1577 states and 7047 transitions. Second operand 11 states. [2020-02-10 19:47:06,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:06,838 INFO L93 Difference]: Finished difference Result 2955 states and 11716 transitions. [2020-02-10 19:47:06,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:47:06,839 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:47:06,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:06,846 INFO L225 Difference]: With dead ends: 2955 [2020-02-10 19:47:06,847 INFO L226 Difference]: Without dead ends: 2925 [2020-02-10 19:47:06,847 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:47:06,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2925 states. [2020-02-10 19:47:06,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2925 to 1561. [2020-02-10 19:47:06,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1561 states. [2020-02-10 19:47:06,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 7014 transitions. [2020-02-10 19:47:06,914 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 7014 transitions. Word has length 28 [2020-02-10 19:47:06,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:06,914 INFO L479 AbstractCegarLoop]: Abstraction has 1561 states and 7014 transitions. [2020-02-10 19:47:06,914 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:47:06,914 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 7014 transitions. [2020-02-10 19:47:06,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:47:06,917 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:06,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] [2020-02-10 19:47:06,917 INFO L427 AbstractCegarLoop]: === Iteration 225 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:06,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:06,917 INFO L82 PathProgramCache]: Analyzing trace with hash 68637930, now seen corresponding path program 217 times [2020-02-10 19:47:06,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:06,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278483087] [2020-02-10 19:47:06,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:06,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:07,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 19:47:07,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278483087] [2020-02-10 19:47:07,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:07,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:47:07,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796103258] [2020-02-10 19:47:07,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:47:07,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:07,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:47:07,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:07,450 INFO L87 Difference]: Start difference. First operand 1561 states and 7014 transitions. Second operand 11 states. [2020-02-10 19:47:07,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:07,646 INFO L93 Difference]: Finished difference Result 2976 states and 11795 transitions. [2020-02-10 19:47:07,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:47:07,647 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:47:07,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:07,655 INFO L225 Difference]: With dead ends: 2976 [2020-02-10 19:47:07,655 INFO L226 Difference]: Without dead ends: 2960 [2020-02-10 19:47:07,655 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:47:07,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2960 states. [2020-02-10 19:47:07,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2960 to 1582. [2020-02-10 19:47:07,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2020-02-10 19:47:07,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 7081 transitions. [2020-02-10 19:47:07,725 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 7081 transitions. Word has length 28 [2020-02-10 19:47:07,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:07,725 INFO L479 AbstractCegarLoop]: Abstraction has 1582 states and 7081 transitions. [2020-02-10 19:47:07,725 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:47:07,725 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 7081 transitions. [2020-02-10 19:47:07,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:47:07,727 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:07,727 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:07,727 INFO L427 AbstractCegarLoop]: === Iteration 226 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:07,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:07,728 INFO L82 PathProgramCache]: Analyzing trace with hash 813340428, now seen corresponding path program 218 times [2020-02-10 19:47:07,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:07,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912372107] [2020-02-10 19:47:07,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:07,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:08,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:08,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912372107] [2020-02-10 19:47:08,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:08,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:47:08,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998179716] [2020-02-10 19:47:08,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:47:08,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:08,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:47:08,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:08,274 INFO L87 Difference]: Start difference. First operand 1582 states and 7081 transitions. Second operand 11 states. [2020-02-10 19:47:08,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:08,408 INFO L93 Difference]: Finished difference Result 2980 states and 11796 transitions. [2020-02-10 19:47:08,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:47:08,408 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:47:08,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:08,416 INFO L225 Difference]: With dead ends: 2980 [2020-02-10 19:47:08,416 INFO L226 Difference]: Without dead ends: 2953 [2020-02-10 19:47:08,416 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:47:08,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2953 states. [2020-02-10 19:47:08,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2953 to 1575. [2020-02-10 19:47:08,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 19:47:08,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7061 transitions. [2020-02-10 19:47:08,485 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7061 transitions. Word has length 28 [2020-02-10 19:47:08,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:08,485 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7061 transitions. [2020-02-10 19:47:08,485 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:47:08,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7061 transitions. [2020-02-10 19:47:08,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:47:08,487 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:08,487 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:08,487 INFO L427 AbstractCegarLoop]: === Iteration 227 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:08,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:08,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1679578888, now seen corresponding path program 219 times [2020-02-10 19:47:08,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:08,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762490646] [2020-02-10 19:47:08,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:08,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:09,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:09,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762490646] [2020-02-10 19:47:09,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:09,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:47:09,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946127796] [2020-02-10 19:47:09,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:47:09,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:09,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:47:09,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:09,020 INFO L87 Difference]: Start difference. First operand 1575 states and 7061 transitions. Second operand 11 states. [2020-02-10 19:47:09,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:09,217 INFO L93 Difference]: Finished difference Result 2973 states and 11783 transitions. [2020-02-10 19:47:09,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:47:09,218 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:47:09,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:09,226 INFO L225 Difference]: With dead ends: 2973 [2020-02-10 19:47:09,226 INFO L226 Difference]: Without dead ends: 2957 [2020-02-10 19:47:09,226 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:47:09,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2957 states. [2020-02-10 19:47:09,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2957 to 1581. [2020-02-10 19:47:09,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 19:47:09,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7072 transitions. [2020-02-10 19:47:09,295 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7072 transitions. Word has length 28 [2020-02-10 19:47:09,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:09,295 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7072 transitions. [2020-02-10 19:47:09,295 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:47:09,295 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7072 transitions. [2020-02-10 19:47:09,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:47:09,298 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:09,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] [2020-02-10 19:47:09,298 INFO L427 AbstractCegarLoop]: === Iteration 228 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:09,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:09,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1125983412, now seen corresponding path program 220 times [2020-02-10 19:47:09,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:09,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321406713] [2020-02-10 19:47:09,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:09,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:09,820 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 19:47:09,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 19:47:09,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321406713] [2020-02-10 19:47:09,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:09,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:47:09,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956494970] [2020-02-10 19:47:09,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:47:09,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:09,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:47:09,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:09,829 INFO L87 Difference]: Start difference. First operand 1581 states and 7072 transitions. Second operand 11 states. [2020-02-10 19:47:10,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:10,002 INFO L93 Difference]: Finished difference Result 2975 states and 11781 transitions. [2020-02-10 19:47:10,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:47:10,002 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:47:10,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:10,009 INFO L225 Difference]: With dead ends: 2975 [2020-02-10 19:47:10,010 INFO L226 Difference]: Without dead ends: 2951 [2020-02-10 19:47:10,010 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:47:10,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2020-02-10 19:47:10,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 1575. [2020-02-10 19:47:10,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 19:47:10,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7055 transitions. [2020-02-10 19:47:10,099 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7055 transitions. Word has length 28 [2020-02-10 19:47:10,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:10,099 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7055 transitions. [2020-02-10 19:47:10,099 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:47:10,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7055 transitions. [2020-02-10 19:47:10,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:47:10,101 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:10,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] [2020-02-10 19:47:10,101 INFO L427 AbstractCegarLoop]: === Iteration 229 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:10,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:10,102 INFO L82 PathProgramCache]: Analyzing trace with hash -259744952, now seen corresponding path program 221 times [2020-02-10 19:47:10,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:10,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013107649] [2020-02-10 19:47:10,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:10,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:10,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:10,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013107649] [2020-02-10 19:47:10,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:10,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:47:10,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075890418] [2020-02-10 19:47:10,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:47:10,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:10,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:47:10,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:10,647 INFO L87 Difference]: Start difference. First operand 1575 states and 7055 transitions. Second operand 11 states. [2020-02-10 19:47:10,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:10,781 INFO L93 Difference]: Finished difference Result 2985 states and 11800 transitions. [2020-02-10 19:47:10,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:47:10,781 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:47:10,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:10,789 INFO L225 Difference]: With dead ends: 2985 [2020-02-10 19:47:10,789 INFO L226 Difference]: Without dead ends: 2965 [2020-02-10 19:47:10,789 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:47:10,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2965 states. [2020-02-10 19:47:10,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2965 to 1585. [2020-02-10 19:47:10,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1585 states. [2020-02-10 19:47:10,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 7072 transitions. [2020-02-10 19:47:10,856 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 7072 transitions. Word has length 28 [2020-02-10 19:47:10,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:10,856 INFO L479 AbstractCegarLoop]: Abstraction has 1585 states and 7072 transitions. [2020-02-10 19:47:10,856 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:47:10,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 7072 transitions. [2020-02-10 19:47:10,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:47:10,859 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:10,859 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:10,859 INFO L427 AbstractCegarLoop]: === Iteration 230 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:10,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:10,859 INFO L82 PathProgramCache]: Analyzing trace with hash 484957546, now seen corresponding path program 222 times [2020-02-10 19:47:10,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:10,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470734927] [2020-02-10 19:47:10,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:10,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:11,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 19:47:11,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470734927] [2020-02-10 19:47:11,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:11,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:47:11,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200726234] [2020-02-10 19:47:11,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:47:11,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:11,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:47:11,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:11,395 INFO L87 Difference]: Start difference. First operand 1585 states and 7072 transitions. Second operand 11 states. [2020-02-10 19:47:11,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:11,562 INFO L93 Difference]: Finished difference Result 2983 states and 11788 transitions. [2020-02-10 19:47:11,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:47:11,563 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:47:11,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:11,570 INFO L225 Difference]: With dead ends: 2983 [2020-02-10 19:47:11,571 INFO L226 Difference]: Without dead ends: 2947 [2020-02-10 19:47:11,571 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:47:11,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2947 states. [2020-02-10 19:47:11,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2947 to 1567. [2020-02-10 19:47:11,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 19:47:11,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7034 transitions. [2020-02-10 19:47:11,638 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7034 transitions. Word has length 28 [2020-02-10 19:47:11,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:11,638 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7034 transitions. [2020-02-10 19:47:11,638 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:47:11,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7034 transitions. [2020-02-10 19:47:11,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:47:11,640 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:11,640 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:11,640 INFO L427 AbstractCegarLoop]: === Iteration 231 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:11,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:11,641 INFO L82 PathProgramCache]: Analyzing trace with hash -437708336, now seen corresponding path program 223 times [2020-02-10 19:47:11,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:11,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809977361] [2020-02-10 19:47:11,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:11,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:12,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 19:47:12,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809977361] [2020-02-10 19:47:12,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:12,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:47:12,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558588191] [2020-02-10 19:47:12,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:47:12,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:12,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:47:12,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:12,168 INFO L87 Difference]: Start difference. First operand 1567 states and 7034 transitions. Second operand 11 states. [2020-02-10 19:47:12,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:12,362 INFO L93 Difference]: Finished difference Result 2962 states and 11752 transitions. [2020-02-10 19:47:12,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:47:12,362 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:47:12,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:12,370 INFO L225 Difference]: With dead ends: 2962 [2020-02-10 19:47:12,370 INFO L226 Difference]: Without dead ends: 2946 [2020-02-10 19:47:12,370 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:47:12,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2946 states. [2020-02-10 19:47:12,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2946 to 1579. [2020-02-10 19:47:12,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 19:47:12,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7065 transitions. [2020-02-10 19:47:12,438 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7065 transitions. Word has length 28 [2020-02-10 19:47:12,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:12,438 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7065 transitions. [2020-02-10 19:47:12,438 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:47:12,438 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7065 transitions. [2020-02-10 19:47:12,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:47:12,440 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:12,440 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:12,440 INFO L427 AbstractCegarLoop]: === Iteration 232 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:12,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:12,442 INFO L82 PathProgramCache]: Analyzing trace with hash 306994162, now seen corresponding path program 224 times [2020-02-10 19:47:12,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:12,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594334981] [2020-02-10 19:47:12,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:12,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:12,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:12,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594334981] [2020-02-10 19:47:12,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:12,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:47:12,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698334751] [2020-02-10 19:47:12,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:47:12,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:12,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:47:12,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:12,978 INFO L87 Difference]: Start difference. First operand 1579 states and 7065 transitions. Second operand 11 states. [2020-02-10 19:47:13,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:13,116 INFO L93 Difference]: Finished difference Result 2966 states and 11753 transitions. [2020-02-10 19:47:13,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:47:13,116 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:47:13,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:13,123 INFO L225 Difference]: With dead ends: 2966 [2020-02-10 19:47:13,124 INFO L226 Difference]: Without dead ends: 2939 [2020-02-10 19:47:13,124 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:47:13,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2939 states. [2020-02-10 19:47:13,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2939 to 1572. [2020-02-10 19:47:13,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 19:47:13,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7047 transitions. [2020-02-10 19:47:13,191 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7047 transitions. Word has length 28 [2020-02-10 19:47:13,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:13,191 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7047 transitions. [2020-02-10 19:47:13,191 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:47:13,191 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7047 transitions. [2020-02-10 19:47:13,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:47:13,194 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:13,194 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:13,194 INFO L427 AbstractCegarLoop]: === Iteration 233 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:13,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:13,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1711088200, now seen corresponding path program 225 times [2020-02-10 19:47:13,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:13,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58563756] [2020-02-10 19:47:13,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:13,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:13,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:13,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58563756] [2020-02-10 19:47:13,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:13,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:47:13,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069502405] [2020-02-10 19:47:13,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:47:13,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:13,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:47:13,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:13,725 INFO L87 Difference]: Start difference. First operand 1572 states and 7047 transitions. Second operand 11 states. [2020-02-10 19:47:13,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:13,924 INFO L93 Difference]: Finished difference Result 2953 states and 11728 transitions. [2020-02-10 19:47:13,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:47:13,924 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:47:13,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:13,932 INFO L225 Difference]: With dead ends: 2953 [2020-02-10 19:47:13,932 INFO L226 Difference]: Without dead ends: 2937 [2020-02-10 19:47:13,932 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:47:13,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2937 states. [2020-02-10 19:47:13,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2937 to 1576. [2020-02-10 19:47:13,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 19:47:13,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7054 transitions. [2020-02-10 19:47:13,999 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7054 transitions. Word has length 28 [2020-02-10 19:47:13,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:13,999 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7054 transitions. [2020-02-10 19:47:14,000 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:47:14,000 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7054 transitions. [2020-02-10 19:47:14,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:47:14,002 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:14,002 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:14,002 INFO L427 AbstractCegarLoop]: === Iteration 234 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:14,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:14,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1139633394, now seen corresponding path program 226 times [2020-02-10 19:47:14,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:14,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102085368] [2020-02-10 19:47:14,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:14,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:14,456 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 30 [2020-02-10 19:47:14,613 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 19:47:14,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:14,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102085368] [2020-02-10 19:47:14,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:14,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:47:14,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933913219] [2020-02-10 19:47:14,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:47:14,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:14,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:47:14,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:14,625 INFO L87 Difference]: Start difference. First operand 1576 states and 7054 transitions. Second operand 11 states. [2020-02-10 19:47:14,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:14,809 INFO L93 Difference]: Finished difference Result 2951 states and 11720 transitions. [2020-02-10 19:47:14,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:47:14,809 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:47:14,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:14,817 INFO L225 Difference]: With dead ends: 2951 [2020-02-10 19:47:14,817 INFO L226 Difference]: Without dead ends: 2933 [2020-02-10 19:47:14,817 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:47:14,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2933 states. [2020-02-10 19:47:14,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2933 to 1572. [2020-02-10 19:47:14,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 19:47:14,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7043 transitions. [2020-02-10 19:47:14,890 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7043 transitions. Word has length 28 [2020-02-10 19:47:14,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:14,890 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7043 transitions. [2020-02-10 19:47:14,890 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:47:14,890 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7043 transitions. [2020-02-10 19:47:14,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:47:14,893 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:14,893 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:14,893 INFO L427 AbstractCegarLoop]: === Iteration 235 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:14,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:14,893 INFO L82 PathProgramCache]: Analyzing trace with hash -228235640, now seen corresponding path program 227 times [2020-02-10 19:47:14,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:14,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758533364] [2020-02-10 19:47:14,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:14,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:15,440 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 19:47:15,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 19:47:15,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758533364] [2020-02-10 19:47:15,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:15,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:47:15,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315854842] [2020-02-10 19:47:15,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:47:15,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:15,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:47:15,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:15,449 INFO L87 Difference]: Start difference. First operand 1572 states and 7043 transitions. Second operand 11 states. [2020-02-10 19:47:15,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:15,615 INFO L93 Difference]: Finished difference Result 2962 states and 11740 transitions. [2020-02-10 19:47:15,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:47:15,616 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:47:15,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:15,623 INFO L225 Difference]: With dead ends: 2962 [2020-02-10 19:47:15,623 INFO L226 Difference]: Without dead ends: 2942 [2020-02-10 19:47:15,624 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:47:15,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2942 states. [2020-02-10 19:47:15,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2942 to 1577. [2020-02-10 19:47:15,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 19:47:15,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7051 transitions. [2020-02-10 19:47:15,691 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7051 transitions. Word has length 28 [2020-02-10 19:47:15,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:15,691 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7051 transitions. [2020-02-10 19:47:15,691 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:47:15,692 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7051 transitions. [2020-02-10 19:47:15,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:47:15,694 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:15,694 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:15,694 INFO L427 AbstractCegarLoop]: === Iteration 236 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:15,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:15,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1544392944, now seen corresponding path program 228 times [2020-02-10 19:47:15,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:15,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966660365] [2020-02-10 19:47:15,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:15,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:16,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 19:47:16,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966660365] [2020-02-10 19:47:16,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:16,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:47:16,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628222797] [2020-02-10 19:47:16,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:47:16,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:16,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:47:16,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:16,207 INFO L87 Difference]: Start difference. First operand 1577 states and 7051 transitions. Second operand 11 states. [2020-02-10 19:47:16,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:16,396 INFO L93 Difference]: Finished difference Result 2956 states and 11724 transitions. [2020-02-10 19:47:16,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:47:16,397 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:47:16,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:16,404 INFO L225 Difference]: With dead ends: 2956 [2020-02-10 19:47:16,404 INFO L226 Difference]: Without dead ends: 2932 [2020-02-10 19:47:16,405 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:47:16,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2932 states. [2020-02-10 19:47:16,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2932 to 1567. [2020-02-10 19:47:16,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 19:47:16,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7029 transitions. [2020-02-10 19:47:16,471 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7029 transitions. Word has length 28 [2020-02-10 19:47:16,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:16,471 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7029 transitions. [2020-02-10 19:47:16,471 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:47:16,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7029 transitions. [2020-02-10 19:47:16,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:47:16,474 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:16,474 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:16,474 INFO L427 AbstractCegarLoop]: === Iteration 237 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:16,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:16,474 INFO L82 PathProgramCache]: Analyzing trace with hash -427205232, now seen corresponding path program 229 times [2020-02-10 19:47:16,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:16,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285964594] [2020-02-10 19:47:16,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:16,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:16,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 19:47:16,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285964594] [2020-02-10 19:47:16,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:16,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:47:16,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734505020] [2020-02-10 19:47:16,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:47:16,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:16,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:47:16,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:16,990 INFO L87 Difference]: Start difference. First operand 1567 states and 7029 transitions. Second operand 11 states. [2020-02-10 19:47:17,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:17,171 INFO L93 Difference]: Finished difference Result 2954 states and 11732 transitions. [2020-02-10 19:47:17,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:47:17,172 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:47:17,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:17,179 INFO L225 Difference]: With dead ends: 2954 [2020-02-10 19:47:17,180 INFO L226 Difference]: Without dead ends: 2938 [2020-02-10 19:47:17,180 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:47:17,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2938 states. [2020-02-10 19:47:17,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2938 to 1577. [2020-02-10 19:47:17,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 19:47:17,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7055 transitions. [2020-02-10 19:47:17,247 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7055 transitions. Word has length 28 [2020-02-10 19:47:17,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:17,247 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7055 transitions. [2020-02-10 19:47:17,247 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:47:17,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7055 transitions. [2020-02-10 19:47:17,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:47:17,249 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:17,250 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:17,250 INFO L427 AbstractCegarLoop]: === Iteration 238 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:17,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:17,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1062199764, now seen corresponding path program 230 times [2020-02-10 19:47:17,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:17,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799046987] [2020-02-10 19:47:17,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:17,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:17,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:17,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799046987] [2020-02-10 19:47:17,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:17,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:47:17,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814896639] [2020-02-10 19:47:17,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:47:17,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:17,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:47:17,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:17,773 INFO L87 Difference]: Start difference. First operand 1577 states and 7055 transitions. Second operand 11 states. [2020-02-10 19:47:17,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:17,971 INFO L93 Difference]: Finished difference Result 2956 states and 11730 transitions. [2020-02-10 19:47:17,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:47:17,971 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:47:17,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:17,978 INFO L225 Difference]: With dead ends: 2956 [2020-02-10 19:47:17,978 INFO L226 Difference]: Without dead ends: 2932 [2020-02-10 19:47:17,978 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:47:18,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2932 states. [2020-02-10 19:47:18,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2932 to 1571. [2020-02-10 19:47:18,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 19:47:18,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7040 transitions. [2020-02-10 19:47:18,046 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7040 transitions. Word has length 28 [2020-02-10 19:47:18,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:18,046 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7040 transitions. [2020-02-10 19:47:18,046 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:47:18,046 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7040 transitions. [2020-02-10 19:47:18,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:47:18,049 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:18,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] [2020-02-10 19:47:18,049 INFO L427 AbstractCegarLoop]: === Iteration 239 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:18,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:18,049 INFO L82 PathProgramCache]: Analyzing trace with hash 110650346, now seen corresponding path program 231 times [2020-02-10 19:47:18,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:18,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168300671] [2020-02-10 19:47:18,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:18,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:18,588 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 19:47:18,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 19:47:18,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168300671] [2020-02-10 19:47:18,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:18,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:47:18,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255939586] [2020-02-10 19:47:18,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:47:18,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:18,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:47:18,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:18,597 INFO L87 Difference]: Start difference. First operand 1571 states and 7040 transitions. Second operand 11 states. [2020-02-10 19:47:18,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:18,805 INFO L93 Difference]: Finished difference Result 2948 states and 11714 transitions. [2020-02-10 19:47:18,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:47:18,805 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:47:18,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:18,812 INFO L225 Difference]: With dead ends: 2948 [2020-02-10 19:47:18,812 INFO L226 Difference]: Without dead ends: 2932 [2020-02-10 19:47:18,812 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:47:18,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2932 states. [2020-02-10 19:47:18,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2932 to 1575. [2020-02-10 19:47:18,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 19:47:18,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7047 transitions. [2020-02-10 19:47:18,880 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7047 transitions. Word has length 28 [2020-02-10 19:47:18,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:18,880 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7047 transitions. [2020-02-10 19:47:18,880 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:47:18,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7047 transitions. [2020-02-10 19:47:18,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:47:18,882 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:18,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] [2020-02-10 19:47:18,883 INFO L427 AbstractCegarLoop]: === Iteration 240 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:18,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:18,883 INFO L82 PathProgramCache]: Analyzing trace with hash -460804460, now seen corresponding path program 232 times [2020-02-10 19:47:18,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:18,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980587709] [2020-02-10 19:47:18,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:18,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:19,401 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 19:47:19,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:19,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980587709] [2020-02-10 19:47:19,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:19,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:47:19,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068238653] [2020-02-10 19:47:19,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:47:19,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:19,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:47:19,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:19,409 INFO L87 Difference]: Start difference. First operand 1575 states and 7047 transitions. Second operand 11 states. [2020-02-10 19:47:19,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:19,635 INFO L93 Difference]: Finished difference Result 2946 states and 11706 transitions. [2020-02-10 19:47:19,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:47:19,635 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:47:19,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:19,642 INFO L225 Difference]: With dead ends: 2946 [2020-02-10 19:47:19,643 INFO L226 Difference]: Without dead ends: 2928 [2020-02-10 19:47:19,643 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:47:19,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2928 states. [2020-02-10 19:47:19,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2928 to 1571. [2020-02-10 19:47:19,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 19:47:19,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7036 transitions. [2020-02-10 19:47:19,710 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7036 transitions. Word has length 28 [2020-02-10 19:47:19,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:19,710 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7036 transitions. [2020-02-10 19:47:19,710 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:47:19,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7036 transitions. [2020-02-10 19:47:19,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:47:19,712 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:19,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] [2020-02-10 19:47:19,713 INFO L427 AbstractCegarLoop]: === Iteration 241 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:19,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:19,713 INFO L82 PathProgramCache]: Analyzing trace with hash 526969962, now seen corresponding path program 233 times [2020-02-10 19:47:19,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:19,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216787929] [2020-02-10 19:47:19,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:19,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:20,144 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 31 [2020-02-10 19:47:20,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:20,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216787929] [2020-02-10 19:47:20,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:20,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:47:20,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606794786] [2020-02-10 19:47:20,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:47:20,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:20,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:47:20,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:20,267 INFO L87 Difference]: Start difference. First operand 1571 states and 7036 transitions. Second operand 11 states. [2020-02-10 19:47:20,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:20,445 INFO L93 Difference]: Finished difference Result 2952 states and 11718 transitions. [2020-02-10 19:47:20,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:47:20,446 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:47:20,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:20,453 INFO L225 Difference]: With dead ends: 2952 [2020-02-10 19:47:20,453 INFO L226 Difference]: Without dead ends: 2934 [2020-02-10 19:47:20,453 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:47:20,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2934 states. [2020-02-10 19:47:20,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2934 to 1575. [2020-02-10 19:47:20,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 19:47:20,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7043 transitions. [2020-02-10 19:47:20,521 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7043 transitions. Word has length 28 [2020-02-10 19:47:20,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:20,521 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7043 transitions. [2020-02-10 19:47:20,521 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:47:20,521 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7043 transitions. [2020-02-10 19:47:20,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:47:20,524 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:20,524 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:20,524 INFO L427 AbstractCegarLoop]: === Iteration 242 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:20,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:20,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1533889840, now seen corresponding path program 234 times [2020-02-10 19:47:20,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:20,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129581608] [2020-02-10 19:47:20,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:20,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:21,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:21,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129581608] [2020-02-10 19:47:21,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:21,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:47:21,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357694299] [2020-02-10 19:47:21,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:47:21,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:21,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:47:21,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:21,043 INFO L87 Difference]: Start difference. First operand 1575 states and 7043 transitions. Second operand 11 states. [2020-02-10 19:47:21,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:21,222 INFO L93 Difference]: Finished difference Result 2948 states and 11706 transitions. [2020-02-10 19:47:21,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:47:21,223 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:47:21,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:21,230 INFO L225 Difference]: With dead ends: 2948 [2020-02-10 19:47:21,230 INFO L226 Difference]: Without dead ends: 2926 [2020-02-10 19:47:21,230 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:47:21,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2926 states. [2020-02-10 19:47:21,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2926 to 1567. [2020-02-10 19:47:21,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 19:47:21,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7025 transitions. [2020-02-10 19:47:21,298 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7025 transitions. Word has length 28 [2020-02-10 19:47:21,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:21,298 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7025 transitions. [2020-02-10 19:47:21,298 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:47:21,298 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7025 transitions. [2020-02-10 19:47:21,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:47:21,300 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:21,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] [2020-02-10 19:47:21,300 INFO L427 AbstractCegarLoop]: === Iteration 243 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:21,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:21,301 INFO L82 PathProgramCache]: Analyzing trace with hash 328000370, now seen corresponding path program 235 times [2020-02-10 19:47:21,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:21,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72328536] [2020-02-10 19:47:21,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:21,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:21,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 19:47:21,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72328536] [2020-02-10 19:47:21,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:21,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:47:21,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748561572] [2020-02-10 19:47:21,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:47:21,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:21,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:47:21,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:21,849 INFO L87 Difference]: Start difference. First operand 1567 states and 7025 transitions. Second operand 11 states. [2020-02-10 19:47:21,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:21,991 INFO L93 Difference]: Finished difference Result 2977 states and 11774 transitions. [2020-02-10 19:47:21,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:47:21,992 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:47:21,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:21,998 INFO L225 Difference]: With dead ends: 2977 [2020-02-10 19:47:21,998 INFO L226 Difference]: Without dead ends: 2957 [2020-02-10 19:47:21,999 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:47:22,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2957 states. [2020-02-10 19:47:22,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2957 to 1583. [2020-02-10 19:47:22,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 19:47:22,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7062 transitions. [2020-02-10 19:47:22,068 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7062 transitions. Word has length 28 [2020-02-10 19:47:22,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:22,068 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7062 transitions. [2020-02-10 19:47:22,068 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:47:22,068 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7062 transitions. [2020-02-10 19:47:22,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:47:22,071 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:22,071 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:22,071 INFO L427 AbstractCegarLoop]: === Iteration 244 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:22,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:22,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1072702868, now seen corresponding path program 236 times [2020-02-10 19:47:22,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:22,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251657825] [2020-02-10 19:47:22,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:22,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:22,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:22,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251657825] [2020-02-10 19:47:22,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:22,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:47:22,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196168516] [2020-02-10 19:47:22,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:47:22,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:22,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:47:22,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:22,613 INFO L87 Difference]: Start difference. First operand 1583 states and 7062 transitions. Second operand 11 states. [2020-02-10 19:47:22,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:22,797 INFO L93 Difference]: Finished difference Result 2975 states and 11762 transitions. [2020-02-10 19:47:22,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:47:22,798 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:47:22,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:22,805 INFO L225 Difference]: With dead ends: 2975 [2020-02-10 19:47:22,805 INFO L226 Difference]: Without dead ends: 2947 [2020-02-10 19:47:22,805 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:47:22,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2947 states. [2020-02-10 19:47:22,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2947 to 1573. [2020-02-10 19:47:22,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 19:47:22,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7039 transitions. [2020-02-10 19:47:22,873 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7039 transitions. Word has length 28 [2020-02-10 19:47:22,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:22,873 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7039 transitions. [2020-02-10 19:47:22,873 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:47:22,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7039 transitions. [2020-02-10 19:47:22,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:47:22,875 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:22,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] [2020-02-10 19:47:22,876 INFO L427 AbstractCegarLoop]: === Iteration 245 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:22,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:22,876 INFO L82 PathProgramCache]: Analyzing trace with hash 865855948, now seen corresponding path program 237 times [2020-02-10 19:47:22,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:22,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135183492] [2020-02-10 19:47:22,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:22,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:23,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 19:47:23,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135183492] [2020-02-10 19:47:23,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:23,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:47:23,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050001007] [2020-02-10 19:47:23,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:47:23,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:23,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:47:23,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:23,403 INFO L87 Difference]: Start difference. First operand 1573 states and 7039 transitions. Second operand 11 states. [2020-02-10 19:47:23,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:23,546 INFO L93 Difference]: Finished difference Result 2968 states and 11747 transitions. [2020-02-10 19:47:23,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:47:23,547 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:47:23,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:23,554 INFO L225 Difference]: With dead ends: 2968 [2020-02-10 19:47:23,555 INFO L226 Difference]: Without dead ends: 2948 [2020-02-10 19:47:23,555 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:47:23,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2948 states. [2020-02-10 19:47:23,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2948 to 1578. [2020-02-10 19:47:23,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 19:47:23,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7047 transitions. [2020-02-10 19:47:23,622 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7047 transitions. Word has length 28 [2020-02-10 19:47:23,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:23,622 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7047 transitions. [2020-02-10 19:47:23,622 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:47:23,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7047 transitions. [2020-02-10 19:47:23,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:47:23,624 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:23,624 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:23,625 INFO L427 AbstractCegarLoop]: === Iteration 246 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:23,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:23,625 INFO L82 PathProgramCache]: Analyzing trace with hash -450301356, now seen corresponding path program 238 times [2020-02-10 19:47:23,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:23,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120534971] [2020-02-10 19:47:23,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:23,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:24,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:24,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120534971] [2020-02-10 19:47:24,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:24,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:47:24,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378363360] [2020-02-10 19:47:24,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:47:24,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:24,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:47:24,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:24,160 INFO L87 Difference]: Start difference. First operand 1578 states and 7047 transitions. Second operand 11 states. [2020-02-10 19:47:24,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:24,364 INFO L93 Difference]: Finished difference Result 2962 states and 11731 transitions. [2020-02-10 19:47:24,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:47:24,364 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:47:24,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:24,372 INFO L225 Difference]: With dead ends: 2962 [2020-02-10 19:47:24,372 INFO L226 Difference]: Without dead ends: 2943 [2020-02-10 19:47:24,372 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:47:24,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2943 states. [2020-02-10 19:47:24,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2943 to 1573. [2020-02-10 19:47:24,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 19:47:24,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7034 transitions. [2020-02-10 19:47:24,439 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7034 transitions. Word has length 28 [2020-02-10 19:47:24,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:24,439 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7034 transitions. [2020-02-10 19:47:24,439 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:47:24,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7034 transitions. [2020-02-10 19:47:24,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:47:24,442 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:24,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] [2020-02-10 19:47:24,442 INFO L427 AbstractCegarLoop]: === Iteration 247 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:24,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:24,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1073467892, now seen corresponding path program 239 times [2020-02-10 19:47:24,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:24,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010390065] [2020-02-10 19:47:24,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:24,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:24,971 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 19:47:24,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:24,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010390065] [2020-02-10 19:47:24,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:24,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:47:24,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650480513] [2020-02-10 19:47:24,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:47:24,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:24,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:47:24,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:24,980 INFO L87 Difference]: Start difference. First operand 1573 states and 7034 transitions. Second operand 11 states. [2020-02-10 19:47:25,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:25,183 INFO L93 Difference]: Finished difference Result 2963 states and 11734 transitions. [2020-02-10 19:47:25,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:47:25,184 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:47:25,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:25,191 INFO L225 Difference]: With dead ends: 2963 [2020-02-10 19:47:25,192 INFO L226 Difference]: Without dead ends: 2945 [2020-02-10 19:47:25,192 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:47:25,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2945 states. [2020-02-10 19:47:25,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2945 to 1577. [2020-02-10 19:47:25,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 19:47:25,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7041 transitions. [2020-02-10 19:47:25,259 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7041 transitions. Word has length 28 [2020-02-10 19:47:25,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:25,259 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7041 transitions. [2020-02-10 19:47:25,259 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:47:25,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7041 transitions. [2020-02-10 19:47:25,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:47:25,261 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:25,261 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:25,262 INFO L427 AbstractCegarLoop]: === Iteration 248 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:25,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:25,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1160639602, now seen corresponding path program 240 times [2020-02-10 19:47:25,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:25,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736123564] [2020-02-10 19:47:25,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:25,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:25,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 19:47:25,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736123564] [2020-02-10 19:47:25,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:25,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:47:25,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306042286] [2020-02-10 19:47:25,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:47:25,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:25,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:47:25,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:25,806 INFO L87 Difference]: Start difference. First operand 1577 states and 7041 transitions. Second operand 11 states. [2020-02-10 19:47:25,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:25,990 INFO L93 Difference]: Finished difference Result 2959 states and 11722 transitions. [2020-02-10 19:47:25,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:47:25,991 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:47:25,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:25,998 INFO L225 Difference]: With dead ends: 2959 [2020-02-10 19:47:25,998 INFO L226 Difference]: Without dead ends: 2923 [2020-02-10 19:47:25,998 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:47:26,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2923 states. [2020-02-10 19:47:26,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2923 to 1555. [2020-02-10 19:47:26,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1555 states. [2020-02-10 19:47:26,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 6997 transitions. [2020-02-10 19:47:26,066 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 6997 transitions. Word has length 28 [2020-02-10 19:47:26,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:26,066 INFO L479 AbstractCegarLoop]: Abstraction has 1555 states and 6997 transitions. [2020-02-10 19:47:26,066 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:47:26,066 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 6997 transitions. [2020-02-10 19:47:26,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:47:26,068 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:26,068 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:26,069 INFO L427 AbstractCegarLoop]: === Iteration 249 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:26,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:26,069 INFO L82 PathProgramCache]: Analyzing trace with hash 424017834, now seen corresponding path program 241 times [2020-02-10 19:47:26,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:26,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554700517] [2020-02-10 19:47:26,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:26,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:26,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:26,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554700517] [2020-02-10 19:47:26,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:26,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:47:26,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538113865] [2020-02-10 19:47:26,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:47:26,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:26,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:47:26,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:26,595 INFO L87 Difference]: Start difference. First operand 1555 states and 6997 transitions. Second operand 11 states. [2020-02-10 19:47:26,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:26,795 INFO L93 Difference]: Finished difference Result 2936 states and 11714 transitions. [2020-02-10 19:47:26,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:47:26,795 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:47:26,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:26,803 INFO L225 Difference]: With dead ends: 2936 [2020-02-10 19:47:26,803 INFO L226 Difference]: Without dead ends: 2921 [2020-02-10 19:47:26,803 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:47:26,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2921 states. [2020-02-10 19:47:26,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2921 to 1576. [2020-02-10 19:47:26,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 19:47:26,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7079 transitions. [2020-02-10 19:47:26,871 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7079 transitions. Word has length 28 [2020-02-10 19:47:26,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:26,871 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7079 transitions. [2020-02-10 19:47:26,871 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:47:26,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7079 transitions. [2020-02-10 19:47:26,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:47:26,874 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:26,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] [2020-02-10 19:47:26,874 INFO L427 AbstractCegarLoop]: === Iteration 250 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:26,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:26,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1168720332, now seen corresponding path program 242 times [2020-02-10 19:47:26,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:26,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943350154] [2020-02-10 19:47:26,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:26,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:27,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:27,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943350154] [2020-02-10 19:47:27,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:27,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:47:27,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380154540] [2020-02-10 19:47:27,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:47:27,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:27,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:47:27,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:27,412 INFO L87 Difference]: Start difference. First operand 1576 states and 7079 transitions. Second operand 11 states. [2020-02-10 19:47:27,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:27,599 INFO L93 Difference]: Finished difference Result 2937 states and 11711 transitions. [2020-02-10 19:47:27,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:47:27,600 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:47:27,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:27,607 INFO L225 Difference]: With dead ends: 2937 [2020-02-10 19:47:27,607 INFO L226 Difference]: Without dead ends: 2916 [2020-02-10 19:47:27,608 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:47:27,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2916 states. [2020-02-10 19:47:27,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2916 to 1571. [2020-02-10 19:47:27,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 19:47:27,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7065 transitions. [2020-02-10 19:47:27,675 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7065 transitions. Word has length 28 [2020-02-10 19:47:27,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:27,675 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7065 transitions. [2020-02-10 19:47:27,675 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:47:27,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7065 transitions. [2020-02-10 19:47:27,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:47:27,677 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:27,677 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:27,678 INFO L427 AbstractCegarLoop]: === Iteration 251 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:27,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:27,678 INFO L82 PathProgramCache]: Analyzing trace with hash 2034958792, now seen corresponding path program 243 times [2020-02-10 19:47:27,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:27,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248018263] [2020-02-10 19:47:27,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:27,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:28,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:28,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248018263] [2020-02-10 19:47:28,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:28,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:47:28,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417703552] [2020-02-10 19:47:28,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:47:28,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:28,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:47:28,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:28,224 INFO L87 Difference]: Start difference. First operand 1571 states and 7065 transitions. Second operand 11 states. [2020-02-10 19:47:28,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:28,451 INFO L93 Difference]: Finished difference Result 2941 states and 11718 transitions. [2020-02-10 19:47:28,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:47:28,452 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:47:28,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:28,459 INFO L225 Difference]: With dead ends: 2941 [2020-02-10 19:47:28,459 INFO L226 Difference]: Without dead ends: 2926 [2020-02-10 19:47:28,459 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:47:28,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2926 states. [2020-02-10 19:47:28,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2926 to 1577. [2020-02-10 19:47:28,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 19:47:28,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7076 transitions. [2020-02-10 19:47:28,529 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7076 transitions. Word has length 28 [2020-02-10 19:47:28,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:28,529 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7076 transitions. [2020-02-10 19:47:28,529 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:47:28,529 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7076 transitions. [2020-02-10 19:47:28,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:47:28,532 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:28,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] [2020-02-10 19:47:28,532 INFO L427 AbstractCegarLoop]: === Iteration 252 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:28,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:28,532 INFO L82 PathProgramCache]: Analyzing trace with hash -770603508, now seen corresponding path program 244 times [2020-02-10 19:47:28,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:28,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456673265] [2020-02-10 19:47:28,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:28,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:29,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:29,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456673265] [2020-02-10 19:47:29,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:29,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:47:29,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735875682] [2020-02-10 19:47:29,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:47:29,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:29,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:47:29,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:29,066 INFO L87 Difference]: Start difference. First operand 1577 states and 7076 transitions. Second operand 11 states. [2020-02-10 19:47:29,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:29,213 INFO L93 Difference]: Finished difference Result 2946 states and 11722 transitions. [2020-02-10 19:47:29,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:47:29,214 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:47:29,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:29,221 INFO L225 Difference]: With dead ends: 2946 [2020-02-10 19:47:29,221 INFO L226 Difference]: Without dead ends: 2920 [2020-02-10 19:47:29,222 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:47:29,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2920 states. [2020-02-10 19:47:29,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2920 to 1571. [2020-02-10 19:47:29,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 19:47:29,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7059 transitions. [2020-02-10 19:47:29,290 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7059 transitions. Word has length 28 [2020-02-10 19:47:29,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:29,290 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7059 transitions. [2020-02-10 19:47:29,290 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:47:29,291 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7059 transitions. [2020-02-10 19:47:29,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:47:29,293 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:29,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] [2020-02-10 19:47:29,293 INFO L427 AbstractCegarLoop]: === Iteration 253 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:29,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:29,293 INFO L82 PathProgramCache]: Analyzing trace with hash 95634952, now seen corresponding path program 245 times [2020-02-10 19:47:29,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:29,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649913747] [2020-02-10 19:47:29,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:29,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:29,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 19:47:29,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649913747] [2020-02-10 19:47:29,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:29,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:47:29,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747192276] [2020-02-10 19:47:29,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:47:29,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:29,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:47:29,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:29,830 INFO L87 Difference]: Start difference. First operand 1571 states and 7059 transitions. Second operand 11 states. [2020-02-10 19:47:30,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:30,041 INFO L93 Difference]: Finished difference Result 2944 states and 11719 transitions. [2020-02-10 19:47:30,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:47:30,041 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:47:30,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:30,048 INFO L225 Difference]: With dead ends: 2944 [2020-02-10 19:47:30,048 INFO L226 Difference]: Without dead ends: 2928 [2020-02-10 19:47:30,048 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:47:30,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2928 states. [2020-02-10 19:47:30,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2928 to 1578. [2020-02-10 19:47:30,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 19:47:30,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7072 transitions. [2020-02-10 19:47:30,138 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7072 transitions. Word has length 28 [2020-02-10 19:47:30,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:30,138 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7072 transitions. [2020-02-10 19:47:30,138 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:47:30,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7072 transitions. [2020-02-10 19:47:30,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:47:30,141 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:30,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] [2020-02-10 19:47:30,141 INFO L427 AbstractCegarLoop]: === Iteration 254 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:30,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:30,141 INFO L82 PathProgramCache]: Analyzing trace with hash 840337450, now seen corresponding path program 246 times [2020-02-10 19:47:30,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:30,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86457553] [2020-02-10 19:47:30,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:30,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:30,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 19:47:30,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86457553] [2020-02-10 19:47:30,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:30,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:47:30,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440746367] [2020-02-10 19:47:30,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:47:30,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:30,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:47:30,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:30,673 INFO L87 Difference]: Start difference. First operand 1578 states and 7072 transitions. Second operand 11 states. [2020-02-10 19:47:30,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:30,836 INFO L93 Difference]: Finished difference Result 2948 states and 11720 transitions. [2020-02-10 19:47:30,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:47:30,836 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:47:30,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:30,844 INFO L225 Difference]: With dead ends: 2948 [2020-02-10 19:47:30,844 INFO L226 Difference]: Without dead ends: 2915 [2020-02-10 19:47:30,844 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:47:30,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2915 states. [2020-02-10 19:47:30,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2915 to 1565. [2020-02-10 19:47:30,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1565 states. [2020-02-10 19:47:30,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 7043 transitions. [2020-02-10 19:47:30,912 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 7043 transitions. Word has length 28 [2020-02-10 19:47:30,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:30,912 INFO L479 AbstractCegarLoop]: Abstraction has 1565 states and 7043 transitions. [2020-02-10 19:47:30,912 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:47:30,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 7043 transitions. [2020-02-10 19:47:30,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:47:30,914 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:30,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] [2020-02-10 19:47:30,914 INFO L427 AbstractCegarLoop]: === Iteration 255 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:30,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:30,915 INFO L82 PathProgramCache]: Analyzing trace with hash 216894948, now seen corresponding path program 247 times [2020-02-10 19:47:30,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:30,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955377297] [2020-02-10 19:47:30,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:30,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:31,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:31,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955377297] [2020-02-10 19:47:31,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:31,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:47:31,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656025357] [2020-02-10 19:47:31,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:47:31,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:31,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:47:31,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:31,456 INFO L87 Difference]: Start difference. First operand 1565 states and 7043 transitions. Second operand 11 states. [2020-02-10 19:47:31,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:31,640 INFO L93 Difference]: Finished difference Result 2923 states and 11678 transitions. [2020-02-10 19:47:31,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:47:31,640 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:47:31,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:31,648 INFO L225 Difference]: With dead ends: 2923 [2020-02-10 19:47:31,648 INFO L226 Difference]: Without dead ends: 2908 [2020-02-10 19:47:31,648 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:47:31,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2908 states. [2020-02-10 19:47:31,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2908 to 1574. [2020-02-10 19:47:31,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 19:47:31,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7067 transitions. [2020-02-10 19:47:31,715 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7067 transitions. Word has length 28 [2020-02-10 19:47:31,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:31,715 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7067 transitions. [2020-02-10 19:47:31,715 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:47:31,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7067 transitions. [2020-02-10 19:47:31,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:47:31,719 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:31,719 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:31,719 INFO L427 AbstractCegarLoop]: === Iteration 256 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:31,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:31,720 INFO L82 PathProgramCache]: Analyzing trace with hash 961597446, now seen corresponding path program 248 times [2020-02-10 19:47:31,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:31,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286297328] [2020-02-10 19:47:31,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:31,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:32,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:32,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286297328] [2020-02-10 19:47:32,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:32,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:47:32,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498605031] [2020-02-10 19:47:32,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:47:32,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:32,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:47:32,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:32,260 INFO L87 Difference]: Start difference. First operand 1574 states and 7067 transitions. Second operand 11 states. [2020-02-10 19:47:32,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:32,471 INFO L93 Difference]: Finished difference Result 2924 states and 11675 transitions. [2020-02-10 19:47:32,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:47:32,473 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:47:32,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:32,481 INFO L225 Difference]: With dead ends: 2924 [2020-02-10 19:47:32,481 INFO L226 Difference]: Without dead ends: 2903 [2020-02-10 19:47:32,482 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:47:32,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2903 states. [2020-02-10 19:47:32,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2903 to 1569. [2020-02-10 19:47:32,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 19:47:32,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7054 transitions. [2020-02-10 19:47:32,562 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7054 transitions. Word has length 28 [2020-02-10 19:47:32,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:32,563 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7054 transitions. [2020-02-10 19:47:32,563 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:47:32,563 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7054 transitions. [2020-02-10 19:47:32,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:47:32,566 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:32,566 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:32,566 INFO L427 AbstractCegarLoop]: === Iteration 257 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:32,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:32,566 INFO L82 PathProgramCache]: Analyzing trace with hash -318334854, now seen corresponding path program 249 times [2020-02-10 19:47:32,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:32,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724221116] [2020-02-10 19:47:32,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:32,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:33,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:33,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724221116] [2020-02-10 19:47:33,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:33,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:47:33,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373562566] [2020-02-10 19:47:33,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:47:33,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:33,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:47:33,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:33,100 INFO L87 Difference]: Start difference. First operand 1569 states and 7054 transitions. Second operand 11 states. [2020-02-10 19:47:33,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:33,292 INFO L93 Difference]: Finished difference Result 2920 states and 11667 transitions. [2020-02-10 19:47:33,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:47:33,293 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:47:33,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:33,300 INFO L225 Difference]: With dead ends: 2920 [2020-02-10 19:47:33,301 INFO L226 Difference]: Without dead ends: 2905 [2020-02-10 19:47:33,301 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:47:33,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2905 states. [2020-02-10 19:47:33,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2905 to 1573. [2020-02-10 19:47:33,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 19:47:33,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7061 transitions. [2020-02-10 19:47:33,368 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7061 transitions. Word has length 28 [2020-02-10 19:47:33,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:33,368 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7061 transitions. [2020-02-10 19:47:33,368 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:47:33,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7061 transitions. [2020-02-10 19:47:33,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:47:33,371 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:33,371 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:33,371 INFO L427 AbstractCegarLoop]: === Iteration 258 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:33,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:33,371 INFO L82 PathProgramCache]: Analyzing trace with hash -145087162, now seen corresponding path program 250 times [2020-02-10 19:47:33,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:33,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332132686] [2020-02-10 19:47:33,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:33,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:33,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:33,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332132686] [2020-02-10 19:47:33,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:33,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:47:33,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108649040] [2020-02-10 19:47:33,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:47:33,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:33,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:47:33,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:33,913 INFO L87 Difference]: Start difference. First operand 1573 states and 7061 transitions. Second operand 11 states. [2020-02-10 19:47:34,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:34,106 INFO L93 Difference]: Finished difference Result 2919 states and 11661 transitions. [2020-02-10 19:47:34,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:47:34,107 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:47:34,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:34,114 INFO L225 Difference]: With dead ends: 2919 [2020-02-10 19:47:34,114 INFO L226 Difference]: Without dead ends: 2901 [2020-02-10 19:47:34,114 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:47:34,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2901 states. [2020-02-10 19:47:34,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2901 to 1569. [2020-02-10 19:47:34,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 19:47:34,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7050 transitions. [2020-02-10 19:47:34,183 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7050 transitions. Word has length 28 [2020-02-10 19:47:34,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:34,183 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7050 transitions. [2020-02-10 19:47:34,183 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:47:34,183 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7050 transitions. [2020-02-10 19:47:34,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:47:34,186 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:34,186 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:34,186 INFO L427 AbstractCegarLoop]: === Iteration 259 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:34,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:34,186 INFO L82 PathProgramCache]: Analyzing trace with hash 2037308602, now seen corresponding path program 251 times [2020-02-10 19:47:34,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:34,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189615478] [2020-02-10 19:47:34,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:34,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:34,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 19:47:34,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189615478] [2020-02-10 19:47:34,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:34,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:47:34,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599430040] [2020-02-10 19:47:34,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:47:34,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:34,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:47:34,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:34,709 INFO L87 Difference]: Start difference. First operand 1569 states and 7050 transitions. Second operand 11 states. [2020-02-10 19:47:34,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:34,978 INFO L93 Difference]: Finished difference Result 2922 states and 11667 transitions. [2020-02-10 19:47:34,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:47:34,979 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:47:34,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:34,986 INFO L225 Difference]: With dead ends: 2922 [2020-02-10 19:47:34,986 INFO L226 Difference]: Without dead ends: 2906 [2020-02-10 19:47:34,987 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:47:35,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2906 states. [2020-02-10 19:47:35,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2906 to 1573. [2020-02-10 19:47:35,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 19:47:35,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7057 transitions. [2020-02-10 19:47:35,056 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7057 transitions. Word has length 28 [2020-02-10 19:47:35,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:35,056 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7057 transitions. [2020-02-10 19:47:35,056 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:47:35,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7057 transitions. [2020-02-10 19:47:35,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:47:35,058 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:35,058 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:35,058 INFO L427 AbstractCegarLoop]: === Iteration 260 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:35,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:35,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1465853796, now seen corresponding path program 252 times [2020-02-10 19:47:35,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:35,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573676134] [2020-02-10 19:47:35,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:35,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:35,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:35,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573676134] [2020-02-10 19:47:35,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:35,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:47:35,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385986803] [2020-02-10 19:47:35,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:47:35,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:35,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:47:35,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:35,606 INFO L87 Difference]: Start difference. First operand 1573 states and 7057 transitions. Second operand 11 states. [2020-02-10 19:47:35,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:35,844 INFO L93 Difference]: Finished difference Result 2920 states and 11659 transitions. [2020-02-10 19:47:35,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:47:35,844 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:47:35,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:35,852 INFO L225 Difference]: With dead ends: 2920 [2020-02-10 19:47:35,852 INFO L226 Difference]: Without dead ends: 2898 [2020-02-10 19:47:35,852 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:47:35,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2898 states. [2020-02-10 19:47:35,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2898 to 1565. [2020-02-10 19:47:35,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1565 states. [2020-02-10 19:47:35,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 7039 transitions. [2020-02-10 19:47:35,919 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 7039 transitions. Word has length 28 [2020-02-10 19:47:35,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:35,919 INFO L479 AbstractCegarLoop]: Abstraction has 1565 states and 7039 transitions. [2020-02-10 19:47:35,920 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:47:35,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 7039 transitions. [2020-02-10 19:47:35,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:47:35,922 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:35,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] [2020-02-10 19:47:35,922 INFO L427 AbstractCegarLoop]: === Iteration 261 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:35,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:35,922 INFO L82 PathProgramCache]: Analyzing trace with hash 227398052, now seen corresponding path program 253 times [2020-02-10 19:47:35,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:35,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875936782] [2020-02-10 19:47:35,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:35,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:36,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:36,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875936782] [2020-02-10 19:47:36,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:36,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:47:36,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891595191] [2020-02-10 19:47:36,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:47:36,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:36,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:47:36,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:36,438 INFO L87 Difference]: Start difference. First operand 1565 states and 7039 transitions. Second operand 11 states. [2020-02-10 19:47:36,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:36,691 INFO L93 Difference]: Finished difference Result 2935 states and 11697 transitions. [2020-02-10 19:47:36,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:47:36,692 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:47:36,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:36,698 INFO L225 Difference]: With dead ends: 2935 [2020-02-10 19:47:36,698 INFO L226 Difference]: Without dead ends: 2920 [2020-02-10 19:47:36,699 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:47:36,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2920 states. [2020-02-10 19:47:36,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2920 to 1576. [2020-02-10 19:47:36,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 19:47:36,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7068 transitions. [2020-02-10 19:47:36,768 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7068 transitions. Word has length 28 [2020-02-10 19:47:36,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:36,768 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7068 transitions. [2020-02-10 19:47:36,768 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:47:36,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7068 transitions. [2020-02-10 19:47:36,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:47:36,770 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:36,771 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:36,771 INFO L427 AbstractCegarLoop]: === Iteration 262 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:36,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:36,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1716803048, now seen corresponding path program 254 times [2020-02-10 19:47:36,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:36,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702626862] [2020-02-10 19:47:36,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:36,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:37,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 19:47:37,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702626862] [2020-02-10 19:47:37,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:37,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:47:37,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991171625] [2020-02-10 19:47:37,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:47:37,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:37,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:47:37,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:37,303 INFO L87 Difference]: Start difference. First operand 1576 states and 7068 transitions. Second operand 11 states. [2020-02-10 19:47:37,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:37,461 INFO L93 Difference]: Finished difference Result 2940 states and 11701 transitions. [2020-02-10 19:47:37,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:47:37,461 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:47:37,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:37,468 INFO L225 Difference]: With dead ends: 2940 [2020-02-10 19:47:37,468 INFO L226 Difference]: Without dead ends: 2914 [2020-02-10 19:47:37,468 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:47:37,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2914 states. [2020-02-10 19:47:37,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2914 to 1570. [2020-02-10 19:47:37,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 19:47:37,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7052 transitions. [2020-02-10 19:47:37,537 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7052 transitions. Word has length 28 [2020-02-10 19:47:37,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:37,537 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7052 transitions. [2020-02-10 19:47:37,537 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:47:37,537 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7052 transitions. [2020-02-10 19:47:37,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:47:37,540 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:37,540 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:37,540 INFO L427 AbstractCegarLoop]: === Iteration 263 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:37,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:37,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1918772708, now seen corresponding path program 255 times [2020-02-10 19:47:37,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:37,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513017664] [2020-02-10 19:47:37,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:37,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:38,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:38,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513017664] [2020-02-10 19:47:38,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:38,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:47:38,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129535504] [2020-02-10 19:47:38,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:47:38,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:38,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:47:38,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:38,092 INFO L87 Difference]: Start difference. First operand 1570 states and 7052 transitions. Second operand 11 states. [2020-02-10 19:47:38,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:38,319 INFO L93 Difference]: Finished difference Result 2927 states and 11676 transitions. [2020-02-10 19:47:38,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:47:38,320 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:47:38,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:38,327 INFO L225 Difference]: With dead ends: 2927 [2020-02-10 19:47:38,327 INFO L226 Difference]: Without dead ends: 2912 [2020-02-10 19:47:38,328 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:47:38,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2912 states. [2020-02-10 19:47:38,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2912 to 1574. [2020-02-10 19:47:38,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 19:47:38,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7059 transitions. [2020-02-10 19:47:38,395 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7059 transitions. Word has length 28 [2020-02-10 19:47:38,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:38,395 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7059 transitions. [2020-02-10 19:47:38,395 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:47:38,395 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7059 transitions. [2020-02-10 19:47:38,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:47:38,397 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:38,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] [2020-02-10 19:47:38,397 INFO L427 AbstractCegarLoop]: === Iteration 264 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:38,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:38,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1745525016, now seen corresponding path program 256 times [2020-02-10 19:47:38,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:38,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307551786] [2020-02-10 19:47:38,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:38,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:38,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 19:47:38,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307551786] [2020-02-10 19:47:38,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:38,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:47:38,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662992098] [2020-02-10 19:47:38,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:47:38,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:38,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:47:38,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:38,952 INFO L87 Difference]: Start difference. First operand 1574 states and 7059 transitions. Second operand 11 states. [2020-02-10 19:47:39,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:39,136 INFO L93 Difference]: Finished difference Result 2926 states and 11670 transitions. [2020-02-10 19:47:39,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:47:39,137 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:47:39,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:39,144 INFO L225 Difference]: With dead ends: 2926 [2020-02-10 19:47:39,144 INFO L226 Difference]: Without dead ends: 2908 [2020-02-10 19:47:39,144 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:47:39,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2908 states. [2020-02-10 19:47:39,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2908 to 1570. [2020-02-10 19:47:39,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 19:47:39,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7048 transitions. [2020-02-10 19:47:39,211 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7048 transitions. Word has length 28 [2020-02-10 19:47:39,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:39,212 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7048 transitions. [2020-02-10 19:47:39,212 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:47:39,212 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7048 transitions. [2020-02-10 19:47:39,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:47:39,214 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:39,214 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:39,214 INFO L427 AbstractCegarLoop]: === Iteration 265 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:39,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:39,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1502453092, now seen corresponding path program 257 times [2020-02-10 19:47:39,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:39,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638151478] [2020-02-10 19:47:39,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:39,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:39,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:39,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638151478] [2020-02-10 19:47:39,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:39,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:47:39,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261683324] [2020-02-10 19:47:39,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:47:39,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:39,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:47:39,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:39,749 INFO L87 Difference]: Start difference. First operand 1570 states and 7048 transitions. Second operand 11 states. [2020-02-10 19:47:39,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:39,915 INFO L93 Difference]: Finished difference Result 2938 states and 11692 transitions. [2020-02-10 19:47:39,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:47:39,915 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:47:39,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:39,922 INFO L225 Difference]: With dead ends: 2938 [2020-02-10 19:47:39,922 INFO L226 Difference]: Without dead ends: 2918 [2020-02-10 19:47:39,922 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:47:39,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2918 states. [2020-02-10 19:47:39,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2918 to 1575. [2020-02-10 19:47:39,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 19:47:39,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7056 transitions. [2020-02-10 19:47:39,990 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7056 transitions. Word has length 28 [2020-02-10 19:47:39,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:39,990 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7056 transitions. [2020-02-10 19:47:39,990 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:47:39,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7056 transitions. [2020-02-10 19:47:39,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:47:39,992 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:39,992 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:39,992 INFO L427 AbstractCegarLoop]: === Iteration 266 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:39,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:39,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1476356900, now seen corresponding path program 258 times [2020-02-10 19:47:39,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:39,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854480665] [2020-02-10 19:47:39,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:39,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:40,420 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 29 [2020-02-10 19:47:40,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:40,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854480665] [2020-02-10 19:47:40,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:40,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:47:40,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847277155] [2020-02-10 19:47:40,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:47:40,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:40,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:47:40,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:40,538 INFO L87 Difference]: Start difference. First operand 1575 states and 7056 transitions. Second operand 11 states. [2020-02-10 19:47:40,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:40,770 INFO L93 Difference]: Finished difference Result 2932 states and 11676 transitions. [2020-02-10 19:47:40,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:47:40,770 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:47:40,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:40,777 INFO L225 Difference]: With dead ends: 2932 [2020-02-10 19:47:40,777 INFO L226 Difference]: Without dead ends: 2908 [2020-02-10 19:47:40,777 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:47:40,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2908 states. [2020-02-10 19:47:40,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2908 to 1565. [2020-02-10 19:47:40,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1565 states. [2020-02-10 19:47:40,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 7034 transitions. [2020-02-10 19:47:40,844 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 7034 transitions. Word has length 28 [2020-02-10 19:47:40,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:40,845 INFO L479 AbstractCegarLoop]: Abstraction has 1565 states and 7034 transitions. [2020-02-10 19:47:40,845 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:47:40,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 7034 transitions. [2020-02-10 19:47:40,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:47:40,847 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:40,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] [2020-02-10 19:47:40,847 INFO L427 AbstractCegarLoop]: === Iteration 267 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:40,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:40,848 INFO L82 PathProgramCache]: Analyzing trace with hash 982603654, now seen corresponding path program 259 times [2020-02-10 19:47:40,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:40,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141973465] [2020-02-10 19:47:40,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:40,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:41,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 19:47:41,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141973465] [2020-02-10 19:47:41,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:41,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:47:41,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223808986] [2020-02-10 19:47:41,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:47:41,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:41,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:47:41,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:41,371 INFO L87 Difference]: Start difference. First operand 1565 states and 7034 transitions. Second operand 11 states. [2020-02-10 19:47:41,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:41,564 INFO L93 Difference]: Finished difference Result 2940 states and 11704 transitions. [2020-02-10 19:47:41,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:47:41,564 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:47:41,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:41,571 INFO L225 Difference]: With dead ends: 2940 [2020-02-10 19:47:41,572 INFO L226 Difference]: Without dead ends: 2924 [2020-02-10 19:47:41,572 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:47:41,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2924 states. [2020-02-10 19:47:41,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2924 to 1577. [2020-02-10 19:47:41,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 19:47:41,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7065 transitions. [2020-02-10 19:47:41,640 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7065 transitions. Word has length 28 [2020-02-10 19:47:41,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:41,640 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7065 transitions. [2020-02-10 19:47:41,640 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:47:41,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7065 transitions. [2020-02-10 19:47:41,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:47:41,642 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:41,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] [2020-02-10 19:47:41,642 INFO L427 AbstractCegarLoop]: === Iteration 268 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:41,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:41,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1727306152, now seen corresponding path program 260 times [2020-02-10 19:47:41,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:41,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39086685] [2020-02-10 19:47:41,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:41,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:42,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:42,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39086685] [2020-02-10 19:47:42,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:42,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:47:42,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214886003] [2020-02-10 19:47:42,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:47:42,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:42,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:47:42,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:42,173 INFO L87 Difference]: Start difference. First operand 1577 states and 7065 transitions. Second operand 11 states. [2020-02-10 19:47:42,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:42,325 INFO L93 Difference]: Finished difference Result 2944 states and 11705 transitions. [2020-02-10 19:47:42,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:47:42,326 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:47:42,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:42,333 INFO L225 Difference]: With dead ends: 2944 [2020-02-10 19:47:42,334 INFO L226 Difference]: Without dead ends: 2917 [2020-02-10 19:47:42,334 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:47:42,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2917 states. [2020-02-10 19:47:42,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2917 to 1570. [2020-02-10 19:47:42,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 19:47:42,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7047 transitions. [2020-02-10 19:47:42,401 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7047 transitions. Word has length 28 [2020-02-10 19:47:42,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:42,401 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7047 transitions. [2020-02-10 19:47:42,401 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:47:42,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7047 transitions. [2020-02-10 19:47:42,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:47:42,403 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:42,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] [2020-02-10 19:47:42,404 INFO L427 AbstractCegarLoop]: === Iteration 269 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:42,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:42,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1163567106, now seen corresponding path program 261 times [2020-02-10 19:47:42,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:42,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329803096] [2020-02-10 19:47:42,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:42,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:42,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 19:47:42,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329803096] [2020-02-10 19:47:42,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:42,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:47:42,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345118245] [2020-02-10 19:47:42,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:47:42,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:42,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:47:42,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:42,914 INFO L87 Difference]: Start difference. First operand 1570 states and 7047 transitions. Second operand 11 states. [2020-02-10 19:47:43,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:43,091 INFO L93 Difference]: Finished difference Result 2931 states and 11680 transitions. [2020-02-10 19:47:43,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:47:43,091 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:47:43,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:43,098 INFO L225 Difference]: With dead ends: 2931 [2020-02-10 19:47:43,098 INFO L226 Difference]: Without dead ends: 2915 [2020-02-10 19:47:43,098 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:47:43,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2915 states. [2020-02-10 19:47:43,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2915 to 1574. [2020-02-10 19:47:43,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 19:47:43,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7054 transitions. [2020-02-10 19:47:43,166 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7054 transitions. Word has length 28 [2020-02-10 19:47:43,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:43,166 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7054 transitions. [2020-02-10 19:47:43,166 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:47:43,166 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7054 transitions. [2020-02-10 19:47:43,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:47:43,168 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:43,168 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:43,168 INFO L427 AbstractCegarLoop]: === Iteration 270 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:43,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:43,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1735021912, now seen corresponding path program 262 times [2020-02-10 19:47:43,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:43,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223652535] [2020-02-10 19:47:43,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:43,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:43,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 19:47:43,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223652535] [2020-02-10 19:47:43,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:43,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:47:43,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414254682] [2020-02-10 19:47:43,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:47:43,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:43,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:47:43,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:43,706 INFO L87 Difference]: Start difference. First operand 1574 states and 7054 transitions. Second operand 11 states. [2020-02-10 19:47:43,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:43,892 INFO L93 Difference]: Finished difference Result 2929 states and 11672 transitions. [2020-02-10 19:47:43,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:47:43,892 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:47:43,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:43,900 INFO L225 Difference]: With dead ends: 2929 [2020-02-10 19:47:43,900 INFO L226 Difference]: Without dead ends: 2911 [2020-02-10 19:47:43,900 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:47:43,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2911 states. [2020-02-10 19:47:43,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2911 to 1570. [2020-02-10 19:47:43,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 19:47:43,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7043 transitions. [2020-02-10 19:47:43,969 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7043 transitions. Word has length 28 [2020-02-10 19:47:43,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:43,969 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7043 transitions. [2020-02-10 19:47:43,969 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:47:43,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7043 transitions. [2020-02-10 19:47:43,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:47:43,971 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:43,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] [2020-02-10 19:47:43,972 INFO L427 AbstractCegarLoop]: === Iteration 271 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:43,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:43,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1192076350, now seen corresponding path program 263 times [2020-02-10 19:47:43,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:43,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681743363] [2020-02-10 19:47:43,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:43,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:44,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 19:47:44,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681743363] [2020-02-10 19:47:44,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:44,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:47:44,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696328230] [2020-02-10 19:47:44,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:47:44,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:44,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:47:44,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:44,497 INFO L87 Difference]: Start difference. First operand 1570 states and 7043 transitions. Second operand 11 states. [2020-02-10 19:47:44,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:44,657 INFO L93 Difference]: Finished difference Result 2940 states and 11692 transitions. [2020-02-10 19:47:44,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:47:44,658 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:47:44,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:44,665 INFO L225 Difference]: With dead ends: 2940 [2020-02-10 19:47:44,665 INFO L226 Difference]: Without dead ends: 2920 [2020-02-10 19:47:44,665 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:47:44,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2920 states. [2020-02-10 19:47:44,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2920 to 1575. [2020-02-10 19:47:44,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 19:47:44,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7051 transitions. [2020-02-10 19:47:44,733 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7051 transitions. Word has length 28 [2020-02-10 19:47:44,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:44,733 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7051 transitions. [2020-02-10 19:47:44,733 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:47:44,733 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7051 transitions. [2020-02-10 19:47:44,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:47:44,735 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:44,736 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:44,736 INFO L427 AbstractCegarLoop]: === Iteration 272 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:44,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:44,736 INFO L82 PathProgramCache]: Analyzing trace with hash -124080954, now seen corresponding path program 264 times [2020-02-10 19:47:44,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:44,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350678772] [2020-02-10 19:47:44,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:44,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:45,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:45,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350678772] [2020-02-10 19:47:45,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:45,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:47:45,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137739105] [2020-02-10 19:47:45,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:47:45,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:45,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:47:45,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:45,264 INFO L87 Difference]: Start difference. First operand 1575 states and 7051 transitions. Second operand 11 states. [2020-02-10 19:47:45,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:45,449 INFO L93 Difference]: Finished difference Result 2934 states and 11676 transitions. [2020-02-10 19:47:45,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:47:45,450 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:47:45,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:45,457 INFO L225 Difference]: With dead ends: 2934 [2020-02-10 19:47:45,457 INFO L226 Difference]: Without dead ends: 2905 [2020-02-10 19:47:45,457 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:47:45,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2905 states. [2020-02-10 19:47:45,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2905 to 1560. [2020-02-10 19:47:45,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2020-02-10 19:47:45,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 7020 transitions. [2020-02-10 19:47:45,542 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 7020 transitions. Word has length 28 [2020-02-10 19:47:45,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:45,542 INFO L479 AbstractCegarLoop]: Abstraction has 1560 states and 7020 transitions. [2020-02-10 19:47:45,542 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:47:45,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 7020 transitions. [2020-02-10 19:47:45,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:47:45,545 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:45,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] [2020-02-10 19:47:45,545 INFO L427 AbstractCegarLoop]: === Iteration 273 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:45,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:45,545 INFO L82 PathProgramCache]: Analyzing trace with hash 155271406, now seen corresponding path program 265 times [2020-02-10 19:47:45,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:45,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778316488] [2020-02-10 19:47:45,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:45,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:46,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 19:47:46,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778316488] [2020-02-10 19:47:46,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:46,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:47:46,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992456715] [2020-02-10 19:47:46,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:47:46,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:46,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:47:46,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:46,076 INFO L87 Difference]: Start difference. First operand 1560 states and 7020 transitions. Second operand 11 states. [2020-02-10 19:47:46,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:46,257 INFO L93 Difference]: Finished difference Result 2950 states and 11754 transitions. [2020-02-10 19:47:46,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:47:46,257 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:47:46,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:46,264 INFO L225 Difference]: With dead ends: 2950 [2020-02-10 19:47:46,264 INFO L226 Difference]: Without dead ends: 2935 [2020-02-10 19:47:46,265 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:47:46,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2935 states. [2020-02-10 19:47:46,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2935 to 1577. [2020-02-10 19:47:46,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 19:47:46,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7079 transitions. [2020-02-10 19:47:46,333 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7079 transitions. Word has length 28 [2020-02-10 19:47:46,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:46,333 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7079 transitions. [2020-02-10 19:47:46,333 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:47:46,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7079 transitions. [2020-02-10 19:47:46,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:47:46,336 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:46,336 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:46,336 INFO L427 AbstractCegarLoop]: === Iteration 274 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:46,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:46,336 INFO L82 PathProgramCache]: Analyzing trace with hash 899973904, now seen corresponding path program 266 times [2020-02-10 19:47:46,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:46,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649446645] [2020-02-10 19:47:46,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:46,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:46,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 19:47:46,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649446645] [2020-02-10 19:47:46,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:46,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:47:46,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429596202] [2020-02-10 19:47:46,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:47:46,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:46,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:47:46,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:46,868 INFO L87 Difference]: Start difference. First operand 1577 states and 7079 transitions. Second operand 11 states. [2020-02-10 19:47:47,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:47,082 INFO L93 Difference]: Finished difference Result 2951 states and 11751 transitions. [2020-02-10 19:47:47,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:47:47,082 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:47:47,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:47,089 INFO L225 Difference]: With dead ends: 2951 [2020-02-10 19:47:47,089 INFO L226 Difference]: Without dead ends: 2930 [2020-02-10 19:47:47,089 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:47:47,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2020-02-10 19:47:47,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 1572. [2020-02-10 19:47:47,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 19:47:47,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7065 transitions. [2020-02-10 19:47:47,157 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7065 transitions. Word has length 28 [2020-02-10 19:47:47,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:47,157 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7065 transitions. [2020-02-10 19:47:47,157 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:47:47,157 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7065 transitions. [2020-02-10 19:47:47,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:47:47,159 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:47,159 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:47,159 INFO L427 AbstractCegarLoop]: === Iteration 275 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:47,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:47,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1766212364, now seen corresponding path program 267 times [2020-02-10 19:47:47,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:47,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360154843] [2020-02-10 19:47:47,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:47,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:47,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 19:47:47,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360154843] [2020-02-10 19:47:47,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:47,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:47:47,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042316718] [2020-02-10 19:47:47,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:47:47,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:47,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:47:47,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:47,701 INFO L87 Difference]: Start difference. First operand 1572 states and 7065 transitions. Second operand 11 states. [2020-02-10 19:47:47,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:47,909 INFO L93 Difference]: Finished difference Result 2955 states and 11758 transitions. [2020-02-10 19:47:47,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:47:47,909 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:47:47,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:47,916 INFO L225 Difference]: With dead ends: 2955 [2020-02-10 19:47:47,916 INFO L226 Difference]: Without dead ends: 2940 [2020-02-10 19:47:47,916 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:47:47,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2940 states. [2020-02-10 19:47:47,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2940 to 1578. [2020-02-10 19:47:47,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 19:47:47,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7076 transitions. [2020-02-10 19:47:47,986 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7076 transitions. Word has length 28 [2020-02-10 19:47:47,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:47,986 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7076 transitions. [2020-02-10 19:47:47,986 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:47:47,986 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7076 transitions. [2020-02-10 19:47:47,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:47:47,988 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:47,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] [2020-02-10 19:47:47,988 INFO L427 AbstractCegarLoop]: === Iteration 276 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:47,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:47,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1039349936, now seen corresponding path program 268 times [2020-02-10 19:47:47,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:47,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204490407] [2020-02-10 19:47:47,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:47,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:48,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:48,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204490407] [2020-02-10 19:47:48,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:48,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:47:48,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886336174] [2020-02-10 19:47:48,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:47:48,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:48,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:47:48,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:48,512 INFO L87 Difference]: Start difference. First operand 1578 states and 7076 transitions. Second operand 11 states. [2020-02-10 19:47:48,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:48,669 INFO L93 Difference]: Finished difference Result 2960 states and 11762 transitions. [2020-02-10 19:47:48,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:47:48,670 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:47:48,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:48,677 INFO L225 Difference]: With dead ends: 2960 [2020-02-10 19:47:48,677 INFO L226 Difference]: Without dead ends: 2934 [2020-02-10 19:47:48,678 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:47:48,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2934 states. [2020-02-10 19:47:48,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2934 to 1572. [2020-02-10 19:47:48,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 19:47:48,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7059 transitions. [2020-02-10 19:47:48,745 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7059 transitions. Word has length 28 [2020-02-10 19:47:48,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:48,745 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7059 transitions. [2020-02-10 19:47:48,745 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:47:48,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7059 transitions. [2020-02-10 19:47:48,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:47:48,747 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:48,747 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:48,747 INFO L427 AbstractCegarLoop]: === Iteration 277 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:48,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:48,747 INFO L82 PathProgramCache]: Analyzing trace with hash -173111476, now seen corresponding path program 269 times [2020-02-10 19:47:48,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:48,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157677319] [2020-02-10 19:47:48,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:48,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:49,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:49,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157677319] [2020-02-10 19:47:49,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:49,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:47:49,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483749846] [2020-02-10 19:47:49,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:47:49,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:49,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:47:49,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:49,280 INFO L87 Difference]: Start difference. First operand 1572 states and 7059 transitions. Second operand 11 states. [2020-02-10 19:47:49,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:49,469 INFO L93 Difference]: Finished difference Result 2958 states and 11759 transitions. [2020-02-10 19:47:49,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:47:49,470 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:47:49,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:49,478 INFO L225 Difference]: With dead ends: 2958 [2020-02-10 19:47:49,478 INFO L226 Difference]: Without dead ends: 2942 [2020-02-10 19:47:49,478 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:47:49,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2942 states. [2020-02-10 19:47:49,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2942 to 1579. [2020-02-10 19:47:49,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 19:47:49,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7072 transitions. [2020-02-10 19:47:49,547 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7072 transitions. Word has length 28 [2020-02-10 19:47:49,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:49,547 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7072 transitions. [2020-02-10 19:47:49,547 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:47:49,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7072 transitions. [2020-02-10 19:47:49,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:47:49,549 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:49,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] [2020-02-10 19:47:49,550 INFO L427 AbstractCegarLoop]: === Iteration 278 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:49,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:49,550 INFO L82 PathProgramCache]: Analyzing trace with hash 571591022, now seen corresponding path program 270 times [2020-02-10 19:47:49,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:49,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483122258] [2020-02-10 19:47:49,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:49,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:50,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:50,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483122258] [2020-02-10 19:47:50,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:50,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:47:50,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213468943] [2020-02-10 19:47:50,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:47:50,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:50,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:47:50,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:50,074 INFO L87 Difference]: Start difference. First operand 1579 states and 7072 transitions. Second operand 11 states. [2020-02-10 19:47:50,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:50,259 INFO L93 Difference]: Finished difference Result 2962 states and 11760 transitions. [2020-02-10 19:47:50,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:47:50,259 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:47:50,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:50,267 INFO L225 Difference]: With dead ends: 2962 [2020-02-10 19:47:50,267 INFO L226 Difference]: Without dead ends: 2929 [2020-02-10 19:47:50,267 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:47:50,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2929 states. [2020-02-10 19:47:50,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2929 to 1566. [2020-02-10 19:47:50,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1566 states. [2020-02-10 19:47:50,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 7042 transitions. [2020-02-10 19:47:50,336 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 7042 transitions. Word has length 28 [2020-02-10 19:47:50,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:50,336 INFO L479 AbstractCegarLoop]: Abstraction has 1566 states and 7042 transitions. [2020-02-10 19:47:50,336 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:47:50,336 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 7042 transitions. [2020-02-10 19:47:50,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:47:50,338 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:50,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] [2020-02-10 19:47:50,338 INFO L427 AbstractCegarLoop]: === Iteration 279 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:50,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:50,339 INFO L82 PathProgramCache]: Analyzing trace with hash -669941720, now seen corresponding path program 271 times [2020-02-10 19:47:50,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:50,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573717297] [2020-02-10 19:47:50,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:50,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:50,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 19:47:50,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573717297] [2020-02-10 19:47:50,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:50,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:47:50,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396232459] [2020-02-10 19:47:50,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:47:50,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:50,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:47:50,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:50,891 INFO L87 Difference]: Start difference. First operand 1566 states and 7042 transitions. Second operand 11 states. [2020-02-10 19:47:51,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:51,096 INFO L93 Difference]: Finished difference Result 2944 states and 11736 transitions. [2020-02-10 19:47:51,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:47:51,097 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:47:51,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:51,104 INFO L225 Difference]: With dead ends: 2944 [2020-02-10 19:47:51,104 INFO L226 Difference]: Without dead ends: 2929 [2020-02-10 19:47:51,104 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:47:51,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2929 states. [2020-02-10 19:47:51,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2929 to 1576. [2020-02-10 19:47:51,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 19:47:51,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7070 transitions. [2020-02-10 19:47:51,171 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7070 transitions. Word has length 28 [2020-02-10 19:47:51,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:51,171 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7070 transitions. [2020-02-10 19:47:51,171 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:47:51,172 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7070 transitions. [2020-02-10 19:47:51,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:47:51,174 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:51,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] [2020-02-10 19:47:51,174 INFO L427 AbstractCegarLoop]: === Iteration 280 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:51,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:51,174 INFO L82 PathProgramCache]: Analyzing trace with hash 74760778, now seen corresponding path program 272 times [2020-02-10 19:47:51,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:51,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123268578] [2020-02-10 19:47:51,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:51,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:51,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 19:47:51,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123268578] [2020-02-10 19:47:51,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:51,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:47:51,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593582651] [2020-02-10 19:47:51,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:47:51,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:51,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:47:51,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:51,714 INFO L87 Difference]: Start difference. First operand 1576 states and 7070 transitions. Second operand 11 states. [2020-02-10 19:47:51,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:51,916 INFO L93 Difference]: Finished difference Result 2945 states and 11733 transitions. [2020-02-10 19:47:51,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:47:51,917 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:47:51,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:51,924 INFO L225 Difference]: With dead ends: 2945 [2020-02-10 19:47:51,925 INFO L226 Difference]: Without dead ends: 2924 [2020-02-10 19:47:51,925 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:47:51,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2924 states. [2020-02-10 19:47:51,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2924 to 1571. [2020-02-10 19:47:51,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 19:47:51,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7056 transitions. [2020-02-10 19:47:51,992 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7056 transitions. Word has length 28 [2020-02-10 19:47:51,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:51,992 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7056 transitions. [2020-02-10 19:47:51,992 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:47:51,992 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7056 transitions. [2020-02-10 19:47:51,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:47:51,995 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47: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] [2020-02-10 19:47:51,995 INFO L427 AbstractCegarLoop]: === Iteration 281 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:51,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:51,995 INFO L82 PathProgramCache]: Analyzing trace with hash 2016710394, now seen corresponding path program 273 times [2020-02-10 19:47:51,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:51,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287122367] [2020-02-10 19:47:51,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:51,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:52,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:52,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287122367] [2020-02-10 19:47:52,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:52,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:47:52,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156481086] [2020-02-10 19:47:52,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:47:52,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:52,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:47:52,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:52,518 INFO L87 Difference]: Start difference. First operand 1571 states and 7056 transitions. Second operand 11 states. [2020-02-10 19:47:52,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:52,723 INFO L93 Difference]: Finished difference Result 2945 states and 11733 transitions. [2020-02-10 19:47:52,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:47:52,724 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:47:52,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:52,731 INFO L225 Difference]: With dead ends: 2945 [2020-02-10 19:47:52,731 INFO L226 Difference]: Without dead ends: 2930 [2020-02-10 19:47:52,732 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:47:52,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2020-02-10 19:47:52,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 1576. [2020-02-10 19:47:52,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 19:47:52,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7065 transitions. [2020-02-10 19:47:52,800 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7065 transitions. Word has length 28 [2020-02-10 19:47:52,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:52,800 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7065 transitions. [2020-02-10 19:47:52,800 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:47:52,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7065 transitions. [2020-02-10 19:47:52,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:47:52,803 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:52,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] [2020-02-10 19:47:52,803 INFO L427 AbstractCegarLoop]: === Iteration 282 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:52,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:52,803 INFO L82 PathProgramCache]: Analyzing trace with hash -615604214, now seen corresponding path program 274 times [2020-02-10 19:47:52,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:52,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435566098] [2020-02-10 19:47:52,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:52,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:53,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:53,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435566098] [2020-02-10 19:47:53,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:53,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:47:53,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163206898] [2020-02-10 19:47:53,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:47:53,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:53,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:47:53,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:53,334 INFO L87 Difference]: Start difference. First operand 1576 states and 7065 transitions. Second operand 11 states. [2020-02-10 19:47:53,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:53,520 INFO L93 Difference]: Finished difference Result 2947 states and 11732 transitions. [2020-02-10 19:47:53,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:47:53,521 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:47:53,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:53,528 INFO L225 Difference]: With dead ends: 2947 [2020-02-10 19:47:53,528 INFO L226 Difference]: Without dead ends: 2925 [2020-02-10 19:47:53,529 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:47:53,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2925 states. [2020-02-10 19:47:53,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2925 to 1571. [2020-02-10 19:47:53,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 19:47:53,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7051 transitions. [2020-02-10 19:47:53,596 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7051 transitions. Word has length 28 [2020-02-10 19:47:53,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:53,596 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7051 transitions. [2020-02-10 19:47:53,596 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:47:53,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7051 transitions. [2020-02-10 19:47:53,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:47:53,599 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:53,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] [2020-02-10 19:47:53,599 INFO L427 AbstractCegarLoop]: === Iteration 283 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:53,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:53,599 INFO L82 PathProgramCache]: Analyzing trace with hash 77386554, now seen corresponding path program 275 times [2020-02-10 19:47:53,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:53,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765883494] [2020-02-10 19:47:53,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:53,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:54,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:54,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765883494] [2020-02-10 19:47:54,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:54,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:47:54,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247575630] [2020-02-10 19:47:54,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:47:54,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:54,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:47:54,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:54,130 INFO L87 Difference]: Start difference. First operand 1571 states and 7051 transitions. Second operand 11 states. [2020-02-10 19:47:54,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:54,347 INFO L93 Difference]: Finished difference Result 2948 states and 11735 transitions. [2020-02-10 19:47:54,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:47:54,347 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:47:54,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:54,354 INFO L225 Difference]: With dead ends: 2948 [2020-02-10 19:47:54,354 INFO L226 Difference]: Without dead ends: 2932 [2020-02-10 19:47:54,354 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:47:54,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2932 states. [2020-02-10 19:47:54,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2932 to 1577. [2020-02-10 19:47:54,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 19:47:54,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7062 transitions. [2020-02-10 19:47:54,422 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7062 transitions. Word has length 28 [2020-02-10 19:47:54,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:54,422 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7062 transitions. [2020-02-10 19:47:54,422 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:47:54,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7062 transitions. [2020-02-10 19:47:54,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:47:54,424 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:54,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] [2020-02-10 19:47:54,425 INFO L427 AbstractCegarLoop]: === Iteration 284 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:54,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:54,425 INFO L82 PathProgramCache]: Analyzing trace with hash 995336744, now seen corresponding path program 276 times [2020-02-10 19:47:54,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:54,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113378306] [2020-02-10 19:47:54,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:54,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:54,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 19:47:54,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113378306] [2020-02-10 19:47:54,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:54,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:47:54,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617692739] [2020-02-10 19:47:54,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:47:54,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:54,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:47:54,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:54,976 INFO L87 Difference]: Start difference. First operand 1577 states and 7062 transitions. Second operand 11 states. [2020-02-10 19:47:55,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:55,220 INFO L93 Difference]: Finished difference Result 2949 states and 11731 transitions. [2020-02-10 19:47:55,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:47:55,221 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:47:55,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:55,228 INFO L225 Difference]: With dead ends: 2949 [2020-02-10 19:47:55,228 INFO L226 Difference]: Without dead ends: 2921 [2020-02-10 19:47:55,228 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:47:55,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2921 states. [2020-02-10 19:47:55,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2921 to 1566. [2020-02-10 19:47:55,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1566 states. [2020-02-10 19:47:55,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 7037 transitions. [2020-02-10 19:47:55,295 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 7037 transitions. Word has length 28 [2020-02-10 19:47:55,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:55,295 INFO L479 AbstractCegarLoop]: Abstraction has 1566 states and 7037 transitions. [2020-02-10 19:47:55,295 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:47:55,295 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 7037 transitions. [2020-02-10 19:47:55,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:47:55,297 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:55,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] [2020-02-10 19:47:55,297 INFO L427 AbstractCegarLoop]: === Iteration 285 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:55,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:55,298 INFO L82 PathProgramCache]: Analyzing trace with hash -659438616, now seen corresponding path program 277 times [2020-02-10 19:47:55,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:55,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911645421] [2020-02-10 19:47:55,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:55,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:55,852 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 30 [2020-02-10 19:47:55,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:55,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911645421] [2020-02-10 19:47:55,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:55,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:47:55,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827471099] [2020-02-10 19:47:55,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:47:55,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:55,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:47:55,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:55,860 INFO L87 Difference]: Start difference. First operand 1566 states and 7037 transitions. Second operand 11 states. [2020-02-10 19:47:56,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:56,064 INFO L93 Difference]: Finished difference Result 2957 states and 11757 transitions. [2020-02-10 19:47:56,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:47:56,065 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:47:56,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:56,072 INFO L225 Difference]: With dead ends: 2957 [2020-02-10 19:47:56,072 INFO L226 Difference]: Without dead ends: 2942 [2020-02-10 19:47:56,073 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:47:56,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2942 states. [2020-02-10 19:47:56,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2942 to 1578. [2020-02-10 19:47:56,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 19:47:56,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7070 transitions. [2020-02-10 19:47:56,142 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7070 transitions. Word has length 28 [2020-02-10 19:47:56,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:56,143 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7070 transitions. [2020-02-10 19:47:56,143 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:47:56,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7070 transitions. [2020-02-10 19:47:56,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:47:56,145 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:56,145 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:56,145 INFO L427 AbstractCegarLoop]: === Iteration 286 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:56,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:56,145 INFO L82 PathProgramCache]: Analyzing trace with hash 829966380, now seen corresponding path program 278 times [2020-02-10 19:47:56,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:56,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110485448] [2020-02-10 19:47:56,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:56,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:56,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 19:47:56,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110485448] [2020-02-10 19:47:56,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:56,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:47:56,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043140945] [2020-02-10 19:47:56,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:47:56,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:56,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:47:56,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:56,677 INFO L87 Difference]: Start difference. First operand 1578 states and 7070 transitions. Second operand 11 states. [2020-02-10 19:47:56,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:56,883 INFO L93 Difference]: Finished difference Result 2962 states and 11761 transitions. [2020-02-10 19:47:56,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:47:56,883 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:47:56,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:56,891 INFO L225 Difference]: With dead ends: 2962 [2020-02-10 19:47:56,891 INFO L226 Difference]: Without dead ends: 2936 [2020-02-10 19:47:56,891 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:47:56,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2936 states. [2020-02-10 19:47:56,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2936 to 1572. [2020-02-10 19:47:56,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 19:47:56,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7053 transitions. [2020-02-10 19:47:56,960 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7053 transitions. Word has length 28 [2020-02-10 19:47:56,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:56,961 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7053 transitions. [2020-02-10 19:47:56,961 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:47:56,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7053 transitions. [2020-02-10 19:47:56,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:47:56,963 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:56,963 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:56,963 INFO L427 AbstractCegarLoop]: === Iteration 287 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:56,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:56,963 INFO L82 PathProgramCache]: Analyzing trace with hash 416272540, now seen corresponding path program 279 times [2020-02-10 19:47:56,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:56,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483876381] [2020-02-10 19:47:56,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:56,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:57,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:57,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483876381] [2020-02-10 19:47:57,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:57,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:47:57,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726330887] [2020-02-10 19:47:57,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:47:57,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:57,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:47:57,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:57,485 INFO L87 Difference]: Start difference. First operand 1572 states and 7053 transitions. Second operand 11 states. [2020-02-10 19:47:57,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:57,679 INFO L93 Difference]: Finished difference Result 2953 states and 11744 transitions. [2020-02-10 19:47:57,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:47:57,680 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:47:57,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:57,687 INFO L225 Difference]: With dead ends: 2953 [2020-02-10 19:47:57,687 INFO L226 Difference]: Without dead ends: 2938 [2020-02-10 19:47:57,687 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:47:57,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2938 states. [2020-02-10 19:47:57,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2938 to 1577. [2020-02-10 19:47:57,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 19:47:57,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7062 transitions. [2020-02-10 19:47:57,756 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7062 transitions. Word has length 28 [2020-02-10 19:47:57,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:57,756 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7062 transitions. [2020-02-10 19:47:57,756 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:47:57,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7062 transitions. [2020-02-10 19:47:57,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:47:57,758 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:57,758 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:57,758 INFO L427 AbstractCegarLoop]: === Iteration 288 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:57,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:57,759 INFO L82 PathProgramCache]: Analyzing trace with hash 2078925228, now seen corresponding path program 280 times [2020-02-10 19:47:57,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:57,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802789209] [2020-02-10 19:47:57,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:57,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:58,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:58,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802789209] [2020-02-10 19:47:58,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:58,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:47:58,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876639395] [2020-02-10 19:47:58,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:47:58,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:58,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:47:58,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:58,282 INFO L87 Difference]: Start difference. First operand 1577 states and 7062 transitions. Second operand 11 states. [2020-02-10 19:47:58,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:58,509 INFO L93 Difference]: Finished difference Result 2955 states and 11743 transitions. [2020-02-10 19:47:58,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:47:58,509 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:47:58,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:58,516 INFO L225 Difference]: With dead ends: 2955 [2020-02-10 19:47:58,516 INFO L226 Difference]: Without dead ends: 2933 [2020-02-10 19:47:58,517 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:47:58,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2933 states. [2020-02-10 19:47:58,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2933 to 1572. [2020-02-10 19:47:58,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 19:47:58,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7048 transitions. [2020-02-10 19:47:58,585 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7048 transitions. Word has length 28 [2020-02-10 19:47:58,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:58,586 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7048 transitions. [2020-02-10 19:47:58,586 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:47:58,586 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7048 transitions. [2020-02-10 19:47:58,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:47:58,588 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:58,588 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:47:58,588 INFO L427 AbstractCegarLoop]: === Iteration 289 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:58,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:58,588 INFO L82 PathProgramCache]: Analyzing trace with hash 832592156, now seen corresponding path program 281 times [2020-02-10 19:47:58,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:58,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476690922] [2020-02-10 19:47:58,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:58,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47:59,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:47:59,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476690922] [2020-02-10 19:47:59,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:59,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:47:59,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682052105] [2020-02-10 19:47:59,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:47:59,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:59,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:47:59,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:59,131 INFO L87 Difference]: Start difference. First operand 1572 states and 7048 transitions. Second operand 11 states. [2020-02-10 19:47:59,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:47:59,327 INFO L93 Difference]: Finished difference Result 2966 states and 11765 transitions. [2020-02-10 19:47:59,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:47:59,327 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:47:59,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:47:59,334 INFO L225 Difference]: With dead ends: 2966 [2020-02-10 19:47:59,334 INFO L226 Difference]: Without dead ends: 2946 [2020-02-10 19:47:59,334 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:47:59,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2946 states. [2020-02-10 19:47:59,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2946 to 1580. [2020-02-10 19:47:59,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 19:47:59,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7062 transitions. [2020-02-10 19:47:59,403 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7062 transitions. Word has length 28 [2020-02-10 19:47:59,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:47:59,403 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7062 transitions. [2020-02-10 19:47:59,403 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:47:59,404 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7062 transitions. [2020-02-10 19:47:59,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:47:59,406 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:47:59,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] [2020-02-10 19:47:59,406 INFO L427 AbstractCegarLoop]: === Iteration 290 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:47:59,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:47:59,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1005839848, now seen corresponding path program 282 times [2020-02-10 19:47:59,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:47:59,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80937405] [2020-02-10 19:47:59,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:47:59,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:47: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 19:47:59,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80937405] [2020-02-10 19:47:59,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:47:59,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:47:59,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332120559] [2020-02-10 19:47:59,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:47:59,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:47:59,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:47:59,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:47:59,932 INFO L87 Difference]: Start difference. First operand 1580 states and 7062 transitions. Second operand 11 states. [2020-02-10 19:48:00,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:00,116 INFO L93 Difference]: Finished difference Result 2963 states and 11752 transitions. [2020-02-10 19:48:00,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:48:00,116 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:48:00,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:00,123 INFO L225 Difference]: With dead ends: 2963 [2020-02-10 19:48:00,123 INFO L226 Difference]: Without dead ends: 2932 [2020-02-10 19:48:00,124 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:48:00,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2932 states. [2020-02-10 19:48:00,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2932 to 1566. [2020-02-10 19:48:00,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1566 states. [2020-02-10 19:48:00,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 7031 transitions. [2020-02-10 19:48:00,194 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 7031 transitions. Word has length 28 [2020-02-10 19:48:00,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:00,194 INFO L479 AbstractCegarLoop]: Abstraction has 1566 states and 7031 transitions. [2020-02-10 19:48:00,194 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:48:00,194 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 7031 transitions. [2020-02-10 19:48:00,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:48:00,196 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:00,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] [2020-02-10 19:48:00,196 INFO L427 AbstractCegarLoop]: === Iteration 291 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:00,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:00,197 INFO L82 PathProgramCache]: Analyzing trace with hash 95766986, now seen corresponding path program 283 times [2020-02-10 19:48:00,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:00,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917447435] [2020-02-10 19:48:00,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:00,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:00,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:00,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917447435] [2020-02-10 19:48:00,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:00,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:48:00,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030160027] [2020-02-10 19:48:00,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:48:00,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:00,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:48:00,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:00,739 INFO L87 Difference]: Start difference. First operand 1566 states and 7031 transitions. Second operand 11 states. [2020-02-10 19:48:00,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:00,948 INFO L93 Difference]: Finished difference Result 2964 states and 11770 transitions. [2020-02-10 19:48:00,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:48:00,949 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:48:00,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:00,957 INFO L225 Difference]: With dead ends: 2964 [2020-02-10 19:48:00,957 INFO L226 Difference]: Without dead ends: 2948 [2020-02-10 19:48:00,957 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:48:01,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2948 states. [2020-02-10 19:48:01,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2948 to 1580. [2020-02-10 19:48:01,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 19:48:01,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7070 transitions. [2020-02-10 19:48:01,045 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7070 transitions. Word has length 28 [2020-02-10 19:48:01,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:01,045 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7070 transitions. [2020-02-10 19:48:01,046 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:48:01,046 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7070 transitions. [2020-02-10 19:48:01,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:48:01,048 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:01,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] [2020-02-10 19:48:01,048 INFO L427 AbstractCegarLoop]: === Iteration 292 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:01,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:01,048 INFO L82 PathProgramCache]: Analyzing trace with hash 840469484, now seen corresponding path program 284 times [2020-02-10 19:48:01,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:01,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327884227] [2020-02-10 19:48:01,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:01,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:01,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:01,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327884227] [2020-02-10 19:48:01,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:01,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:48:01,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619853778] [2020-02-10 19:48:01,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:48:01,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:01,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:48:01,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:01,582 INFO L87 Difference]: Start difference. First operand 1580 states and 7070 transitions. Second operand 11 states. [2020-02-10 19:48:01,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:01,774 INFO L93 Difference]: Finished difference Result 2968 states and 11771 transitions. [2020-02-10 19:48:01,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:48:01,775 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:48:01,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:01,782 INFO L225 Difference]: With dead ends: 2968 [2020-02-10 19:48:01,782 INFO L226 Difference]: Without dead ends: 2941 [2020-02-10 19:48:01,782 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:48:01,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2941 states. [2020-02-10 19:48:01,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2941 to 1573. [2020-02-10 19:48:01,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 19:48:01,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7050 transitions. [2020-02-10 19:48:01,850 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7050 transitions. Word has length 28 [2020-02-10 19:48:01,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:01,850 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7050 transitions. [2020-02-10 19:48:01,850 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:48:01,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7050 transitions. [2020-02-10 19:48:01,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:48:01,853 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:01,853 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:01,853 INFO L427 AbstractCegarLoop]: === Iteration 293 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:01,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:01,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1171478142, now seen corresponding path program 285 times [2020-02-10 19:48:01,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:01,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774753858] [2020-02-10 19:48:01,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:01,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:02,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 19:48:02,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774753858] [2020-02-10 19:48:02,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:02,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:48:02,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492588768] [2020-02-10 19:48:02,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:48:02,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:02,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:48:02,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:02,392 INFO L87 Difference]: Start difference. First operand 1573 states and 7050 transitions. Second operand 11 states. [2020-02-10 19:48:02,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:02,601 INFO L93 Difference]: Finished difference Result 2960 states and 11756 transitions. [2020-02-10 19:48:02,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:48:02,602 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:48:02,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:02,609 INFO L225 Difference]: With dead ends: 2960 [2020-02-10 19:48:02,610 INFO L226 Difference]: Without dead ends: 2944 [2020-02-10 19:48:02,610 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:48:02,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2944 states. [2020-02-10 19:48:02,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2944 to 1579. [2020-02-10 19:48:02,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 19:48:02,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7061 transitions. [2020-02-10 19:48:02,679 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7061 transitions. Word has length 28 [2020-02-10 19:48:02,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:02,679 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7061 transitions. [2020-02-10 19:48:02,680 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:48:02,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7061 transitions. [2020-02-10 19:48:02,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:48:02,682 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:02,682 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:02,682 INFO L427 AbstractCegarLoop]: === Iteration 294 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:02,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:02,682 INFO L82 PathProgramCache]: Analyzing trace with hash 2089428332, now seen corresponding path program 286 times [2020-02-10 19:48:02,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:02,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112872331] [2020-02-10 19:48:02,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:02,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:03,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:03,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112872331] [2020-02-10 19:48:03,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:03,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:48:03,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927439989] [2020-02-10 19:48:03,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:48:03,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:03,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:48:03,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:03,221 INFO L87 Difference]: Start difference. First operand 1579 states and 7061 transitions. Second operand 11 states. [2020-02-10 19:48:03,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:03,446 INFO L93 Difference]: Finished difference Result 2961 states and 11752 transitions. [2020-02-10 19:48:03,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:48:03,446 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:48:03,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:03,454 INFO L225 Difference]: With dead ends: 2961 [2020-02-10 19:48:03,454 INFO L226 Difference]: Without dead ends: 2938 [2020-02-10 19:48:03,454 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:48:03,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2938 states. [2020-02-10 19:48:03,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2938 to 1573. [2020-02-10 19:48:03,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 19:48:03,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7044 transitions. [2020-02-10 19:48:03,523 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7044 transitions. Word has length 28 [2020-02-10 19:48:03,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:03,523 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7044 transitions. [2020-02-10 19:48:03,523 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:48:03,523 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7044 transitions. [2020-02-10 19:48:03,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:48:03,525 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:03,525 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:03,526 INFO L427 AbstractCegarLoop]: === Iteration 295 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:03,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:03,526 INFO L82 PathProgramCache]: Analyzing trace with hash -767845698, now seen corresponding path program 287 times [2020-02-10 19:48:03,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:03,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702910976] [2020-02-10 19:48:03,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:03,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:04,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 19:48:04,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702910976] [2020-02-10 19:48:04,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:04,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:48:04,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901648400] [2020-02-10 19:48:04,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:48:04,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:04,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:48:04,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:04,076 INFO L87 Difference]: Start difference. First operand 1573 states and 7044 transitions. Second operand 11 states. [2020-02-10 19:48:04,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:04,218 INFO L93 Difference]: Finished difference Result 2970 states and 11769 transitions. [2020-02-10 19:48:04,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:48:04,218 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:48:04,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:04,226 INFO L225 Difference]: With dead ends: 2970 [2020-02-10 19:48:04,226 INFO L226 Difference]: Without dead ends: 2950 [2020-02-10 19:48:04,226 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:48:04,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2020-02-10 19:48:04,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 1581. [2020-02-10 19:48:04,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 19:48:04,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7058 transitions. [2020-02-10 19:48:04,295 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7058 transitions. Word has length 28 [2020-02-10 19:48:04,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:04,295 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7058 transitions. [2020-02-10 19:48:04,295 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:48:04,295 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7058 transitions. [2020-02-10 19:48:04,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:48:04,297 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:04,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] [2020-02-10 19:48:04,297 INFO L427 AbstractCegarLoop]: === Iteration 296 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:04,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:04,298 INFO L82 PathProgramCache]: Analyzing trace with hash -594598006, now seen corresponding path program 288 times [2020-02-10 19:48:04,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:04,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891467623] [2020-02-10 19:48:04,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:04,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:04,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 19:48:04,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891467623] [2020-02-10 19:48:04,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:04,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:48:04,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223959877] [2020-02-10 19:48:04,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:48:04,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:04,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:48:04,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:04,827 INFO L87 Difference]: Start difference. First operand 1581 states and 7058 transitions. Second operand 11 states. [2020-02-10 19:48:05,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:05,009 INFO L93 Difference]: Finished difference Result 2967 states and 11756 transitions. [2020-02-10 19:48:05,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:48:05,010 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:48:05,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:05,017 INFO L225 Difference]: With dead ends: 2967 [2020-02-10 19:48:05,017 INFO L226 Difference]: Without dead ends: 2929 [2020-02-10 19:48:05,018 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:48:05,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2929 states. [2020-02-10 19:48:05,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2929 to 1560. [2020-02-10 19:48:05,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2020-02-10 19:48:05,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 7015 transitions. [2020-02-10 19:48:05,086 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 7015 transitions. Word has length 28 [2020-02-10 19:48:05,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:05,086 INFO L479 AbstractCegarLoop]: Abstraction has 1560 states and 7015 transitions. [2020-02-10 19:48:05,086 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:48:05,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 7015 transitions. [2020-02-10 19:48:05,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:48:05,089 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:05,089 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:05,089 INFO L427 AbstractCegarLoop]: === Iteration 297 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:05,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:05,089 INFO L82 PathProgramCache]: Analyzing trace with hash 405091818, now seen corresponding path program 289 times [2020-02-10 19:48:05,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:05,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874702983] [2020-02-10 19:48:05,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:05,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:05,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:05,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874702983] [2020-02-10 19:48:05,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:05,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:48:05,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639163573] [2020-02-10 19:48:05,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:48:05,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:05,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:48:05,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:05,617 INFO L87 Difference]: Start difference. First operand 1560 states and 7015 transitions. Second operand 11 states. [2020-02-10 19:48:05,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:05,834 INFO L93 Difference]: Finished difference Result 2913 states and 11649 transitions. [2020-02-10 19:48:05,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:48:05,835 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:48:05,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:05,842 INFO L225 Difference]: With dead ends: 2913 [2020-02-10 19:48:05,842 INFO L226 Difference]: Without dead ends: 2898 [2020-02-10 19:48:05,842 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:48:05,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2898 states. [2020-02-10 19:48:05,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2898 to 1573. [2020-02-10 19:48:05,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 19:48:05,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7058 transitions. [2020-02-10 19:48:05,911 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7058 transitions. Word has length 28 [2020-02-10 19:48:05,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:05,912 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7058 transitions. [2020-02-10 19:48:05,912 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:48:05,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7058 transitions. [2020-02-10 19:48:05,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:48:05,914 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:05,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] [2020-02-10 19:48:05,914 INFO L427 AbstractCegarLoop]: === Iteration 298 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:05,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:05,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1149794316, now seen corresponding path program 290 times [2020-02-10 19:48:05,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:05,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62608163] [2020-02-10 19:48:05,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:05,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:06,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 19:48:06,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62608163] [2020-02-10 19:48:06,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:06,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:48:06,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589146763] [2020-02-10 19:48:06,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:48:06,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:06,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:48:06,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:06,478 INFO L87 Difference]: Start difference. First operand 1573 states and 7058 transitions. Second operand 11 states. [2020-02-10 19:48:06,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:06,686 INFO L93 Difference]: Finished difference Result 2914 states and 11646 transitions. [2020-02-10 19:48:06,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:48:06,687 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:48:06,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:06,694 INFO L225 Difference]: With dead ends: 2914 [2020-02-10 19:48:06,695 INFO L226 Difference]: Without dead ends: 2893 [2020-02-10 19:48:06,695 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:48:06,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2893 states. [2020-02-10 19:48:06,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2893 to 1568. [2020-02-10 19:48:06,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 19:48:06,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7045 transitions. [2020-02-10 19:48:06,764 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7045 transitions. Word has length 28 [2020-02-10 19:48:06,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:06,764 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7045 transitions. [2020-02-10 19:48:06,764 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:48:06,764 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7045 transitions. [2020-02-10 19:48:06,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:48:06,767 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:06,767 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:06,767 INFO L427 AbstractCegarLoop]: === Iteration 299 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:06,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:06,767 INFO L82 PathProgramCache]: Analyzing trace with hash -130137984, now seen corresponding path program 291 times [2020-02-10 19:48:06,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:06,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811806893] [2020-02-10 19:48:06,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:06,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:07,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 19:48:07,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811806893] [2020-02-10 19:48:07,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:07,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:48:07,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815143918] [2020-02-10 19:48:07,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:48:07,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:07,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:48:07,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:07,299 INFO L87 Difference]: Start difference. First operand 1568 states and 7045 transitions. Second operand 11 states. [2020-02-10 19:48:07,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:07,525 INFO L93 Difference]: Finished difference Result 2910 states and 11638 transitions. [2020-02-10 19:48:07,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:48:07,525 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:48:07,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:07,532 INFO L225 Difference]: With dead ends: 2910 [2020-02-10 19:48:07,532 INFO L226 Difference]: Without dead ends: 2895 [2020-02-10 19:48:07,532 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:48:07,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2895 states. [2020-02-10 19:48:07,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2895 to 1572. [2020-02-10 19:48:07,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 19:48:07,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7052 transitions. [2020-02-10 19:48:07,601 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7052 transitions. Word has length 28 [2020-02-10 19:48:07,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:07,601 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7052 transitions. [2020-02-10 19:48:07,601 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:48:07,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7052 transitions. [2020-02-10 19:48:07,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:48:07,603 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:07,604 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:07,604 INFO L427 AbstractCegarLoop]: === Iteration 300 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:07,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:07,604 INFO L82 PathProgramCache]: Analyzing trace with hash 43109708, now seen corresponding path program 292 times [2020-02-10 19:48:07,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:07,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400493171] [2020-02-10 19:48:07,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:07,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:08,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 19:48:08,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400493171] [2020-02-10 19:48:08,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:08,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:48:08,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699555775] [2020-02-10 19:48:08,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:48:08,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:08,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:48:08,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:08,136 INFO L87 Difference]: Start difference. First operand 1572 states and 7052 transitions. Second operand 11 states. [2020-02-10 19:48:08,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:08,352 INFO L93 Difference]: Finished difference Result 2909 states and 11632 transitions. [2020-02-10 19:48:08,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:48:08,353 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:48:08,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:08,360 INFO L225 Difference]: With dead ends: 2909 [2020-02-10 19:48:08,360 INFO L226 Difference]: Without dead ends: 2891 [2020-02-10 19:48:08,361 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:48:08,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2891 states. [2020-02-10 19:48:08,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2891 to 1568. [2020-02-10 19:48:08,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 19:48:08,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7041 transitions. [2020-02-10 19:48:08,435 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7041 transitions. Word has length 28 [2020-02-10 19:48:08,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:08,435 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7041 transitions. [2020-02-10 19:48:08,435 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:48:08,435 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7041 transitions. [2020-02-10 19:48:08,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:48:08,438 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:08,439 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:08,439 INFO L427 AbstractCegarLoop]: === Iteration 301 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:08,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:08,439 INFO L82 PathProgramCache]: Analyzing trace with hash -2069461824, now seen corresponding path program 293 times [2020-02-10 19:48:08,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:08,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407917591] [2020-02-10 19:48:08,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:08,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:08,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 19:48:08,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407917591] [2020-02-10 19:48:08,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:08,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:48:08,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78260950] [2020-02-10 19:48:08,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:48:08,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:08,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:48:08,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:08,977 INFO L87 Difference]: Start difference. First operand 1568 states and 7041 transitions. Second operand 11 states. [2020-02-10 19:48:09,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:09,241 INFO L93 Difference]: Finished difference Result 2912 states and 11638 transitions. [2020-02-10 19:48:09,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:48:09,242 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:48:09,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:09,249 INFO L225 Difference]: With dead ends: 2912 [2020-02-10 19:48:09,249 INFO L226 Difference]: Without dead ends: 2896 [2020-02-10 19:48:09,250 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:48:09,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2896 states. [2020-02-10 19:48:09,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2896 to 1572. [2020-02-10 19:48:09,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 19:48:09,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7048 transitions. [2020-02-10 19:48:09,318 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7048 transitions. Word has length 28 [2020-02-10 19:48:09,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:09,318 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7048 transitions. [2020-02-10 19:48:09,318 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:48:09,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7048 transitions. [2020-02-10 19:48:09,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:48:09,320 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:09,320 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:09,321 INFO L427 AbstractCegarLoop]: === Iteration 302 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:09,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:09,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1654050666, now seen corresponding path program 294 times [2020-02-10 19:48:09,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:09,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911452367] [2020-02-10 19:48:09,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:09,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:09,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:09,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911452367] [2020-02-10 19:48:09,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:09,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:48:09,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864349878] [2020-02-10 19:48:09,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:48:09,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:09,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:48:09,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:09,846 INFO L87 Difference]: Start difference. First operand 1572 states and 7048 transitions. Second operand 11 states. [2020-02-10 19:48:10,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:10,077 INFO L93 Difference]: Finished difference Result 2910 states and 11630 transitions. [2020-02-10 19:48:10,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:48:10,078 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:48:10,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:10,085 INFO L225 Difference]: With dead ends: 2910 [2020-02-10 19:48:10,085 INFO L226 Difference]: Without dead ends: 2888 [2020-02-10 19:48:10,086 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:48:10,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2888 states. [2020-02-10 19:48:10,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2888 to 1564. [2020-02-10 19:48:10,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1564 states. [2020-02-10 19:48:10,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 7030 transitions. [2020-02-10 19:48:10,153 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 7030 transitions. Word has length 28 [2020-02-10 19:48:10,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:10,153 INFO L479 AbstractCegarLoop]: Abstraction has 1564 states and 7030 transitions. [2020-02-10 19:48:10,153 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:48:10,153 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 7030 transitions. [2020-02-10 19:48:10,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:48:10,156 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:10,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] [2020-02-10 19:48:10,156 INFO L427 AbstractCegarLoop]: === Iteration 303 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:10,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:10,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1499183406, now seen corresponding path program 295 times [2020-02-10 19:48:10,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:10,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119696427] [2020-02-10 19:48:10,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:10,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:10,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:10,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119696427] [2020-02-10 19:48:10,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:10,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:48:10,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914364214] [2020-02-10 19:48:10,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:48:10,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:10,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:48:10,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:10,687 INFO L87 Difference]: Start difference. First operand 1564 states and 7030 transitions. Second operand 11 states. [2020-02-10 19:48:10,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:10,883 INFO L93 Difference]: Finished difference Result 2920 states and 11664 transitions. [2020-02-10 19:48:10,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:48:10,883 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:48:10,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:10,890 INFO L225 Difference]: With dead ends: 2920 [2020-02-10 19:48:10,890 INFO L226 Difference]: Without dead ends: 2905 [2020-02-10 19:48:10,890 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:48:10,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2905 states. [2020-02-10 19:48:10,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2905 to 1574. [2020-02-10 19:48:10,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 19:48:10,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7058 transitions. [2020-02-10 19:48:10,959 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7058 transitions. Word has length 28 [2020-02-10 19:48:10,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:10,959 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7058 transitions. [2020-02-10 19:48:10,959 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:48:10,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7058 transitions. [2020-02-10 19:48:10,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:48:10,961 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:10,962 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:10,962 INFO L427 AbstractCegarLoop]: === Iteration 304 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:10,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:10,962 INFO L82 PathProgramCache]: Analyzing trace with hash -2051081392, now seen corresponding path program 296 times [2020-02-10 19:48:10,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:10,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509800461] [2020-02-10 19:48:10,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:10,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:11,409 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 29 [2020-02-10 19:48:11,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:11,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509800461] [2020-02-10 19:48:11,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:11,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:48:11,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660136301] [2020-02-10 19:48:11,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:48:11,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:11,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:48:11,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:11,528 INFO L87 Difference]: Start difference. First operand 1574 states and 7058 transitions. Second operand 11 states. [2020-02-10 19:48:11,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:11,731 INFO L93 Difference]: Finished difference Result 2921 states and 11661 transitions. [2020-02-10 19:48:11,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:48:11,732 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:48:11,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:11,738 INFO L225 Difference]: With dead ends: 2921 [2020-02-10 19:48:11,739 INFO L226 Difference]: Without dead ends: 2900 [2020-02-10 19:48:11,739 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:48:11,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2900 states. [2020-02-10 19:48:11,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2900 to 1569. [2020-02-10 19:48:11,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 19:48:11,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7044 transitions. [2020-02-10 19:48:11,808 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7044 transitions. Word has length 28 [2020-02-10 19:48:11,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:11,808 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7044 transitions. [2020-02-10 19:48:11,808 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:48:11,808 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7044 transitions. [2020-02-10 19:48:11,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:48:11,810 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:11,810 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:11,810 INFO L427 AbstractCegarLoop]: === Iteration 305 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:11,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:11,811 INFO L82 PathProgramCache]: Analyzing trace with hash -109131776, now seen corresponding path program 297 times [2020-02-10 19:48:11,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:11,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673451830] [2020-02-10 19:48:11,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:11,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:12,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 19:48:12,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673451830] [2020-02-10 19:48:12,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:12,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:48:12,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883681850] [2020-02-10 19:48:12,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:48:12,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:12,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:48:12,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:12,341 INFO L87 Difference]: Start difference. First operand 1569 states and 7044 transitions. Second operand 11 states. [2020-02-10 19:48:12,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:12,603 INFO L93 Difference]: Finished difference Result 2921 states and 11661 transitions. [2020-02-10 19:48:12,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:48:12,604 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:48:12,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:12,611 INFO L225 Difference]: With dead ends: 2921 [2020-02-10 19:48:12,611 INFO L226 Difference]: Without dead ends: 2906 [2020-02-10 19:48:12,612 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:48:12,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2906 states. [2020-02-10 19:48:12,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2906 to 1574. [2020-02-10 19:48:12,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 19:48:12,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7053 transitions. [2020-02-10 19:48:12,678 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7053 transitions. Word has length 28 [2020-02-10 19:48:12,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:12,679 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7053 transitions. [2020-02-10 19:48:12,679 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:48:12,679 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7053 transitions. [2020-02-10 19:48:12,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:48:12,681 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:12,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] [2020-02-10 19:48:12,681 INFO L427 AbstractCegarLoop]: === Iteration 306 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:12,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:12,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1553520912, now seen corresponding path program 298 times [2020-02-10 19:48:12,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:12,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250636538] [2020-02-10 19:48:12,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:12,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:13,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 19:48:13,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250636538] [2020-02-10 19:48:13,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:13,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:48:13,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597430139] [2020-02-10 19:48:13,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:48:13,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:13,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:48:13,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:13,207 INFO L87 Difference]: Start difference. First operand 1574 states and 7053 transitions. Second operand 11 states. [2020-02-10 19:48:13,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:13,474 INFO L93 Difference]: Finished difference Result 2923 states and 11660 transitions. [2020-02-10 19:48:13,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:48:13,475 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:48:13,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:13,482 INFO L225 Difference]: With dead ends: 2923 [2020-02-10 19:48:13,482 INFO L226 Difference]: Without dead ends: 2901 [2020-02-10 19:48:13,482 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:48:13,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2901 states. [2020-02-10 19:48:13,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2901 to 1569. [2020-02-10 19:48:13,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 19:48:13,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7039 transitions. [2020-02-10 19:48:13,549 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7039 transitions. Word has length 28 [2020-02-10 19:48:13,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:13,549 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7039 transitions. [2020-02-10 19:48:13,549 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:48:13,549 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7039 transitions. [2020-02-10 19:48:13,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:48:13,551 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:13,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] [2020-02-10 19:48:13,551 INFO L427 AbstractCegarLoop]: === Iteration 307 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:13,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:13,551 INFO L82 PathProgramCache]: Analyzing trace with hash -2048455616, now seen corresponding path program 299 times [2020-02-10 19:48:13,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:13,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334672570] [2020-02-10 19:48:13,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:13,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:14,091 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 31 [2020-02-10 19:48:14,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:14,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334672570] [2020-02-10 19:48:14,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:14,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:48:14,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300030913] [2020-02-10 19:48:14,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:48:14,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:14,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:48:14,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:14,100 INFO L87 Difference]: Start difference. First operand 1569 states and 7039 transitions. Second operand 11 states. [2020-02-10 19:48:14,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:14,359 INFO L93 Difference]: Finished difference Result 2924 states and 11663 transitions. [2020-02-10 19:48:14,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:48:14,360 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:48:14,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:14,366 INFO L225 Difference]: With dead ends: 2924 [2020-02-10 19:48:14,366 INFO L226 Difference]: Without dead ends: 2908 [2020-02-10 19:48:14,367 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:48:14,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2908 states. [2020-02-10 19:48:14,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2908 to 1575. [2020-02-10 19:48:14,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 19:48:14,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7050 transitions. [2020-02-10 19:48:14,434 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7050 transitions. Word has length 28 [2020-02-10 19:48:14,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:14,434 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7050 transitions. [2020-02-10 19:48:14,434 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:48:14,435 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7050 transitions. [2020-02-10 19:48:14,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:48:14,437 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:14,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] [2020-02-10 19:48:14,437 INFO L427 AbstractCegarLoop]: === Iteration 308 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:14,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:14,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1130505426, now seen corresponding path program 300 times [2020-02-10 19:48:14,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:14,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929577739] [2020-02-10 19:48:14,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:14,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:14,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 19:48:14,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929577739] [2020-02-10 19:48:14,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:14,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:48:14,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843973350] [2020-02-10 19:48:14,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:48:14,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:14,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:48:14,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:14,974 INFO L87 Difference]: Start difference. First operand 1575 states and 7050 transitions. Second operand 11 states. [2020-02-10 19:48:15,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:15,248 INFO L93 Difference]: Finished difference Result 2925 states and 11659 transitions. [2020-02-10 19:48:15,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:48:15,248 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:48:15,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:15,255 INFO L225 Difference]: With dead ends: 2925 [2020-02-10 19:48:15,256 INFO L226 Difference]: Without dead ends: 2897 [2020-02-10 19:48:15,256 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:48:15,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2897 states. [2020-02-10 19:48:15,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2897 to 1564. [2020-02-10 19:48:15,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1564 states. [2020-02-10 19:48:15,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 7026 transitions. [2020-02-10 19:48:15,324 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 7026 transitions. Word has length 28 [2020-02-10 19:48:15,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:15,324 INFO L479 AbstractCegarLoop]: Abstraction has 1564 states and 7026 transitions. [2020-02-10 19:48:15,324 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:48:15,324 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 7026 transitions. [2020-02-10 19:48:15,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:48:15,327 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:15,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] [2020-02-10 19:48:15,327 INFO L427 AbstractCegarLoop]: === Iteration 309 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:15,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:15,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1551698926, now seen corresponding path program 301 times [2020-02-10 19:48:15,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:15,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297049986] [2020-02-10 19:48:15,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:15,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:15,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:15,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297049986] [2020-02-10 19:48:15,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:15,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:48:15,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784351409] [2020-02-10 19:48:15,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:48:15,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:15,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:48:15,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:15,870 INFO L87 Difference]: Start difference. First operand 1564 states and 7026 transitions. Second operand 11 states. [2020-02-10 19:48:16,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:16,078 INFO L93 Difference]: Finished difference Result 2911 states and 11636 transitions. [2020-02-10 19:48:16,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:48:16,079 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:48:16,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:16,086 INFO L225 Difference]: With dead ends: 2911 [2020-02-10 19:48:16,086 INFO L226 Difference]: Without dead ends: 2896 [2020-02-10 19:48:16,087 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:48:16,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2896 states. [2020-02-10 19:48:16,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2896 to 1572. [2020-02-10 19:48:16,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 19:48:16,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7048 transitions. [2020-02-10 19:48:16,154 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7048 transitions. Word has length 28 [2020-02-10 19:48:16,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:16,154 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7048 transitions. [2020-02-10 19:48:16,154 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:48:16,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7048 transitions. [2020-02-10 19:48:16,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:48:16,156 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:16,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] [2020-02-10 19:48:16,156 INFO L427 AbstractCegarLoop]: === Iteration 310 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:16,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:16,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1724946618, now seen corresponding path program 302 times [2020-02-10 19:48:16,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:16,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980497630] [2020-02-10 19:48:16,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:16,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:16,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 19:48:16,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980497630] [2020-02-10 19:48:16,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:16,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:48:16,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789776818] [2020-02-10 19:48:16,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:48:16,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:16,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:48:16,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:16,703 INFO L87 Difference]: Start difference. First operand 1572 states and 7048 transitions. Second operand 11 states. [2020-02-10 19:48:16,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:16,934 INFO L93 Difference]: Finished difference Result 2910 states and 11630 transitions. [2020-02-10 19:48:16,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:48:16,935 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:48:16,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:16,942 INFO L225 Difference]: With dead ends: 2910 [2020-02-10 19:48:16,942 INFO L226 Difference]: Without dead ends: 2892 [2020-02-10 19:48:16,942 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:48:16,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2892 states. [2020-02-10 19:48:17,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2892 to 1568. [2020-02-10 19:48:17,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 19:48:17,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7037 transitions. [2020-02-10 19:48:17,009 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7037 transitions. Word has length 28 [2020-02-10 19:48:17,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:17,009 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7037 transitions. [2020-02-10 19:48:17,009 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:48:17,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7037 transitions. [2020-02-10 19:48:17,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:48:17,012 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:17,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] [2020-02-10 19:48:17,012 INFO L427 AbstractCegarLoop]: === Iteration 311 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:17,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:17,012 INFO L82 PathProgramCache]: Analyzing trace with hash 478613546, now seen corresponding path program 303 times [2020-02-10 19:48:17,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:17,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207051835] [2020-02-10 19:48:17,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:17,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:17,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:17,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207051835] [2020-02-10 19:48:17,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:17,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:48:17,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237621371] [2020-02-10 19:48:17,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:48:17,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:17,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:48:17,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:17,527 INFO L87 Difference]: Start difference. First operand 1568 states and 7037 transitions. Second operand 11 states. [2020-02-10 19:48:17,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:17,730 INFO L93 Difference]: Finished difference Result 2915 states and 11641 transitions. [2020-02-10 19:48:17,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:48:17,731 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:48:17,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:17,738 INFO L225 Difference]: With dead ends: 2915 [2020-02-10 19:48:17,738 INFO L226 Difference]: Without dead ends: 2900 [2020-02-10 19:48:17,738 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:48:17,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2900 states. [2020-02-10 19:48:17,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2900 to 1573. [2020-02-10 19:48:17,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 19:48:17,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7046 transitions. [2020-02-10 19:48:17,806 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7046 transitions. Word has length 28 [2020-02-10 19:48:17,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:17,806 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7046 transitions. [2020-02-10 19:48:17,806 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:48:17,806 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7046 transitions. [2020-02-10 19:48:17,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:48:17,808 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:17,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] [2020-02-10 19:48:17,808 INFO L427 AbstractCegarLoop]: === Iteration 312 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:17,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:17,808 INFO L82 PathProgramCache]: Analyzing trace with hash 2141266234, now seen corresponding path program 304 times [2020-02-10 19:48:17,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:17,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113243378] [2020-02-10 19:48:17,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:17,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:18,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 19:48:18,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113243378] [2020-02-10 19:48:18,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:18,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:48:18,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563184858] [2020-02-10 19:48:18,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:48:18,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:18,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:48:18,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:18,326 INFO L87 Difference]: Start difference. First operand 1573 states and 7046 transitions. Second operand 11 states. [2020-02-10 19:48:18,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:18,501 INFO L93 Difference]: Finished difference Result 2917 states and 11640 transitions. [2020-02-10 19:48:18,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:48:18,501 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:48:18,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:18,509 INFO L225 Difference]: With dead ends: 2917 [2020-02-10 19:48:18,509 INFO L226 Difference]: Without dead ends: 2895 [2020-02-10 19:48:18,509 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:48:18,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2895 states. [2020-02-10 19:48:18,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2895 to 1568. [2020-02-10 19:48:18,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 19:48:18,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7033 transitions. [2020-02-10 19:48:18,577 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7033 transitions. Word has length 28 [2020-02-10 19:48:18,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:18,578 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7033 transitions. [2020-02-10 19:48:18,578 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:48:18,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7033 transitions. [2020-02-10 19:48:18,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:48:18,580 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:18,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] [2020-02-10 19:48:18,580 INFO L427 AbstractCegarLoop]: === Iteration 313 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:18,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:18,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1727572394, now seen corresponding path program 305 times [2020-02-10 19:48:18,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:18,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185143694] [2020-02-10 19:48:18,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:18,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:19,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:19,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185143694] [2020-02-10 19:48:19,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:19,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:48:19,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080146747] [2020-02-10 19:48:19,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:48:19,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:19,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:48:19,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:19,111 INFO L87 Difference]: Start difference. First operand 1568 states and 7033 transitions. Second operand 11 states. [2020-02-10 19:48:19,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:19,277 INFO L93 Difference]: Finished difference Result 2912 states and 11630 transitions. [2020-02-10 19:48:19,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:48:19,277 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:48:19,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:19,284 INFO L225 Difference]: With dead ends: 2912 [2020-02-10 19:48:19,285 INFO L226 Difference]: Without dead ends: 2898 [2020-02-10 19:48:19,285 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:48:19,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2898 states. [2020-02-10 19:48:19,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2898 to 1572. [2020-02-10 19:48:19,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 19:48:19,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7040 transitions. [2020-02-10 19:48:19,353 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7040 transitions. Word has length 28 [2020-02-10 19:48:19,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:19,353 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7040 transitions. [2020-02-10 19:48:19,354 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:48:19,354 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7040 transitions. [2020-02-10 19:48:19,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:48:19,356 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:19,356 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:19,356 INFO L427 AbstractCegarLoop]: === Iteration 314 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:19,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:19,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1077989906, now seen corresponding path program 306 times [2020-02-10 19:48:19,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:19,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387491665] [2020-02-10 19:48:19,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:19,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:19,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:19,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387491665] [2020-02-10 19:48:19,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:19,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:48:19,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340124730] [2020-02-10 19:48:19,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:48:19,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:19,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:48:19,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:19,881 INFO L87 Difference]: Start difference. First operand 1572 states and 7040 transitions. Second operand 11 states. [2020-02-10 19:48:20,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:20,079 INFO L93 Difference]: Finished difference Result 2915 states and 11632 transitions. [2020-02-10 19:48:20,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:48:20,080 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:48:20,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:20,087 INFO L225 Difference]: With dead ends: 2915 [2020-02-10 19:48:20,088 INFO L226 Difference]: Without dead ends: 2890 [2020-02-10 19:48:20,088 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:48:20,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2890 states. [2020-02-10 19:48:20,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2890 to 1564. [2020-02-10 19:48:20,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1564 states. [2020-02-10 19:48:20,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 7022 transitions. [2020-02-10 19:48:20,158 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 7022 transitions. Word has length 28 [2020-02-10 19:48:20,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:20,158 INFO L479 AbstractCegarLoop]: Abstraction has 1564 states and 7022 transitions. [2020-02-10 19:48:20,158 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:48:20,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 7022 transitions. [2020-02-10 19:48:20,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:48:20,160 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:20,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] [2020-02-10 19:48:20,161 INFO L427 AbstractCegarLoop]: === Iteration 315 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:20,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:20,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1988062768, now seen corresponding path program 307 times [2020-02-10 19:48:20,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:20,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576798166] [2020-02-10 19:48:20,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:20,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:20,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:20,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576798166] [2020-02-10 19:48:20,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:20,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:48:20,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594323541] [2020-02-10 19:48:20,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:48:20,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:20,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:48:20,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:20,685 INFO L87 Difference]: Start difference. First operand 1564 states and 7022 transitions. Second operand 11 states. [2020-02-10 19:48:20,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:20,856 INFO L93 Difference]: Finished difference Result 2915 states and 11641 transitions. [2020-02-10 19:48:20,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:48:20,856 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:48:20,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:20,863 INFO L225 Difference]: With dead ends: 2915 [2020-02-10 19:48:20,863 INFO L226 Difference]: Without dead ends: 2899 [2020-02-10 19:48:20,863 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:48:20,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2899 states. [2020-02-10 19:48:20,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2899 to 1572. [2020-02-10 19:48:20,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 19:48:20,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7044 transitions. [2020-02-10 19:48:20,931 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7044 transitions. Word has length 28 [2020-02-10 19:48:20,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:20,932 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7044 transitions. [2020-02-10 19:48:20,932 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:48:20,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7044 transitions. [2020-02-10 19:48:20,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:48:20,934 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:20,934 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:20,934 INFO L427 AbstractCegarLoop]: === Iteration 316 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:20,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:20,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1735449722, now seen corresponding path program 308 times [2020-02-10 19:48:20,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:20,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837923926] [2020-02-10 19:48:20,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:20,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:21,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:21,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837923926] [2020-02-10 19:48:21,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:21,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:48:21,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485094979] [2020-02-10 19:48:21,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:48:21,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:21,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:48:21,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:21,467 INFO L87 Difference]: Start difference. First operand 1572 states and 7044 transitions. Second operand 11 states. [2020-02-10 19:48:21,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:21,664 INFO L93 Difference]: Finished difference Result 2913 states and 11633 transitions. [2020-02-10 19:48:21,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:48:21,664 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:48:21,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:21,672 INFO L225 Difference]: With dead ends: 2913 [2020-02-10 19:48:21,672 INFO L226 Difference]: Without dead ends: 2895 [2020-02-10 19:48:21,673 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:48:21,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2895 states. [2020-02-10 19:48:21,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2895 to 1568. [2020-02-10 19:48:21,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 19:48:21,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7033 transitions. [2020-02-10 19:48:21,739 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7033 transitions. Word has length 28 [2020-02-10 19:48:21,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:21,740 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7033 transitions. [2020-02-10 19:48:21,740 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:48:21,740 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7033 transitions. [2020-02-10 19:48:21,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:48:21,743 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:21,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] [2020-02-10 19:48:21,743 INFO L427 AbstractCegarLoop]: === Iteration 317 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:21,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:21,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1233819148, now seen corresponding path program 309 times [2020-02-10 19:48:21,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:21,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506435489] [2020-02-10 19:48:21,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:21,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:22,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 19:48:22,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506435489] [2020-02-10 19:48:22,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:22,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:48:22,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373638520] [2020-02-10 19:48:22,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:48:22,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:22,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:48:22,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:22,295 INFO L87 Difference]: Start difference. First operand 1568 states and 7033 transitions. Second operand 11 states. [2020-02-10 19:48:22,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:22,465 INFO L93 Difference]: Finished difference Result 2920 states and 11649 transitions. [2020-02-10 19:48:22,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:48:22,466 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:48:22,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:22,473 INFO L225 Difference]: With dead ends: 2920 [2020-02-10 19:48:22,473 INFO L226 Difference]: Without dead ends: 2904 [2020-02-10 19:48:22,473 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:48:22,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2904 states. [2020-02-10 19:48:22,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2904 to 1574. [2020-02-10 19:48:22,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 19:48:22,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7044 transitions. [2020-02-10 19:48:22,541 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7044 transitions. Word has length 28 [2020-02-10 19:48:22,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:22,541 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7044 transitions. [2020-02-10 19:48:22,541 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:48:22,541 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7044 transitions. [2020-02-10 19:48:22,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:48:22,543 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:22,543 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:22,543 INFO L427 AbstractCegarLoop]: === Iteration 318 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:22,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:22,544 INFO L82 PathProgramCache]: Analyzing trace with hash -2143197958, now seen corresponding path program 310 times [2020-02-10 19:48:22,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:22,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193077891] [2020-02-10 19:48:22,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:22,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:23,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 19:48:23,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193077891] [2020-02-10 19:48:23,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:23,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:48:23,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028488163] [2020-02-10 19:48:23,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:48:23,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:23,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:48:23,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:23,077 INFO L87 Difference]: Start difference. First operand 1574 states and 7044 transitions. Second operand 11 states. [2020-02-10 19:48:23,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:23,281 INFO L93 Difference]: Finished difference Result 2921 states and 11645 transitions. [2020-02-10 19:48:23,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:48:23,282 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:48:23,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:23,289 INFO L225 Difference]: With dead ends: 2921 [2020-02-10 19:48:23,289 INFO L226 Difference]: Without dead ends: 2898 [2020-02-10 19:48:23,290 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:48:23,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2898 states. [2020-02-10 19:48:23,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2898 to 1568. [2020-02-10 19:48:23,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 19:48:23,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7029 transitions. [2020-02-10 19:48:23,356 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7029 transitions. Word has length 28 [2020-02-10 19:48:23,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:23,356 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7029 transitions. [2020-02-10 19:48:23,357 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:48:23,357 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7029 transitions. [2020-02-10 19:48:23,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:48:23,359 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:23,359 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:23,359 INFO L427 AbstractCegarLoop]: === Iteration 319 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:23,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:23,359 INFO L82 PathProgramCache]: Analyzing trace with hash 127134540, now seen corresponding path program 311 times [2020-02-10 19:48:23,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:23,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988467148] [2020-02-10 19:48:23,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:23,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:23,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:23,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988467148] [2020-02-10 19:48:23,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:23,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:48:23,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281140558] [2020-02-10 19:48:23,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:48:23,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:23,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:48:23,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:23,918 INFO L87 Difference]: Start difference. First operand 1568 states and 7029 transitions. Second operand 11 states. [2020-02-10 19:48:24,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:24,089 INFO L93 Difference]: Finished difference Result 2914 states and 11631 transitions. [2020-02-10 19:48:24,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:48:24,089 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:48:24,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:24,097 INFO L225 Difference]: With dead ends: 2914 [2020-02-10 19:48:24,097 INFO L226 Difference]: Without dead ends: 2900 [2020-02-10 19:48:24,097 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:48:24,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2900 states. [2020-02-10 19:48:24,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2900 to 1572. [2020-02-10 19:48:24,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 19:48:24,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7036 transitions. [2020-02-10 19:48:24,164 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7036 transitions. Word has length 28 [2020-02-10 19:48:24,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:24,164 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7036 transitions. [2020-02-10 19:48:24,164 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:48:24,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7036 transitions. [2020-02-10 19:48:24,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:48:24,167 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:24,167 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:24,167 INFO L427 AbstractCegarLoop]: === Iteration 320 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:24,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:24,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1616539536, now seen corresponding path program 312 times [2020-02-10 19:48:24,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:24,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227671665] [2020-02-10 19:48:24,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:24,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:24,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 19:48:24,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227671665] [2020-02-10 19:48:24,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:24,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:48:24,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638810856] [2020-02-10 19:48:24,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:48:24,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:24,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:48:24,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:24,693 INFO L87 Difference]: Start difference. First operand 1572 states and 7036 transitions. Second operand 11 states. [2020-02-10 19:48:24,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:24,865 INFO L93 Difference]: Finished difference Result 2917 states and 11633 transitions. [2020-02-10 19:48:24,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:48:24,865 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:48:24,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:24,873 INFO L225 Difference]: With dead ends: 2917 [2020-02-10 19:48:24,873 INFO L226 Difference]: Without dead ends: 2888 [2020-02-10 19:48:24,873 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:48:24,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2888 states. [2020-02-10 19:48:24,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2888 to 1560. [2020-02-10 19:48:24,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2020-02-10 19:48:24,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 7011 transitions. [2020-02-10 19:48:24,940 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 7011 transitions. Word has length 28 [2020-02-10 19:48:24,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:24,940 INFO L479 AbstractCegarLoop]: Abstraction has 1560 states and 7011 transitions. [2020-02-10 19:48:24,940 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:48:24,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 7011 transitions. [2020-02-10 19:48:24,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:48:24,942 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:24,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] [2020-02-10 19:48:24,942 INFO L427 AbstractCegarLoop]: === Iteration 321 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:24,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:24,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1953338296, now seen corresponding path program 313 times [2020-02-10 19:48:24,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:24,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903122665] [2020-02-10 19:48:24,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:24,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:25,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 19:48:25,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903122665] [2020-02-10 19:48:25,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:25,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:48:25,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835372696] [2020-02-10 19:48:25,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:48:25,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:25,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:48:25,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:25,462 INFO L87 Difference]: Start difference. First operand 1560 states and 7011 transitions. Second operand 11 states. [2020-02-10 19:48:25,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:25,632 INFO L93 Difference]: Finished difference Result 2937 states and 11697 transitions. [2020-02-10 19:48:25,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:48:25,633 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:48:25,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:25,640 INFO L225 Difference]: With dead ends: 2937 [2020-02-10 19:48:25,640 INFO L226 Difference]: Without dead ends: 2922 [2020-02-10 19:48:25,640 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:48:25,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2922 states. [2020-02-10 19:48:25,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2922 to 1576. [2020-02-10 19:48:25,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 19:48:25,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7063 transitions. [2020-02-10 19:48:25,707 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7063 transitions. Word has length 28 [2020-02-10 19:48:25,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:25,707 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7063 transitions. [2020-02-10 19:48:25,707 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:48:25,707 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7063 transitions. [2020-02-10 19:48:25,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:48:25,709 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:25,709 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:25,710 INFO L427 AbstractCegarLoop]: === Iteration 322 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:25,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:25,710 INFO L82 PathProgramCache]: Analyzing trace with hash -463933300, now seen corresponding path program 314 times [2020-02-10 19:48:25,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:25,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046739404] [2020-02-10 19:48:25,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:25,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:26,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:26,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046739404] [2020-02-10 19:48:26,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:26,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:48:26,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232121349] [2020-02-10 19:48:26,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:48:26,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:26,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:48:26,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:26,242 INFO L87 Difference]: Start difference. First operand 1576 states and 7063 transitions. Second operand 11 states. [2020-02-10 19:48:26,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:26,389 INFO L93 Difference]: Finished difference Result 2942 states and 11701 transitions. [2020-02-10 19:48:26,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:48:26,389 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:48:26,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:26,397 INFO L225 Difference]: With dead ends: 2942 [2020-02-10 19:48:26,397 INFO L226 Difference]: Without dead ends: 2916 [2020-02-10 19:48:26,397 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:48:26,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2916 states. [2020-02-10 19:48:26,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2916 to 1570. [2020-02-10 19:48:26,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 19:48:26,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7047 transitions. [2020-02-10 19:48:26,465 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7047 transitions. Word has length 28 [2020-02-10 19:48:26,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:26,465 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7047 transitions. [2020-02-10 19:48:26,465 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:48:26,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7047 transitions. [2020-02-10 19:48:26,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:48:26,467 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:26,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] [2020-02-10 19:48:26,467 INFO L427 AbstractCegarLoop]: === Iteration 323 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:26,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:26,467 INFO L82 PathProgramCache]: Analyzing trace with hash 195458240, now seen corresponding path program 315 times [2020-02-10 19:48:26,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:26,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192069492] [2020-02-10 19:48:26,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:26,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:26,984 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 30 [2020-02-10 19:48:26,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 19:48:26,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192069492] [2020-02-10 19:48:26,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:26,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:48:26,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947857539] [2020-02-10 19:48:26,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:48:26,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:26,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:48:26,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:26,992 INFO L87 Difference]: Start difference. First operand 1570 states and 7047 transitions. Second operand 11 states. [2020-02-10 19:48:27,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:27,183 INFO L93 Difference]: Finished difference Result 2929 states and 11676 transitions. [2020-02-10 19:48:27,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:48:27,183 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:48:27,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:27,190 INFO L225 Difference]: With dead ends: 2929 [2020-02-10 19:48:27,191 INFO L226 Difference]: Without dead ends: 2914 [2020-02-10 19:48:27,191 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:48:27,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2914 states. [2020-02-10 19:48:27,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2914 to 1574. [2020-02-10 19:48:27,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 19:48:27,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7054 transitions. [2020-02-10 19:48:27,277 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7054 transitions. Word has length 28 [2020-02-10 19:48:27,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:27,277 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7054 transitions. [2020-02-10 19:48:27,277 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:48:27,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7054 transitions. [2020-02-10 19:48:27,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:48:27,279 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:27,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] [2020-02-10 19:48:27,280 INFO L427 AbstractCegarLoop]: === Iteration 324 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:27,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:27,280 INFO L82 PathProgramCache]: Analyzing trace with hash 368705932, now seen corresponding path program 316 times [2020-02-10 19:48:27,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:27,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274333455] [2020-02-10 19:48:27,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:27,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:27,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:27,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274333455] [2020-02-10 19:48:27,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:27,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:48:27,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805146535] [2020-02-10 19:48:27,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:48:27,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:27,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:48:27,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:27,803 INFO L87 Difference]: Start difference. First operand 1574 states and 7054 transitions. Second operand 11 states. [2020-02-10 19:48:27,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:27,980 INFO L93 Difference]: Finished difference Result 2928 states and 11670 transitions. [2020-02-10 19:48:27,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:48:27,980 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:48:27,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:27,987 INFO L225 Difference]: With dead ends: 2928 [2020-02-10 19:48:27,987 INFO L226 Difference]: Without dead ends: 2910 [2020-02-10 19:48:27,988 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:48:28,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2910 states. [2020-02-10 19:48:28,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2910 to 1570. [2020-02-10 19:48:28,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 19:48:28,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7043 transitions. [2020-02-10 19:48:28,055 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7043 transitions. Word has length 28 [2020-02-10 19:48:28,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:28,055 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7043 transitions. [2020-02-10 19:48:28,055 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:48:28,055 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7043 transitions. [2020-02-10 19:48:28,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:48:28,058 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:28,058 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:28,058 INFO L427 AbstractCegarLoop]: === Iteration 325 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:28,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:28,058 INFO L82 PathProgramCache]: Analyzing trace with hash 611777856, now seen corresponding path program 317 times [2020-02-10 19:48:28,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:28,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999752971] [2020-02-10 19:48:28,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:28,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:28,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:28,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999752971] [2020-02-10 19:48:28,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:28,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:48:28,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464616894] [2020-02-10 19:48:28,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:48:28,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:28,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:48:28,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:28,580 INFO L87 Difference]: Start difference. First operand 1570 states and 7043 transitions. Second operand 11 states. [2020-02-10 19:48:28,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:28,718 INFO L93 Difference]: Finished difference Result 2940 states and 11692 transitions. [2020-02-10 19:48:28,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:48:28,719 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:48:28,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:28,725 INFO L225 Difference]: With dead ends: 2940 [2020-02-10 19:48:28,726 INFO L226 Difference]: Without dead ends: 2920 [2020-02-10 19:48:28,726 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:48:28,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2920 states. [2020-02-10 19:48:28,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2920 to 1575. [2020-02-10 19:48:28,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 19:48:28,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7051 transitions. [2020-02-10 19:48:28,795 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7051 transitions. Word has length 28 [2020-02-10 19:48:28,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:28,795 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7051 transitions. [2020-02-10 19:48:28,795 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:48:28,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7051 transitions. [2020-02-10 19:48:28,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:48:28,797 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:28,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] [2020-02-10 19:48:28,797 INFO L427 AbstractCegarLoop]: === Iteration 326 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:28,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:28,798 INFO L82 PathProgramCache]: Analyzing trace with hash -704379448, now seen corresponding path program 318 times [2020-02-10 19:48:28,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:28,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689635603] [2020-02-10 19:48:28,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:28,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:29,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 19:48:29,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689635603] [2020-02-10 19:48:29,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:29,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:48:29,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947313530] [2020-02-10 19:48:29,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:48:29,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:29,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:48:29,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:29,316 INFO L87 Difference]: Start difference. First operand 1575 states and 7051 transitions. Second operand 11 states. [2020-02-10 19:48:29,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:29,495 INFO L93 Difference]: Finished difference Result 2934 states and 11676 transitions. [2020-02-10 19:48:29,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:48:29,495 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:48:29,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:29,503 INFO L225 Difference]: With dead ends: 2934 [2020-02-10 19:48:29,503 INFO L226 Difference]: Without dead ends: 2910 [2020-02-10 19:48:29,503 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:48:29,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2910 states. [2020-02-10 19:48:29,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2910 to 1565. [2020-02-10 19:48:29,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1565 states. [2020-02-10 19:48:29,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 7029 transitions. [2020-02-10 19:48:29,572 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 7029 transitions. Word has length 28 [2020-02-10 19:48:29,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:29,572 INFO L479 AbstractCegarLoop]: Abstraction has 1565 states and 7029 transitions. [2020-02-10 19:48:29,572 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:48:29,572 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 7029 transitions. [2020-02-10 19:48:29,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:48:29,574 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:29,575 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:29,575 INFO L427 AbstractCegarLoop]: === Iteration 327 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:29,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:29,575 INFO L82 PathProgramCache]: Analyzing trace with hash -859246708, now seen corresponding path program 319 times [2020-02-10 19:48:29,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:29,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731549913] [2020-02-10 19:48:29,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:29,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:30,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:30,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731549913] [2020-02-10 19:48:30,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:30,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:48:30,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016179542] [2020-02-10 19:48:30,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:48:30,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:30,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:48:30,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:30,094 INFO L87 Difference]: Start difference. First operand 1565 states and 7029 transitions. Second operand 11 states. [2020-02-10 19:48:30,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:30,296 INFO L93 Difference]: Finished difference Result 2945 states and 11714 transitions. [2020-02-10 19:48:30,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:48:30,296 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:48:30,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:30,304 INFO L225 Difference]: With dead ends: 2945 [2020-02-10 19:48:30,304 INFO L226 Difference]: Without dead ends: 2930 [2020-02-10 19:48:30,304 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:48:30,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2020-02-10 19:48:30,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 1577. [2020-02-10 19:48:30,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 19:48:30,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7062 transitions. [2020-02-10 19:48:30,377 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7062 transitions. Word has length 28 [2020-02-10 19:48:30,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:30,377 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7062 transitions. [2020-02-10 19:48:30,377 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:48:30,377 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7062 transitions. [2020-02-10 19:48:30,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:48:30,380 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:30,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] [2020-02-10 19:48:30,380 INFO L427 AbstractCegarLoop]: === Iteration 328 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:30,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:30,380 INFO L82 PathProgramCache]: Analyzing trace with hash 630158288, now seen corresponding path program 320 times [2020-02-10 19:48:30,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:30,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693040209] [2020-02-10 19:48:30,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:30,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:30,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 19:48:30,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693040209] [2020-02-10 19:48:30,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:30,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:48:30,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852895131] [2020-02-10 19:48:30,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:48:30,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:30,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:48:30,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:30,912 INFO L87 Difference]: Start difference. First operand 1577 states and 7062 transitions. Second operand 11 states. [2020-02-10 19:48:31,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:31,076 INFO L93 Difference]: Finished difference Result 2950 states and 11718 transitions. [2020-02-10 19:48:31,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:48:31,077 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:48:31,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:31,084 INFO L225 Difference]: With dead ends: 2950 [2020-02-10 19:48:31,084 INFO L226 Difference]: Without dead ends: 2924 [2020-02-10 19:48:31,084 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:48:31,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2924 states. [2020-02-10 19:48:31,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2924 to 1571. [2020-02-10 19:48:31,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 19:48:31,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7045 transitions. [2020-02-10 19:48:31,151 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7045 transitions. Word has length 28 [2020-02-10 19:48:31,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:31,152 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7045 transitions. [2020-02-10 19:48:31,152 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:48:31,152 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7045 transitions. [2020-02-10 19:48:31,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:48:31,154 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:31,154 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:31,154 INFO L427 AbstractCegarLoop]: === Iteration 329 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:31,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:31,154 INFO L82 PathProgramCache]: Analyzing trace with hash 216464448, now seen corresponding path program 321 times [2020-02-10 19:48:31,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:31,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350145241] [2020-02-10 19:48:31,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:31,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:31,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:31,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350145241] [2020-02-10 19:48:31,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:31,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:48:31,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984064584] [2020-02-10 19:48:31,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:48:31,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:31,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:48:31,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:31,665 INFO L87 Difference]: Start difference. First operand 1571 states and 7045 transitions. Second operand 11 states. [2020-02-10 19:48:31,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:31,835 INFO L93 Difference]: Finished difference Result 2941 states and 11701 transitions. [2020-02-10 19:48:31,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:48:31,836 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:48:31,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:31,843 INFO L225 Difference]: With dead ends: 2941 [2020-02-10 19:48:31,843 INFO L226 Difference]: Without dead ends: 2926 [2020-02-10 19:48:31,843 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:48:31,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2926 states. [2020-02-10 19:48:31,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2926 to 1576. [2020-02-10 19:48:31,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 19:48:31,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7054 transitions. [2020-02-10 19:48:31,911 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7054 transitions. Word has length 28 [2020-02-10 19:48:31,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:31,911 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7054 transitions. [2020-02-10 19:48:31,911 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:48:31,911 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7054 transitions. [2020-02-10 19:48:31,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:48:31,913 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:31,913 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:31,913 INFO L427 AbstractCegarLoop]: === Iteration 330 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:31,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:31,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1879117136, now seen corresponding path program 322 times [2020-02-10 19:48:31,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:31,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493339210] [2020-02-10 19:48:31,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:31,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:32,455 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 30 [2020-02-10 19:48:32,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 19:48:32,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493339210] [2020-02-10 19:48:32,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:32,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:48:32,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356284692] [2020-02-10 19:48:32,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:48:32,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:32,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:48:32,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:32,463 INFO L87 Difference]: Start difference. First operand 1576 states and 7054 transitions. Second operand 11 states. [2020-02-10 19:48:32,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:32,640 INFO L93 Difference]: Finished difference Result 2943 states and 11700 transitions. [2020-02-10 19:48:32,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:48:32,641 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:48:32,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:32,648 INFO L225 Difference]: With dead ends: 2943 [2020-02-10 19:48:32,648 INFO L226 Difference]: Without dead ends: 2921 [2020-02-10 19:48:32,648 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:48:32,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2921 states. [2020-02-10 19:48:32,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2921 to 1571. [2020-02-10 19:48:32,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 19:48:32,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7040 transitions. [2020-02-10 19:48:32,717 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7040 transitions. Word has length 28 [2020-02-10 19:48:32,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:32,717 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7040 transitions. [2020-02-10 19:48:32,717 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:48:32,717 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7040 transitions. [2020-02-10 19:48:32,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:48:32,719 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:32,719 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:32,719 INFO L427 AbstractCegarLoop]: === Iteration 331 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:32,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:32,720 INFO L82 PathProgramCache]: Analyzing trace with hash 632784064, now seen corresponding path program 323 times [2020-02-10 19:48:32,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:32,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294119381] [2020-02-10 19:48:32,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:32,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:33,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 19:48:33,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294119381] [2020-02-10 19:48:33,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:33,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:48:33,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46086986] [2020-02-10 19:48:33,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:48:33,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:33,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:48:33,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:33,256 INFO L87 Difference]: Start difference. First operand 1571 states and 7040 transitions. Second operand 11 states. [2020-02-10 19:48:33,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:33,396 INFO L93 Difference]: Finished difference Result 2954 states and 11722 transitions. [2020-02-10 19:48:33,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:48:33,397 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:48:33,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:33,403 INFO L225 Difference]: With dead ends: 2954 [2020-02-10 19:48:33,403 INFO L226 Difference]: Without dead ends: 2934 [2020-02-10 19:48:33,403 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:48:33,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2934 states. [2020-02-10 19:48:33,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2934 to 1579. [2020-02-10 19:48:33,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 19:48:33,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7054 transitions. [2020-02-10 19:48:33,472 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7054 transitions. Word has length 28 [2020-02-10 19:48:33,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:33,472 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7054 transitions. [2020-02-10 19:48:33,472 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:48:33,472 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7054 transitions. [2020-02-10 19:48:33,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:48:33,474 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:33,474 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:33,475 INFO L427 AbstractCegarLoop]: === Iteration 332 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:33,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:33,475 INFO L82 PathProgramCache]: Analyzing trace with hash 806031756, now seen corresponding path program 324 times [2020-02-10 19:48:33,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:33,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71642106] [2020-02-10 19:48:33,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:33,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:34,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:34,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71642106] [2020-02-10 19:48:34,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:34,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:48:34,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749450013] [2020-02-10 19:48:34,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:48:34,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:34,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:48:34,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:34,018 INFO L87 Difference]: Start difference. First operand 1579 states and 7054 transitions. Second operand 11 states. [2020-02-10 19:48:34,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:34,205 INFO L93 Difference]: Finished difference Result 2951 states and 11709 transitions. [2020-02-10 19:48:34,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:48:34,205 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:48:34,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:34,213 INFO L225 Difference]: With dead ends: 2951 [2020-02-10 19:48:34,213 INFO L226 Difference]: Without dead ends: 2920 [2020-02-10 19:48:34,213 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:48:34,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2920 states. [2020-02-10 19:48:34,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2920 to 1565. [2020-02-10 19:48:34,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1565 states. [2020-02-10 19:48:34,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 7024 transitions. [2020-02-10 19:48:34,280 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 7024 transitions. Word has length 28 [2020-02-10 19:48:34,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:34,281 INFO L479 AbstractCegarLoop]: Abstraction has 1565 states and 7024 transitions. [2020-02-10 19:48:34,281 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:48:34,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 7024 transitions. [2020-02-10 19:48:34,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:48:34,283 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:34,283 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:34,283 INFO L427 AbstractCegarLoop]: === Iteration 333 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:34,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:34,283 INFO L82 PathProgramCache]: Analyzing trace with hash -817234292, now seen corresponding path program 325 times [2020-02-10 19:48:34,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:34,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099935437] [2020-02-10 19:48:34,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:34,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:34,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:34,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099935437] [2020-02-10 19:48:34,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:34,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:48:34,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893056479] [2020-02-10 19:48:34,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:48:34,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:34,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:48:34,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:34,808 INFO L87 Difference]: Start difference. First operand 1565 states and 7024 transitions. Second operand 11 states. [2020-02-10 19:48:35,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:35,014 INFO L93 Difference]: Finished difference Result 2923 states and 11659 transitions. [2020-02-10 19:48:35,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:48:35,015 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:48:35,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:35,022 INFO L225 Difference]: With dead ends: 2923 [2020-02-10 19:48:35,022 INFO L226 Difference]: Without dead ends: 2908 [2020-02-10 19:48:35,022 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:48:35,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2908 states. [2020-02-10 19:48:35,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2908 to 1573. [2020-02-10 19:48:35,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 19:48:35,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7046 transitions. [2020-02-10 19:48:35,089 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7046 transitions. Word has length 28 [2020-02-10 19:48:35,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:35,089 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7046 transitions. [2020-02-10 19:48:35,089 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:48:35,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7046 transitions. [2020-02-10 19:48:35,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:48:35,092 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:35,092 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:35,092 INFO L427 AbstractCegarLoop]: === Iteration 334 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:35,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:35,092 INFO L82 PathProgramCache]: Analyzing trace with hash -643986600, now seen corresponding path program 326 times [2020-02-10 19:48:35,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:35,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118257421] [2020-02-10 19:48:35,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:35,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:35,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:35,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118257421] [2020-02-10 19:48:35,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:35,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:48:35,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036574482] [2020-02-10 19:48:35,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:48:35,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:35,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:48:35,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:35,595 INFO L87 Difference]: Start difference. First operand 1573 states and 7046 transitions. Second operand 11 states. [2020-02-10 19:48:35,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:35,787 INFO L93 Difference]: Finished difference Result 2922 states and 11653 transitions. [2020-02-10 19:48:35,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:48:35,788 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:48:35,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:35,795 INFO L225 Difference]: With dead ends: 2922 [2020-02-10 19:48:35,795 INFO L226 Difference]: Without dead ends: 2904 [2020-02-10 19:48:35,796 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:48:35,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2904 states. [2020-02-10 19:48:35,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2904 to 1569. [2020-02-10 19:48:35,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 19:48:35,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7035 transitions. [2020-02-10 19:48:35,864 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7035 transitions. Word has length 28 [2020-02-10 19:48:35,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:35,864 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7035 transitions. [2020-02-10 19:48:35,865 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:48:35,865 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7035 transitions. [2020-02-10 19:48:35,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:48:35,867 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:35,867 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:35,867 INFO L427 AbstractCegarLoop]: === Iteration 335 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:35,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:35,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1890319672, now seen corresponding path program 327 times [2020-02-10 19:48:35,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:35,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441125693] [2020-02-10 19:48:35,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:35,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:36,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 19:48:36,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441125693] [2020-02-10 19:48:36,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:36,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:48:36,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126331052] [2020-02-10 19:48:36,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:48:36,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:36,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:48:36,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:36,385 INFO L87 Difference]: Start difference. First operand 1569 states and 7035 transitions. Second operand 11 states. [2020-02-10 19:48:36,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:36,573 INFO L93 Difference]: Finished difference Result 2927 states and 11664 transitions. [2020-02-10 19:48:36,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:48:36,573 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:48:36,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:36,580 INFO L225 Difference]: With dead ends: 2927 [2020-02-10 19:48:36,580 INFO L226 Difference]: Without dead ends: 2912 [2020-02-10 19:48:36,581 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:48:36,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2912 states. [2020-02-10 19:48:36,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2912 to 1574. [2020-02-10 19:48:36,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 19:48:36,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7044 transitions. [2020-02-10 19:48:36,649 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7044 transitions. Word has length 28 [2020-02-10 19:48:36,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:36,649 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7044 transitions. [2020-02-10 19:48:36,650 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:48:36,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7044 transitions. [2020-02-10 19:48:36,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:48:36,652 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:36,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] [2020-02-10 19:48:36,652 INFO L427 AbstractCegarLoop]: === Iteration 336 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:36,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:36,652 INFO L82 PathProgramCache]: Analyzing trace with hash -227666984, now seen corresponding path program 328 times [2020-02-10 19:48:36,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:36,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411873824] [2020-02-10 19:48:36,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:36,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:37,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:37,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411873824] [2020-02-10 19:48:37,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:37,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:48:37,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888801015] [2020-02-10 19:48:37,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:48:37,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:37,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:48:37,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:37,169 INFO L87 Difference]: Start difference. First operand 1574 states and 7044 transitions. Second operand 11 states. [2020-02-10 19:48:37,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:37,355 INFO L93 Difference]: Finished difference Result 2929 states and 11663 transitions. [2020-02-10 19:48:37,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:48:37,355 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:48:37,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:37,362 INFO L225 Difference]: With dead ends: 2929 [2020-02-10 19:48:37,362 INFO L226 Difference]: Without dead ends: 2907 [2020-02-10 19:48:37,362 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:48:37,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2907 states. [2020-02-10 19:48:37,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2907 to 1569. [2020-02-10 19:48:37,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 19:48:37,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7031 transitions. [2020-02-10 19:48:37,431 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7031 transitions. Word has length 28 [2020-02-10 19:48:37,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:37,431 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7031 transitions. [2020-02-10 19:48:37,431 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:48:37,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7031 transitions. [2020-02-10 19:48:37,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:48:37,433 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:37,433 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:37,433 INFO L427 AbstractCegarLoop]: === Iteration 337 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:37,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:37,434 INFO L82 PathProgramCache]: Analyzing trace with hash -641360824, now seen corresponding path program 329 times [2020-02-10 19:48:37,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:37,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862963353] [2020-02-10 19:48:37,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:37,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:37,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 19:48:37,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862963353] [2020-02-10 19:48:37,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:37,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:48:37,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785515523] [2020-02-10 19:48:37,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:48:37,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:37,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:48:37,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:37,963 INFO L87 Difference]: Start difference. First operand 1569 states and 7031 transitions. Second operand 11 states. [2020-02-10 19:48:38,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:38,146 INFO L93 Difference]: Finished difference Result 2924 states and 11653 transitions. [2020-02-10 19:48:38,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:48:38,146 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:48:38,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:38,153 INFO L225 Difference]: With dead ends: 2924 [2020-02-10 19:48:38,154 INFO L226 Difference]: Without dead ends: 2910 [2020-02-10 19:48:38,154 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:48:38,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2910 states. [2020-02-10 19:48:38,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2910 to 1573. [2020-02-10 19:48:38,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 19:48:38,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7038 transitions. [2020-02-10 19:48:38,221 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7038 transitions. Word has length 28 [2020-02-10 19:48:38,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:38,221 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7038 transitions. [2020-02-10 19:48:38,222 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:48:38,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7038 transitions. [2020-02-10 19:48:38,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:48:38,224 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:38,224 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:38,224 INFO L427 AbstractCegarLoop]: === Iteration 338 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:38,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:38,224 INFO L82 PathProgramCache]: Analyzing trace with hash 848044172, now seen corresponding path program 330 times [2020-02-10 19:48:38,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:38,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990707360] [2020-02-10 19:48:38,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:38,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:38,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:38,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990707360] [2020-02-10 19:48:38,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:38,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:48:38,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779006330] [2020-02-10 19:48:38,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:48:38,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:38,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:48:38,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:38,750 INFO L87 Difference]: Start difference. First operand 1573 states and 7038 transitions. Second operand 11 states. [2020-02-10 19:48:38,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:38,923 INFO L93 Difference]: Finished difference Result 2927 states and 11655 transitions. [2020-02-10 19:48:38,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:48:38,923 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:48:38,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:38,930 INFO L225 Difference]: With dead ends: 2927 [2020-02-10 19:48:38,930 INFO L226 Difference]: Without dead ends: 2902 [2020-02-10 19:48:38,930 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:48:38,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2902 states. [2020-02-10 19:48:38,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2902 to 1565. [2020-02-10 19:48:38,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1565 states. [2020-02-10 19:48:38,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 7020 transitions. [2020-02-10 19:48:38,997 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 7020 transitions. Word has length 28 [2020-02-10 19:48:38,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:38,997 INFO L479 AbstractCegarLoop]: Abstraction has 1565 states and 7020 transitions. [2020-02-10 19:48:38,997 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:48:38,997 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 7020 transitions. [2020-02-10 19:48:38,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:48:39,000 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:39,000 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:39,000 INFO L427 AbstractCegarLoop]: === Iteration 339 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:39,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:39,000 INFO L82 PathProgramCache]: Analyzing trace with hash 693176912, now seen corresponding path program 331 times [2020-02-10 19:48:39,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:39,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956205779] [2020-02-10 19:48:39,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:39,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:39,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 19:48:39,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956205779] [2020-02-10 19:48:39,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:39,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:48:39,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923032540] [2020-02-10 19:48:39,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:48:39,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:39,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:48:39,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:39,522 INFO L87 Difference]: Start difference. First operand 1565 states and 7020 transitions. Second operand 11 states. [2020-02-10 19:48:39,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:39,664 INFO L93 Difference]: Finished difference Result 2944 states and 11697 transitions. [2020-02-10 19:48:39,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:48:39,664 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:48:39,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:39,671 INFO L225 Difference]: With dead ends: 2944 [2020-02-10 19:48:39,671 INFO L226 Difference]: Without dead ends: 2924 [2020-02-10 19:48:39,671 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:48:39,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2924 states. [2020-02-10 19:48:39,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2924 to 1575. [2020-02-10 19:48:39,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 19:48:39,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7046 transitions. [2020-02-10 19:48:39,740 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7046 transitions. Word has length 28 [2020-02-10 19:48:39,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:39,740 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7046 transitions. [2020-02-10 19:48:39,740 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:48:39,740 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7046 transitions. [2020-02-10 19:48:39,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:48:39,742 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:39,742 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:39,742 INFO L427 AbstractCegarLoop]: === Iteration 340 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:39,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:39,743 INFO L82 PathProgramCache]: Analyzing trace with hash -622980392, now seen corresponding path program 332 times [2020-02-10 19:48:39,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:39,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584615793] [2020-02-10 19:48:39,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:39,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:40,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:40,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584615793] [2020-02-10 19:48:40,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:40,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:48:40,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150521386] [2020-02-10 19:48:40,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:48:40,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:40,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:48:40,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:40,257 INFO L87 Difference]: Start difference. First operand 1575 states and 7046 transitions. Second operand 11 states. [2020-02-10 19:48:40,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:40,430 INFO L93 Difference]: Finished difference Result 2938 states and 11681 transitions. [2020-02-10 19:48:40,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:48:40,431 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:48:40,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:40,439 INFO L225 Difference]: With dead ends: 2938 [2020-02-10 19:48:40,439 INFO L226 Difference]: Without dead ends: 2919 [2020-02-10 19:48:40,439 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:48:40,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2919 states. [2020-02-10 19:48:40,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2919 to 1570. [2020-02-10 19:48:40,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 19:48:40,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7033 transitions. [2020-02-10 19:48:40,512 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7033 transitions. Word has length 28 [2020-02-10 19:48:40,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:40,512 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7033 transitions. [2020-02-10 19:48:40,513 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:48:40,513 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7033 transitions. [2020-02-10 19:48:40,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:48:40,515 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:40,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] [2020-02-10 19:48:40,516 INFO L427 AbstractCegarLoop]: === Iteration 341 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:40,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:40,516 INFO L82 PathProgramCache]: Analyzing trace with hash -379908468, now seen corresponding path program 333 times [2020-02-10 19:48:40,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:40,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293488048] [2020-02-10 19:48:40,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:40,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:41,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:41,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293488048] [2020-02-10 19:48:41,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:41,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:48:41,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517849945] [2020-02-10 19:48:41,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:48:41,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:41,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:48:41,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:41,052 INFO L87 Difference]: Start difference. First operand 1570 states and 7033 transitions. Second operand 11 states. [2020-02-10 19:48:41,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:41,199 INFO L93 Difference]: Finished difference Result 2950 states and 11707 transitions. [2020-02-10 19:48:41,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:48:41,200 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:48:41,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:41,207 INFO L225 Difference]: With dead ends: 2950 [2020-02-10 19:48:41,208 INFO L226 Difference]: Without dead ends: 2930 [2020-02-10 19:48:41,208 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:48:41,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2020-02-10 19:48:41,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 1578. [2020-02-10 19:48:41,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 19:48:41,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7047 transitions. [2020-02-10 19:48:41,277 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7047 transitions. Word has length 28 [2020-02-10 19:48:41,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:41,277 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7047 transitions. [2020-02-10 19:48:41,277 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:48:41,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7047 transitions. [2020-02-10 19:48:41,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:48:41,280 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:41,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] [2020-02-10 19:48:41,280 INFO L427 AbstractCegarLoop]: === Iteration 342 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:41,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:41,280 INFO L82 PathProgramCache]: Analyzing trace with hash -206660776, now seen corresponding path program 334 times [2020-02-10 19:48:41,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:41,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30116654] [2020-02-10 19:48:41,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:41,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:41,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:41,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30116654] [2020-02-10 19:48:41,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:41,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:48:41,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101177730] [2020-02-10 19:48:41,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:48:41,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:41,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:48:41,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:41,806 INFO L87 Difference]: Start difference. First operand 1578 states and 7047 transitions. Second operand 11 states. [2020-02-10 19:48:41,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:41,978 INFO L93 Difference]: Finished difference Result 2947 states and 11694 transitions. [2020-02-10 19:48:41,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:48:41,979 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:48:41,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:41,986 INFO L225 Difference]: With dead ends: 2947 [2020-02-10 19:48:41,986 INFO L226 Difference]: Without dead ends: 2922 [2020-02-10 19:48:41,987 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:48:42,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2922 states. [2020-02-10 19:48:42,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2922 to 1570. [2020-02-10 19:48:42,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 19:48:42,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7028 transitions. [2020-02-10 19:48:42,054 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7028 transitions. Word has length 28 [2020-02-10 19:48:42,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:42,054 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7028 transitions. [2020-02-10 19:48:42,054 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:48:42,054 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7028 transitions. [2020-02-10 19:48:42,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:48:42,056 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:42,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] [2020-02-10 19:48:42,056 INFO L427 AbstractCegarLoop]: === Iteration 343 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:42,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:42,057 INFO L82 PathProgramCache]: Analyzing trace with hash 452730764, now seen corresponding path program 335 times [2020-02-10 19:48:42,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:42,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560187818] [2020-02-10 19:48:42,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:42,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:42,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:42,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560187818] [2020-02-10 19:48:42,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:42,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:48:42,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325021223] [2020-02-10 19:48:42,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:48:42,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:42,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:48:42,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:42,585 INFO L87 Difference]: Start difference. First operand 1570 states and 7028 transitions. Second operand 11 states. [2020-02-10 19:48:42,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:42,821 INFO L93 Difference]: Finished difference Result 2934 states and 11669 transitions. [2020-02-10 19:48:42,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:48:42,821 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:48:42,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:42,829 INFO L225 Difference]: With dead ends: 2934 [2020-02-10 19:48:42,829 INFO L226 Difference]: Without dead ends: 2920 [2020-02-10 19:48:42,829 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:48:42,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2920 states. [2020-02-10 19:48:42,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2920 to 1574. [2020-02-10 19:48:42,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 19:48:42,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7035 transitions. [2020-02-10 19:48:42,917 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7035 transitions. Word has length 28 [2020-02-10 19:48:42,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:42,917 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7035 transitions. [2020-02-10 19:48:42,917 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:48:42,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7035 transitions. [2020-02-10 19:48:42,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:48:42,919 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:42,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] [2020-02-10 19:48:42,919 INFO L427 AbstractCegarLoop]: === Iteration 344 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:42,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:42,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1942135760, now seen corresponding path program 336 times [2020-02-10 19:48:42,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:42,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843860799] [2020-02-10 19:48:42,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:42,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:43,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:43,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843860799] [2020-02-10 19:48:43,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:43,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:48:43,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96891753] [2020-02-10 19:48:43,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:48:43,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:43,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:48:43,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:43,428 INFO L87 Difference]: Start difference. First operand 1574 states and 7035 transitions. Second operand 11 states. [2020-02-10 19:48:43,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:43,623 INFO L93 Difference]: Finished difference Result 2937 states and 11671 transitions. [2020-02-10 19:48:43,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:48:43,623 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:48:43,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:43,630 INFO L225 Difference]: With dead ends: 2937 [2020-02-10 19:48:43,630 INFO L226 Difference]: Without dead ends: 2906 [2020-02-10 19:48:43,630 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:48:43,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2906 states. [2020-02-10 19:48:43,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2906 to 1560. [2020-02-10 19:48:43,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2020-02-10 19:48:43,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 7006 transitions. [2020-02-10 19:48:43,699 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 7006 transitions. Word has length 28 [2020-02-10 19:48:43,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:43,699 INFO L479 AbstractCegarLoop]: Abstraction has 1560 states and 7006 transitions. [2020-02-10 19:48:43,699 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:48:43,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 7006 transitions. [2020-02-10 19:48:43,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:48:43,702 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:43,702 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:43,702 INFO L427 AbstractCegarLoop]: === Iteration 345 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:43,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:43,702 INFO L82 PathProgramCache]: Analyzing trace with hash 727901384, now seen corresponding path program 337 times [2020-02-10 19:48:43,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:43,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877212858] [2020-02-10 19:48:43,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:43,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:44,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 19:48:44,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877212858] [2020-02-10 19:48:44,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:44,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:48:44,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600014943] [2020-02-10 19:48:44,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:48:44,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:44,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:48:44,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:44,219 INFO L87 Difference]: Start difference. First operand 1560 states and 7006 transitions. Second operand 11 states. [2020-02-10 19:48:44,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:44,418 INFO L93 Difference]: Finished difference Result 2946 states and 11716 transitions. [2020-02-10 19:48:44,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:48:44,419 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:48:44,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:44,426 INFO L225 Difference]: With dead ends: 2946 [2020-02-10 19:48:44,427 INFO L226 Difference]: Without dead ends: 2930 [2020-02-10 19:48:44,427 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:48:44,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2020-02-10 19:48:44,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 1577. [2020-02-10 19:48:44,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 19:48:44,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7060 transitions. [2020-02-10 19:48:44,496 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7060 transitions. Word has length 28 [2020-02-10 19:48:44,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:44,496 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7060 transitions. [2020-02-10 19:48:44,496 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:48:44,496 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7060 transitions. [2020-02-10 19:48:44,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:48:44,499 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:44,499 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:44,499 INFO L427 AbstractCegarLoop]: === Iteration 346 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:44,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:44,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1472603882, now seen corresponding path program 338 times [2020-02-10 19:48:44,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:44,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108601275] [2020-02-10 19:48:44,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:44,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:45,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:45,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108601275] [2020-02-10 19:48:45,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:45,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:48:45,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65853623] [2020-02-10 19:48:45,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:48:45,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:45,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:48:45,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:45,031 INFO L87 Difference]: Start difference. First operand 1577 states and 7060 transitions. Second operand 11 states. [2020-02-10 19:48:45,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:45,193 INFO L93 Difference]: Finished difference Result 2950 states and 11717 transitions. [2020-02-10 19:48:45,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:48:45,194 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:48:45,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:45,201 INFO L225 Difference]: With dead ends: 2950 [2020-02-10 19:48:45,201 INFO L226 Difference]: Without dead ends: 2923 [2020-02-10 19:48:45,202 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:48:45,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2923 states. [2020-02-10 19:48:45,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2923 to 1570. [2020-02-10 19:48:45,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 19:48:45,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7042 transitions. [2020-02-10 19:48:45,269 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7042 transitions. Word has length 28 [2020-02-10 19:48:45,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:45,269 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7042 transitions. [2020-02-10 19:48:45,269 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:48:45,269 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7042 transitions. [2020-02-10 19:48:45,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:48:45,271 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:45,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] [2020-02-10 19:48:45,272 INFO L427 AbstractCegarLoop]: === Iteration 347 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:45,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:45,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1418269376, now seen corresponding path program 339 times [2020-02-10 19:48:45,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:45,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217347240] [2020-02-10 19:48:45,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:45,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:45,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 19:48:45,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217347240] [2020-02-10 19:48:45,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:45,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:48:45,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592220301] [2020-02-10 19:48:45,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:48:45,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:45,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:48:45,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:45,787 INFO L87 Difference]: Start difference. First operand 1570 states and 7042 transitions. Second operand 11 states. [2020-02-10 19:48:45,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:45,969 INFO L93 Difference]: Finished difference Result 2937 states and 11692 transitions. [2020-02-10 19:48:45,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:48:45,969 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:48:45,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:45,976 INFO L225 Difference]: With dead ends: 2937 [2020-02-10 19:48:45,976 INFO L226 Difference]: Without dead ends: 2921 [2020-02-10 19:48:45,976 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:48:46,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2921 states. [2020-02-10 19:48:46,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2921 to 1574. [2020-02-10 19:48:46,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 19:48:46,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7049 transitions. [2020-02-10 19:48:46,044 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7049 transitions. Word has length 28 [2020-02-10 19:48:46,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:46,044 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7049 transitions. [2020-02-10 19:48:46,044 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:48:46,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7049 transitions. [2020-02-10 19:48:46,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:48:46,046 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:46,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] [2020-02-10 19:48:46,046 INFO L427 AbstractCegarLoop]: === Iteration 348 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:46,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:46,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1989724182, now seen corresponding path program 340 times [2020-02-10 19:48:46,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:46,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778997496] [2020-02-10 19:48:46,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:46,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:46,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 19:48:46,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778997496] [2020-02-10 19:48:46,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:46,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:48:46,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101830193] [2020-02-10 19:48:46,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:48:46,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:46,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:48:46,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:46,571 INFO L87 Difference]: Start difference. First operand 1574 states and 7049 transitions. Second operand 11 states. [2020-02-10 19:48:46,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:46,758 INFO L93 Difference]: Finished difference Result 2935 states and 11684 transitions. [2020-02-10 19:48:46,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:48:46,759 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:48:46,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:46,766 INFO L225 Difference]: With dead ends: 2935 [2020-02-10 19:48:46,766 INFO L226 Difference]: Without dead ends: 2917 [2020-02-10 19:48:46,766 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:48:46,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2917 states. [2020-02-10 19:48:46,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2917 to 1570. [2020-02-10 19:48:46,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 19:48:46,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7038 transitions. [2020-02-10 19:48:46,833 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7038 transitions. Word has length 28 [2020-02-10 19:48:46,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:46,834 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7038 transitions. [2020-02-10 19:48:46,834 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:48:46,834 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7038 transitions. [2020-02-10 19:48:46,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:48:46,836 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:46,836 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:46,836 INFO L427 AbstractCegarLoop]: === Iteration 349 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:46,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:46,836 INFO L82 PathProgramCache]: Analyzing trace with hash 937374080, now seen corresponding path program 341 times [2020-02-10 19:48:46,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:46,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020098722] [2020-02-10 19:48:46,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:46,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:47,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 19:48:47,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020098722] [2020-02-10 19:48:47,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:47,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:48:47,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167449250] [2020-02-10 19:48:47,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:48:47,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:47,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:48:47,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:47,374 INFO L87 Difference]: Start difference. First operand 1570 states and 7038 transitions. Second operand 11 states. [2020-02-10 19:48:47,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:47,525 INFO L93 Difference]: Finished difference Result 2946 states and 11704 transitions. [2020-02-10 19:48:47,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:48:47,525 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:48:47,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:47,533 INFO L225 Difference]: With dead ends: 2946 [2020-02-10 19:48:47,533 INFO L226 Difference]: Without dead ends: 2926 [2020-02-10 19:48:47,533 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:48:47,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2926 states. [2020-02-10 19:48:47,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2926 to 1575. [2020-02-10 19:48:47,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 19:48:47,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7046 transitions. [2020-02-10 19:48:47,601 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7046 transitions. Word has length 28 [2020-02-10 19:48:47,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:47,601 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7046 transitions. [2020-02-10 19:48:47,601 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:48:47,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7046 transitions. [2020-02-10 19:48:47,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:48:47,604 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:47,604 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:47,604 INFO L427 AbstractCegarLoop]: === Iteration 350 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:47,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:47,604 INFO L82 PathProgramCache]: Analyzing trace with hash -378783224, now seen corresponding path program 342 times [2020-02-10 19:48:47,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:47,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249053737] [2020-02-10 19:48:47,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:47,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:48,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 19:48:48,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249053737] [2020-02-10 19:48:48,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:48,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:48:48,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128272741] [2020-02-10 19:48:48,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:48:48,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:48,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:48:48,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:48,145 INFO L87 Difference]: Start difference. First operand 1575 states and 7046 transitions. Second operand 11 states. [2020-02-10 19:48:48,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:48,374 INFO L93 Difference]: Finished difference Result 2940 states and 11688 transitions. [2020-02-10 19:48:48,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:48:48,375 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:48:48,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:48,382 INFO L225 Difference]: With dead ends: 2940 [2020-02-10 19:48:48,382 INFO L226 Difference]: Without dead ends: 2916 [2020-02-10 19:48:48,382 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:48:48,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2916 states. [2020-02-10 19:48:48,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2916 to 1565. [2020-02-10 19:48:48,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1565 states. [2020-02-10 19:48:48,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 7024 transitions. [2020-02-10 19:48:48,450 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 7024 transitions. Word has length 28 [2020-02-10 19:48:48,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:48,450 INFO L479 AbstractCegarLoop]: Abstraction has 1565 states and 7024 transitions. [2020-02-10 19:48:48,450 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:48:48,450 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 7024 transitions. [2020-02-10 19:48:48,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:48:48,453 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:48,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] [2020-02-10 19:48:48,453 INFO L427 AbstractCegarLoop]: === Iteration 351 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:48,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:48,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1821992972, now seen corresponding path program 343 times [2020-02-10 19:48:48,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:48,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463435554] [2020-02-10 19:48:48,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:48,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:48,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:48,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463435554] [2020-02-10 19:48:48,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:48,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:48:48,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273256896] [2020-02-10 19:48:48,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:48:48,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:48,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:48:48,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:48,982 INFO L87 Difference]: Start difference. First operand 1565 states and 7024 transitions. Second operand 11 states. [2020-02-10 19:48:49,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:49,167 INFO L93 Difference]: Finished difference Result 2956 states and 11740 transitions. [2020-02-10 19:48:49,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:48:49,168 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:48:49,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:49,176 INFO L225 Difference]: With dead ends: 2956 [2020-02-10 19:48:49,176 INFO L226 Difference]: Without dead ends: 2940 [2020-02-10 19:48:49,176 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:48:49,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2940 states. [2020-02-10 19:48:49,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2940 to 1579. [2020-02-10 19:48:49,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 19:48:49,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7063 transitions. [2020-02-10 19:48:49,243 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7063 transitions. Word has length 28 [2020-02-10 19:48:49,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:49,244 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7063 transitions. [2020-02-10 19:48:49,244 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:48:49,244 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7063 transitions. [2020-02-10 19:48:49,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:48:49,246 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:49,246 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:49,246 INFO L427 AbstractCegarLoop]: === Iteration 352 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:49,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:49,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1728271826, now seen corresponding path program 344 times [2020-02-10 19:48:49,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:49,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524660566] [2020-02-10 19:48:49,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:49,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:49,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:49,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524660566] [2020-02-10 19:48:49,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:49,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:48:49,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250227589] [2020-02-10 19:48:49,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:48:49,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:49,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:48:49,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:49,778 INFO L87 Difference]: Start difference. First operand 1579 states and 7063 transitions. Second operand 11 states. [2020-02-10 19:48:49,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:49,933 INFO L93 Difference]: Finished difference Result 2960 states and 11741 transitions. [2020-02-10 19:48:49,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:48:49,934 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:48:49,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:49,942 INFO L225 Difference]: With dead ends: 2960 [2020-02-10 19:48:49,942 INFO L226 Difference]: Without dead ends: 2933 [2020-02-10 19:48:49,942 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:48:49,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2933 states. [2020-02-10 19:48:50,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2933 to 1572. [2020-02-10 19:48:50,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 19:48:50,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7043 transitions. [2020-02-10 19:48:50,009 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7043 transitions. Word has length 28 [2020-02-10 19:48:50,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:50,009 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7043 transitions. [2020-02-10 19:48:50,009 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:48:50,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7043 transitions. [2020-02-10 19:48:50,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:48:50,012 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:50,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] [2020-02-10 19:48:50,012 INFO L427 AbstractCegarLoop]: === Iteration 353 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:50,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:50,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1397263168, now seen corresponding path program 345 times [2020-02-10 19:48:50,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:50,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344977695] [2020-02-10 19:48:50,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:50,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:50,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:50,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344977695] [2020-02-10 19:48:50,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:50,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:48:50,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944775251] [2020-02-10 19:48:50,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:48:50,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:50,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:48:50,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:50,543 INFO L87 Difference]: Start difference. First operand 1572 states and 7043 transitions. Second operand 11 states. [2020-02-10 19:48:50,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:50,737 INFO L93 Difference]: Finished difference Result 2952 states and 11726 transitions. [2020-02-10 19:48:50,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:48:50,737 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:48:50,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:50,745 INFO L225 Difference]: With dead ends: 2952 [2020-02-10 19:48:50,745 INFO L226 Difference]: Without dead ends: 2936 [2020-02-10 19:48:50,745 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:48:50,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2936 states. [2020-02-10 19:48:50,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2936 to 1578. [2020-02-10 19:48:50,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 19:48:50,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7054 transitions. [2020-02-10 19:48:50,820 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7054 transitions. Word has length 28 [2020-02-10 19:48:50,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:50,820 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7054 transitions. [2020-02-10 19:48:50,820 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:48:50,820 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7054 transitions. [2020-02-10 19:48:50,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:48:50,823 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:50,823 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:50,823 INFO L427 AbstractCegarLoop]: === Iteration 354 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:50,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:50,823 INFO L82 PathProgramCache]: Analyzing trace with hash -479312978, now seen corresponding path program 346 times [2020-02-10 19:48:50,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:50,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048181124] [2020-02-10 19:48:50,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:50,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:51,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:51,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048181124] [2020-02-10 19:48:51,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:51,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:48:51,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564959786] [2020-02-10 19:48:51,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:48:51,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:51,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:48:51,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:51,355 INFO L87 Difference]: Start difference. First operand 1578 states and 7054 transitions. Second operand 11 states. [2020-02-10 19:48:51,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:51,568 INFO L93 Difference]: Finished difference Result 2953 states and 11722 transitions. [2020-02-10 19:48:51,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:48:51,569 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:48:51,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:51,576 INFO L225 Difference]: With dead ends: 2953 [2020-02-10 19:48:51,576 INFO L226 Difference]: Without dead ends: 2930 [2020-02-10 19:48:51,577 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:48:51,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2020-02-10 19:48:51,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 1572. [2020-02-10 19:48:51,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 19:48:51,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7037 transitions. [2020-02-10 19:48:51,646 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7037 transitions. Word has length 28 [2020-02-10 19:48:51,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:51,646 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7037 transitions. [2020-02-10 19:48:51,646 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:48:51,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7037 transitions. [2020-02-10 19:48:51,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:48:51,648 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:51,648 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:51,648 INFO L427 AbstractCegarLoop]: === Iteration 355 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:51,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:51,648 INFO L82 PathProgramCache]: Analyzing trace with hash 958380288, now seen corresponding path program 347 times [2020-02-10 19:48:51,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:51,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90778045] [2020-02-10 19:48:51,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:51,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:52,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:52,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90778045] [2020-02-10 19:48:52,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:52,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:48:52,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190659296] [2020-02-10 19:48:52,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:48:52,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:52,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:48:52,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:52,183 INFO L87 Difference]: Start difference. First operand 1572 states and 7037 transitions. Second operand 11 states. [2020-02-10 19:48:52,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:52,335 INFO L93 Difference]: Finished difference Result 2962 states and 11739 transitions. [2020-02-10 19:48:52,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:48:52,335 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:48:52,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:52,342 INFO L225 Difference]: With dead ends: 2962 [2020-02-10 19:48:52,342 INFO L226 Difference]: Without dead ends: 2942 [2020-02-10 19:48:52,342 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:48:52,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2942 states. [2020-02-10 19:48:52,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2942 to 1580. [2020-02-10 19:48:52,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 19:48:52,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7051 transitions. [2020-02-10 19:48:52,409 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7051 transitions. Word has length 28 [2020-02-10 19:48:52,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:52,410 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7051 transitions. [2020-02-10 19:48:52,410 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:48:52,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7051 transitions. [2020-02-10 19:48:52,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:48:52,412 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:52,412 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:52,412 INFO L427 AbstractCegarLoop]: === Iteration 356 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:52,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:52,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1131627980, now seen corresponding path program 348 times [2020-02-10 19:48:52,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:52,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256105816] [2020-02-10 19:48:52,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:52,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:52,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 19:48:52,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256105816] [2020-02-10 19:48:52,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:52,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:48:52,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697725950] [2020-02-10 19:48:52,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:48:52,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:52,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:48:52,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:52,941 INFO L87 Difference]: Start difference. First operand 1580 states and 7051 transitions. Second operand 11 states. [2020-02-10 19:48:53,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:53,110 INFO L93 Difference]: Finished difference Result 2959 states and 11726 transitions. [2020-02-10 19:48:53,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:48:53,110 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:48:53,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:53,117 INFO L225 Difference]: With dead ends: 2959 [2020-02-10 19:48:53,117 INFO L226 Difference]: Without dead ends: 2927 [2020-02-10 19:48:53,118 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:48:53,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2927 states. [2020-02-10 19:48:53,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2927 to 1565. [2020-02-10 19:48:53,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1565 states. [2020-02-10 19:48:53,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 7019 transitions. [2020-02-10 19:48:53,184 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 7019 transitions. Word has length 28 [2020-02-10 19:48:53,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:53,184 INFO L479 AbstractCegarLoop]: Abstraction has 1565 states and 7019 transitions. [2020-02-10 19:48:53,184 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:48:53,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 7019 transitions. [2020-02-10 19:48:53,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:48:53,187 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:53,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] [2020-02-10 19:48:53,187 INFO L427 AbstractCegarLoop]: === Iteration 357 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:53,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:53,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1864005388, now seen corresponding path program 349 times [2020-02-10 19:48:53,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:53,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634988815] [2020-02-10 19:48:53,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:53,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:53,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:53,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634988815] [2020-02-10 19:48:53,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:53,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:48:53,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818306027] [2020-02-10 19:48:53,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:48:53,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:53,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:48:53,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:53,726 INFO L87 Difference]: Start difference. First operand 1565 states and 7019 transitions. Second operand 11 states. [2020-02-10 19:48:53,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:53,906 INFO L93 Difference]: Finished difference Result 2931 states and 11675 transitions. [2020-02-10 19:48:53,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:48:53,907 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:48:53,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:53,914 INFO L225 Difference]: With dead ends: 2931 [2020-02-10 19:48:53,914 INFO L226 Difference]: Without dead ends: 2915 [2020-02-10 19:48:53,915 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:48:53,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2915 states. [2020-02-10 19:48:53,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2915 to 1573. [2020-02-10 19:48:53,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 19:48:53,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7041 transitions. [2020-02-10 19:48:53,982 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7041 transitions. Word has length 28 [2020-02-10 19:48:53,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:53,982 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7041 transitions. [2020-02-10 19:48:53,982 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:48:53,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7041 transitions. [2020-02-10 19:48:53,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:48:53,984 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:53,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] [2020-02-10 19:48:53,984 INFO L427 AbstractCegarLoop]: === Iteration 358 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:53,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:53,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1292550582, now seen corresponding path program 350 times [2020-02-10 19:48:53,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:53,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089023318] [2020-02-10 19:48:53,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:53,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:54,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 19:48:54,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089023318] [2020-02-10 19:48:54,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:54,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:48:54,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402623180] [2020-02-10 19:48:54,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:48:54,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:54,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:48:54,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:54,503 INFO L87 Difference]: Start difference. First operand 1573 states and 7041 transitions. Second operand 11 states. [2020-02-10 19:48:54,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:54,681 INFO L93 Difference]: Finished difference Result 2929 states and 11667 transitions. [2020-02-10 19:48:54,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:48:54,681 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:48:54,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:54,689 INFO L225 Difference]: With dead ends: 2929 [2020-02-10 19:48:54,689 INFO L226 Difference]: Without dead ends: 2911 [2020-02-10 19:48:54,689 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:48:54,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2911 states. [2020-02-10 19:48:54,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2911 to 1569. [2020-02-10 19:48:54,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 19:48:54,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7030 transitions. [2020-02-10 19:48:54,756 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7030 transitions. Word has length 28 [2020-02-10 19:48:54,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:54,756 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7030 transitions. [2020-02-10 19:48:54,756 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:48:54,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7030 transitions. [2020-02-10 19:48:54,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:48:54,758 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:54,758 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:54,758 INFO L427 AbstractCegarLoop]: === Iteration 359 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:54,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:54,759 INFO L82 PathProgramCache]: Analyzing trace with hash 790920008, now seen corresponding path program 351 times [2020-02-10 19:48:54,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:54,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030799609] [2020-02-10 19:48:54,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:54,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:55,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 19:48:55,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030799609] [2020-02-10 19:48:55,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:55,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:48:55,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696577849] [2020-02-10 19:48:55,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:48:55,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:55,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:48:55,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:55,285 INFO L87 Difference]: Start difference. First operand 1569 states and 7030 transitions. Second operand 11 states. [2020-02-10 19:48:55,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:55,468 INFO L93 Difference]: Finished difference Result 2936 states and 11683 transitions. [2020-02-10 19:48:55,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:48:55,469 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:48:55,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:55,476 INFO L225 Difference]: With dead ends: 2936 [2020-02-10 19:48:55,476 INFO L226 Difference]: Without dead ends: 2920 [2020-02-10 19:48:55,477 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:48:55,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2920 states. [2020-02-10 19:48:55,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2920 to 1575. [2020-02-10 19:48:55,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 19:48:55,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7041 transitions. [2020-02-10 19:48:55,545 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7041 transitions. Word has length 28 [2020-02-10 19:48:55,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:55,545 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7041 transitions. [2020-02-10 19:48:55,545 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:48:55,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7041 transitions. [2020-02-10 19:48:55,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:48:55,548 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:55,548 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:55,548 INFO L427 AbstractCegarLoop]: === Iteration 360 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:55,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:55,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1708870198, now seen corresponding path program 352 times [2020-02-10 19:48:55,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:55,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224030429] [2020-02-10 19:48:55,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:55,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:56,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:56,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224030429] [2020-02-10 19:48:56,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:56,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:48:56,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714096719] [2020-02-10 19:48:56,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:48:56,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:56,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:48:56,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:56,074 INFO L87 Difference]: Start difference. First operand 1575 states and 7041 transitions. Second operand 11 states. [2020-02-10 19:48:56,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:56,254 INFO L93 Difference]: Finished difference Result 2937 states and 11679 transitions. [2020-02-10 19:48:56,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:48:56,255 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:48:56,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:56,261 INFO L225 Difference]: With dead ends: 2937 [2020-02-10 19:48:56,261 INFO L226 Difference]: Without dead ends: 2914 [2020-02-10 19:48:56,261 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:48:56,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2914 states. [2020-02-10 19:48:56,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2914 to 1569. [2020-02-10 19:48:56,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 19:48:56,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7026 transitions. [2020-02-10 19:48:56,329 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7026 transitions. Word has length 28 [2020-02-10 19:48:56,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:56,330 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7026 transitions. [2020-02-10 19:48:56,330 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:48:56,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7026 transitions. [2020-02-10 19:48:56,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:48:56,332 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:56,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] [2020-02-10 19:48:56,332 INFO L427 AbstractCegarLoop]: === Iteration 361 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:56,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:56,332 INFO L82 PathProgramCache]: Analyzing trace with hash -315764600, now seen corresponding path program 353 times [2020-02-10 19:48:56,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:56,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605951674] [2020-02-10 19:48:56,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:56,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:56,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 19:48:56,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605951674] [2020-02-10 19:48:56,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:56,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:48:56,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514559907] [2020-02-10 19:48:56,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:48:56,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:56,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:48:56,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:56,854 INFO L87 Difference]: Start difference. First operand 1569 states and 7026 transitions. Second operand 11 states. [2020-02-10 19:48:57,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:57,062 INFO L93 Difference]: Finished difference Result 2930 states and 11665 transitions. [2020-02-10 19:48:57,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:48:57,063 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:48:57,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:57,070 INFO L225 Difference]: With dead ends: 2930 [2020-02-10 19:48:57,071 INFO L226 Difference]: Without dead ends: 2916 [2020-02-10 19:48:57,071 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:48:57,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2916 states. [2020-02-10 19:48:57,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2916 to 1573. [2020-02-10 19:48:57,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 19:48:57,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7033 transitions. [2020-02-10 19:48:57,139 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7033 transitions. Word has length 28 [2020-02-10 19:48:57,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:57,139 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7033 transitions. [2020-02-10 19:48:57,139 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:48:57,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7033 transitions. [2020-02-10 19:48:57,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:48:57,142 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:57,142 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:57,142 INFO L427 AbstractCegarLoop]: === Iteration 362 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:57,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:57,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1173640396, now seen corresponding path program 354 times [2020-02-10 19:48:57,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:57,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817487298] [2020-02-10 19:48:57,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:57,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:57,674 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 19:48:57,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 19:48:57,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817487298] [2020-02-10 19:48:57,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:57,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:48:57,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830406811] [2020-02-10 19:48:57,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:48:57,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:57,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:48:57,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:57,682 INFO L87 Difference]: Start difference. First operand 1573 states and 7033 transitions. Second operand 11 states. [2020-02-10 19:48:57,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:57,872 INFO L93 Difference]: Finished difference Result 2933 states and 11667 transitions. [2020-02-10 19:48:57,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:48:57,872 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:48:57,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:57,879 INFO L225 Difference]: With dead ends: 2933 [2020-02-10 19:48:57,879 INFO L226 Difference]: Without dead ends: 2908 [2020-02-10 19:48:57,879 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:48:57,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2908 states. [2020-02-10 19:48:57,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2908 to 1565. [2020-02-10 19:48:57,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1565 states. [2020-02-10 19:48:57,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 7015 transitions. [2020-02-10 19:48:57,948 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 7015 transitions. Word has length 28 [2020-02-10 19:48:57,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:57,948 INFO L479 AbstractCegarLoop]: Abstraction has 1565 states and 7015 transitions. [2020-02-10 19:48:57,948 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:48:57,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 7015 transitions. [2020-02-10 19:48:57,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:48:57,950 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:57,950 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:57,950 INFO L427 AbstractCegarLoop]: === Iteration 363 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:57,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:57,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1675756306, now seen corresponding path program 355 times [2020-02-10 19:48:57,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:57,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922682937] [2020-02-10 19:48:57,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:57,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:58,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:58,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922682937] [2020-02-10 19:48:58,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:58,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:48:58,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63042783] [2020-02-10 19:48:58,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:48:58,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:58,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:48:58,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:58,474 INFO L87 Difference]: Start difference. First operand 1565 states and 7015 transitions. Second operand 11 states. [2020-02-10 19:48:58,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:58,604 INFO L93 Difference]: Finished difference Result 2948 states and 11704 transitions. [2020-02-10 19:48:58,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:48:58,604 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:48:58,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:58,611 INFO L225 Difference]: With dead ends: 2948 [2020-02-10 19:48:58,611 INFO L226 Difference]: Without dead ends: 2928 [2020-02-10 19:48:58,611 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:48:58,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2928 states. [2020-02-10 19:48:58,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2928 to 1575. [2020-02-10 19:48:58,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 19:48:58,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7041 transitions. [2020-02-10 19:48:58,698 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7041 transitions. Word has length 28 [2020-02-10 19:48:58,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:58,699 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7041 transitions. [2020-02-10 19:48:58,699 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:48:58,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7041 transitions. [2020-02-10 19:48:58,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:48:58,701 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:58,701 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:58,701 INFO L427 AbstractCegarLoop]: === Iteration 364 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:58,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:58,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1303053686, now seen corresponding path program 356 times [2020-02-10 19:48:58,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:58,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105691168] [2020-02-10 19:48:58,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:58,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:48:59,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:48:59,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105691168] [2020-02-10 19:48:59,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:48:59,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:48:59,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921185598] [2020-02-10 19:48:59,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:48:59,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:48:59,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:48:59,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:48:59,216 INFO L87 Difference]: Start difference. First operand 1575 states and 7041 transitions. Second operand 11 states. [2020-02-10 19:48:59,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:48:59,405 INFO L93 Difference]: Finished difference Result 2942 states and 11688 transitions. [2020-02-10 19:48:59,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:48:59,405 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:48:59,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:48:59,413 INFO L225 Difference]: With dead ends: 2942 [2020-02-10 19:48:59,413 INFO L226 Difference]: Without dead ends: 2923 [2020-02-10 19:48:59,413 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:48:59,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2923 states. [2020-02-10 19:48:59,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2923 to 1570. [2020-02-10 19:48:59,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 19:48:59,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7028 transitions. [2020-02-10 19:48:59,482 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7028 transitions. Word has length 28 [2020-02-10 19:48:59,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:48:59,483 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7028 transitions. [2020-02-10 19:48:59,483 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:48:59,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7028 transitions. [2020-02-10 19:48:59,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:48:59,485 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:48:59,485 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:48:59,485 INFO L427 AbstractCegarLoop]: === Iteration 365 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:48:59,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:48:59,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1546125610, now seen corresponding path program 357 times [2020-02-10 19:48:59,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:48:59,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099019076] [2020-02-10 19:48:59,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:48:59,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:00,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 19:49:00,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099019076] [2020-02-10 19:49:00,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:00,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:49:00,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645658430] [2020-02-10 19:49:00,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:49:00,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:00,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:49:00,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:00,021 INFO L87 Difference]: Start difference. First operand 1570 states and 7028 transitions. Second operand 11 states. [2020-02-10 19:49:00,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:00,185 INFO L93 Difference]: Finished difference Result 2954 states and 11714 transitions. [2020-02-10 19:49:00,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:49:00,185 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:49:00,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:00,193 INFO L225 Difference]: With dead ends: 2954 [2020-02-10 19:49:00,193 INFO L226 Difference]: Without dead ends: 2934 [2020-02-10 19:49:00,193 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:49:00,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2934 states. [2020-02-10 19:49:00,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2934 to 1578. [2020-02-10 19:49:00,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 19:49:00,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7042 transitions. [2020-02-10 19:49:00,260 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7042 transitions. Word has length 28 [2020-02-10 19:49:00,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:00,260 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7042 transitions. [2020-02-10 19:49:00,260 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:49:00,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7042 transitions. [2020-02-10 19:49:00,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:49:00,262 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:00,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] [2020-02-10 19:49:00,262 INFO L427 AbstractCegarLoop]: === Iteration 366 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:00,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:00,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1719373302, now seen corresponding path program 358 times [2020-02-10 19:49:00,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:00,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566894043] [2020-02-10 19:49:00,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:00,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:00,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 19:49:00,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566894043] [2020-02-10 19:49:00,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:00,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:49:00,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143256357] [2020-02-10 19:49:00,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:49:00,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:00,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:49:00,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:00,787 INFO L87 Difference]: Start difference. First operand 1578 states and 7042 transitions. Second operand 11 states. [2020-02-10 19:49:01,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:01,009 INFO L93 Difference]: Finished difference Result 2951 states and 11701 transitions. [2020-02-10 19:49:01,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:49:01,009 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:49:01,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:01,017 INFO L225 Difference]: With dead ends: 2951 [2020-02-10 19:49:01,018 INFO L226 Difference]: Without dead ends: 2926 [2020-02-10 19:49:01,018 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:49:01,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2926 states. [2020-02-10 19:49:01,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2926 to 1570. [2020-02-10 19:49:01,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 19:49:01,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7023 transitions. [2020-02-10 19:49:01,085 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7023 transitions. Word has length 28 [2020-02-10 19:49:01,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:01,085 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7023 transitions. [2020-02-10 19:49:01,085 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:49:01,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7023 transitions. [2020-02-10 19:49:01,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:49:01,087 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:01,087 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:01,087 INFO L427 AbstractCegarLoop]: === Iteration 367 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:01,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:01,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1916202454, now seen corresponding path program 359 times [2020-02-10 19:49:01,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:01,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541254183] [2020-02-10 19:49:01,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:01,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:01,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:01,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541254183] [2020-02-10 19:49:01,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:01,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:49:01,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769067040] [2020-02-10 19:49:01,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:49:01,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:01,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:49:01,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:01,607 INFO L87 Difference]: Start difference. First operand 1570 states and 7023 transitions. Second operand 11 states. [2020-02-10 19:49:01,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:01,786 INFO L93 Difference]: Finished difference Result 2938 states and 11676 transitions. [2020-02-10 19:49:01,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:49:01,787 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:49:01,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:01,794 INFO L225 Difference]: With dead ends: 2938 [2020-02-10 19:49:01,794 INFO L226 Difference]: Without dead ends: 2924 [2020-02-10 19:49:01,795 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:49:01,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2924 states. [2020-02-10 19:49:01,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2924 to 1574. [2020-02-10 19:49:01,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 19:49:01,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7030 transitions. [2020-02-10 19:49:01,862 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7030 transitions. Word has length 28 [2020-02-10 19:49:01,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:01,862 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7030 transitions. [2020-02-10 19:49:01,862 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:49:01,862 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7030 transitions. [2020-02-10 19:49:01,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:49:01,864 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:01,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] [2020-02-10 19:49:01,864 INFO L427 AbstractCegarLoop]: === Iteration 368 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:01,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:01,865 INFO L82 PathProgramCache]: Analyzing trace with hash -426797458, now seen corresponding path program 360 times [2020-02-10 19:49:01,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:01,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804284411] [2020-02-10 19:49:01,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:01,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:02,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 19:49:02,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804284411] [2020-02-10 19:49:02,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:02,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:49:02,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671175626] [2020-02-10 19:49:02,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:49:02,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:02,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:49:02,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:02,392 INFO L87 Difference]: Start difference. First operand 1574 states and 7030 transitions. Second operand 11 states. [2020-02-10 19:49:02,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:02,606 INFO L93 Difference]: Finished difference Result 2941 states and 11678 transitions. [2020-02-10 19:49:02,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:49:02,606 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:49:02,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:02,613 INFO L225 Difference]: With dead ends: 2941 [2020-02-10 19:49:02,613 INFO L226 Difference]: Without dead ends: 2905 [2020-02-10 19:49:02,614 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:49:02,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2905 states. [2020-02-10 19:49:02,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2905 to 1555. [2020-02-10 19:49:02,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1555 states. [2020-02-10 19:49:02,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 6992 transitions. [2020-02-10 19:49:02,680 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 6992 transitions. Word has length 28 [2020-02-10 19:49:02,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:02,680 INFO L479 AbstractCegarLoop]: Abstraction has 1555 states and 6992 transitions. [2020-02-10 19:49:02,680 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:49:02,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 6992 transitions. [2020-02-10 19:49:02,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:49:02,683 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:02,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] [2020-02-10 19:49:02,683 INFO L427 AbstractCegarLoop]: === Iteration 369 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:02,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:02,683 INFO L82 PathProgramCache]: Analyzing trace with hash 313455144, now seen corresponding path program 361 times [2020-02-10 19:49:02,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:02,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822112519] [2020-02-10 19:49:02,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:02,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:03,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 19:49:03,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822112519] [2020-02-10 19:49:03,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:03,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:49:03,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886582941] [2020-02-10 19:49:03,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:49:03,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:03,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:49:03,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:03,201 INFO L87 Difference]: Start difference. First operand 1555 states and 6992 transitions. Second operand 11 states. [2020-02-10 19:49:03,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:03,414 INFO L93 Difference]: Finished difference Result 2905 states and 11627 transitions. [2020-02-10 19:49:03,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:49:03,414 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:49:03,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:03,422 INFO L225 Difference]: With dead ends: 2905 [2020-02-10 19:49:03,422 INFO L226 Difference]: Without dead ends: 2890 [2020-02-10 19:49:03,422 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:49:03,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2890 states. [2020-02-10 19:49:03,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2890 to 1573. [2020-02-10 19:49:03,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 19:49:03,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7062 transitions. [2020-02-10 19:49:03,489 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7062 transitions. Word has length 28 [2020-02-10 19:49:03,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:03,490 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7062 transitions. [2020-02-10 19:49:03,490 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:49:03,490 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7062 transitions. [2020-02-10 19:49:03,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:49:03,492 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:03,492 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:03,492 INFO L427 AbstractCegarLoop]: === Iteration 370 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:03,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:03,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1058157642, now seen corresponding path program 362 times [2020-02-10 19:49:03,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:03,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057791796] [2020-02-10 19:49:03,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:03,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:04,022 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 19:49:04,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:04,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057791796] [2020-02-10 19:49:04,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:04,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:49:04,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968831972] [2020-02-10 19:49:04,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:49:04,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:04,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:49:04,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:04,052 INFO L87 Difference]: Start difference. First operand 1573 states and 7062 transitions. Second operand 11 states. [2020-02-10 19:49:04,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:04,259 INFO L93 Difference]: Finished difference Result 2906 states and 11624 transitions. [2020-02-10 19:49:04,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:49:04,260 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:49:04,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:04,267 INFO L225 Difference]: With dead ends: 2906 [2020-02-10 19:49:04,267 INFO L226 Difference]: Without dead ends: 2885 [2020-02-10 19:49:04,268 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:49:04,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2885 states. [2020-02-10 19:49:04,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2885 to 1568. [2020-02-10 19:49:04,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 19:49:04,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7048 transitions. [2020-02-10 19:49:04,334 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7048 transitions. Word has length 28 [2020-02-10 19:49:04,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:04,335 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7048 transitions. [2020-02-10 19:49:04,335 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:49:04,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7048 transitions. [2020-02-10 19:49:04,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:49:04,337 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:04,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] [2020-02-10 19:49:04,337 INFO L427 AbstractCegarLoop]: === Iteration 371 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:04,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:04,337 INFO L82 PathProgramCache]: Analyzing trace with hash -759630236, now seen corresponding path program 363 times [2020-02-10 19:49:04,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:04,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969037663] [2020-02-10 19:49:04,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:04,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:04,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 19:49:04,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969037663] [2020-02-10 19:49:04,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:04,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:49:04,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981790127] [2020-02-10 19:49:04,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:49:04,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:04,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:49:04,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:04,855 INFO L87 Difference]: Start difference. First operand 1568 states and 7048 transitions. Second operand 11 states. [2020-02-10 19:49:05,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:05,087 INFO L93 Difference]: Finished difference Result 2907 states and 11626 transitions. [2020-02-10 19:49:05,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:49:05,087 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:49:05,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:05,095 INFO L225 Difference]: With dead ends: 2907 [2020-02-10 19:49:05,095 INFO L226 Difference]: Without dead ends: 2892 [2020-02-10 19:49:05,095 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:49:05,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2892 states. [2020-02-10 19:49:05,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2892 to 1573. [2020-02-10 19:49:05,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 19:49:05,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7057 transitions. [2020-02-10 19:49:05,163 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7057 transitions. Word has length 28 [2020-02-10 19:49:05,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:05,163 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7057 transitions. [2020-02-10 19:49:05,163 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:49:05,163 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7057 transitions. [2020-02-10 19:49:05,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:49:05,165 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:05,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] [2020-02-10 19:49:05,165 INFO L427 AbstractCegarLoop]: === Iteration 372 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:05,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:05,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1474477258, now seen corresponding path program 364 times [2020-02-10 19:49:05,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:05,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250300701] [2020-02-10 19:49:05,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:05,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:05,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 19:49:05,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250300701] [2020-02-10 19:49:05,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:05,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:49:05,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365184025] [2020-02-10 19:49:05,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:49:05,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:05,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:49:05,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:05,681 INFO L87 Difference]: Start difference. First operand 1573 states and 7057 transitions. Second operand 11 states. [2020-02-10 19:49:05,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:05,896 INFO L93 Difference]: Finished difference Result 2910 states and 11627 transitions. [2020-02-10 19:49:05,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:49:05,897 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:49:05,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:05,904 INFO L225 Difference]: With dead ends: 2910 [2020-02-10 19:49:05,904 INFO L226 Difference]: Without dead ends: 2887 [2020-02-10 19:49:05,904 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:49:05,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2887 states. [2020-02-10 19:49:05,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2887 to 1568. [2020-02-10 19:49:05,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 19:49:05,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7043 transitions. [2020-02-10 19:49:05,972 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7043 transitions. Word has length 28 [2020-02-10 19:49:05,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:05,972 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7043 transitions. [2020-02-10 19:49:05,972 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:49:05,972 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7043 transitions. [2020-02-10 19:49:05,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:49:05,974 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:05,974 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:05,974 INFO L427 AbstractCegarLoop]: === Iteration 373 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:05,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:05,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1596013220, now seen corresponding path program 365 times [2020-02-10 19:49:05,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:05,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82725861] [2020-02-10 19:49:05,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:05,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:06,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:06,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82725861] [2020-02-10 19:49:06,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:06,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:49:06,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217156138] [2020-02-10 19:49:06,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:49:06,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:06,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:49:06,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:06,484 INFO L87 Difference]: Start difference. First operand 1568 states and 7043 transitions. Second operand 11 states. [2020-02-10 19:49:06,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:06,724 INFO L93 Difference]: Finished difference Result 2910 states and 11628 transitions. [2020-02-10 19:49:06,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:49:06,724 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:49:06,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:06,731 INFO L225 Difference]: With dead ends: 2910 [2020-02-10 19:49:06,731 INFO L226 Difference]: Without dead ends: 2894 [2020-02-10 19:49:06,731 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:49:06,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2894 states. [2020-02-10 19:49:06,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2894 to 1574. [2020-02-10 19:49:06,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 19:49:06,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7054 transitions. [2020-02-10 19:49:06,800 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7054 transitions. Word has length 28 [2020-02-10 19:49:06,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:06,800 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7054 transitions. [2020-02-10 19:49:06,800 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:49:06,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7054 transitions. [2020-02-10 19:49:06,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:49:06,802 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:06,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] [2020-02-10 19:49:06,802 INFO L427 AbstractCegarLoop]: === Iteration 374 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:06,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:06,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1209549080, now seen corresponding path program 366 times [2020-02-10 19:49:06,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:06,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93501682] [2020-02-10 19:49:06,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:06,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:07,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:07,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93501682] [2020-02-10 19:49:07,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:07,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:49:07,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764576433] [2020-02-10 19:49:07,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:49:07,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:07,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:49:07,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:07,312 INFO L87 Difference]: Start difference. First operand 1574 states and 7054 transitions. Second operand 11 states. [2020-02-10 19:49:07,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:07,505 INFO L93 Difference]: Finished difference Result 2912 states and 11626 transitions. [2020-02-10 19:49:07,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:49:07,506 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:49:07,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:07,513 INFO L225 Difference]: With dead ends: 2912 [2020-02-10 19:49:07,513 INFO L226 Difference]: Without dead ends: 2883 [2020-02-10 19:49:07,513 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:49:07,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2883 states. [2020-02-10 19:49:07,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2883 to 1563. [2020-02-10 19:49:07,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2020-02-10 19:49:07,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 7030 transitions. [2020-02-10 19:49:07,582 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 7030 transitions. Word has length 28 [2020-02-10 19:49:07,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:07,582 INFO L479 AbstractCegarLoop]: Abstraction has 1563 states and 7030 transitions. [2020-02-10 19:49:07,582 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:49:07,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 7030 transitions. [2020-02-10 19:49:07,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:49:07,584 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:07,584 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:07,584 INFO L427 AbstractCegarLoop]: === Iteration 375 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:07,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:07,584 INFO L82 PathProgramCache]: Analyzing trace with hash -192891122, now seen corresponding path program 367 times [2020-02-10 19:49:07,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:07,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32189243] [2020-02-10 19:49:07,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:07,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:08,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:08,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32189243] [2020-02-10 19:49:08,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:08,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:49:08,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149459476] [2020-02-10 19:49:08,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:49:08,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:08,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:49:08,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:08,119 INFO L87 Difference]: Start difference. First operand 1563 states and 7030 transitions. Second operand 11 states. [2020-02-10 19:49:08,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:08,309 INFO L93 Difference]: Finished difference Result 2897 states and 11602 transitions. [2020-02-10 19:49:08,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:49:08,309 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:49:08,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:08,317 INFO L225 Difference]: With dead ends: 2897 [2020-02-10 19:49:08,317 INFO L226 Difference]: Without dead ends: 2882 [2020-02-10 19:49:08,317 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:49:08,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2882 states. [2020-02-10 19:49:08,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2882 to 1572. [2020-02-10 19:49:08,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 19:49:08,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7054 transitions. [2020-02-10 19:49:08,384 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7054 transitions. Word has length 28 [2020-02-10 19:49:08,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:08,384 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7054 transitions. [2020-02-10 19:49:08,384 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:49:08,384 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7054 transitions. [2020-02-10 19:49:08,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:49:08,386 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:08,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] [2020-02-10 19:49:08,387 INFO L427 AbstractCegarLoop]: === Iteration 376 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:08,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:08,387 INFO L82 PathProgramCache]: Analyzing trace with hash 551811376, now seen corresponding path program 368 times [2020-02-10 19:49:08,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:08,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557999332] [2020-02-10 19:49:08,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:08,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:08,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 19:49:08,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557999332] [2020-02-10 19:49:08,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:08,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:49:08,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353634070] [2020-02-10 19:49:08,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:49:08,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:08,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:49:08,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:08,925 INFO L87 Difference]: Start difference. First operand 1572 states and 7054 transitions. Second operand 11 states. [2020-02-10 19:49:09,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:09,140 INFO L93 Difference]: Finished difference Result 2898 states and 11599 transitions. [2020-02-10 19:49:09,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:49:09,141 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:49:09,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:09,148 INFO L225 Difference]: With dead ends: 2898 [2020-02-10 19:49:09,148 INFO L226 Difference]: Without dead ends: 2877 [2020-02-10 19:49:09,148 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:49:09,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2877 states. [2020-02-10 19:49:09,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2877 to 1567. [2020-02-10 19:49:09,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 19:49:09,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7041 transitions. [2020-02-10 19:49:09,215 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7041 transitions. Word has length 28 [2020-02-10 19:49:09,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:09,215 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7041 transitions. [2020-02-10 19:49:09,216 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:49:09,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7041 transitions. [2020-02-10 19:49:09,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:49:09,218 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:09,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] [2020-02-10 19:49:09,218 INFO L427 AbstractCegarLoop]: === Iteration 377 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:09,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:09,218 INFO L82 PathProgramCache]: Analyzing trace with hash -728120924, now seen corresponding path program 369 times [2020-02-10 19:49:09,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:09,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132823251] [2020-02-10 19:49:09,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:09,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:09,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:09,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132823251] [2020-02-10 19:49:09,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:09,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:49:09,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981074116] [2020-02-10 19:49:09,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:49:09,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:09,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:49:09,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:09,771 INFO L87 Difference]: Start difference. First operand 1567 states and 7041 transitions. Second operand 11 states. [2020-02-10 19:49:09,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:09,990 INFO L93 Difference]: Finished difference Result 2894 states and 11591 transitions. [2020-02-10 19:49:09,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:49:09,991 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:49:09,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:09,997 INFO L225 Difference]: With dead ends: 2894 [2020-02-10 19:49:09,998 INFO L226 Difference]: Without dead ends: 2879 [2020-02-10 19:49:09,998 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:49:10,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2879 states. [2020-02-10 19:49:10,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2879 to 1571. [2020-02-10 19:49:10,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 19:49:10,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7048 transitions. [2020-02-10 19:49:10,065 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7048 transitions. Word has length 28 [2020-02-10 19:49:10,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:10,065 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7048 transitions. [2020-02-10 19:49:10,066 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:49:10,066 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7048 transitions. [2020-02-10 19:49:10,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:49:10,068 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:10,068 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:10,068 INFO L427 AbstractCegarLoop]: === Iteration 378 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:10,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:10,068 INFO L82 PathProgramCache]: Analyzing trace with hash -554873232, now seen corresponding path program 370 times [2020-02-10 19:49:10,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:10,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521331791] [2020-02-10 19:49:10,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:10,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:10,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:10,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521331791] [2020-02-10 19:49:10,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:10,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:49:10,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273001421] [2020-02-10 19:49:10,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:49:10,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:10,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:49:10,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:10,607 INFO L87 Difference]: Start difference. First operand 1571 states and 7048 transitions. Second operand 11 states. [2020-02-10 19:49:10,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:10,822 INFO L93 Difference]: Finished difference Result 2893 states and 11585 transitions. [2020-02-10 19:49:10,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:49:10,823 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:49:10,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:10,830 INFO L225 Difference]: With dead ends: 2893 [2020-02-10 19:49:10,831 INFO L226 Difference]: Without dead ends: 2875 [2020-02-10 19:49:10,831 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:49:10,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2875 states. [2020-02-10 19:49:10,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2875 to 1567. [2020-02-10 19:49:10,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 19:49:10,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7037 transitions. [2020-02-10 19:49:10,898 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7037 transitions. Word has length 28 [2020-02-10 19:49:10,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:10,898 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7037 transitions. [2020-02-10 19:49:10,898 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:49:10,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7037 transitions. [2020-02-10 19:49:10,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:49:10,900 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:10,900 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:10,900 INFO L427 AbstractCegarLoop]: === Iteration 379 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:10,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:10,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1627522532, now seen corresponding path program 371 times [2020-02-10 19:49:10,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:10,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096465954] [2020-02-10 19:49:10,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:10,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:11,422 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 19:49:11,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 19:49:11,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096465954] [2020-02-10 19:49:11,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:11,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:49:11,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598748581] [2020-02-10 19:49:11,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:49:11,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:11,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:49:11,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:11,431 INFO L87 Difference]: Start difference. First operand 1567 states and 7037 transitions. Second operand 11 states. [2020-02-10 19:49:11,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:11,645 INFO L93 Difference]: Finished difference Result 2896 states and 11591 transitions. [2020-02-10 19:49:11,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:49:11,646 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:49:11,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:11,652 INFO L225 Difference]: With dead ends: 2896 [2020-02-10 19:49:11,652 INFO L226 Difference]: Without dead ends: 2880 [2020-02-10 19:49:11,652 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:49:11,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2880 states. [2020-02-10 19:49:11,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2880 to 1571. [2020-02-10 19:49:11,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 19:49:11,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7044 transitions. [2020-02-10 19:49:11,719 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7044 transitions. Word has length 28 [2020-02-10 19:49:11,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:11,719 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7044 transitions. [2020-02-10 19:49:11,719 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:49:11,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7044 transitions. [2020-02-10 19:49:11,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:49:11,721 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:11,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] [2020-02-10 19:49:11,721 INFO L427 AbstractCegarLoop]: === Iteration 380 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:11,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:11,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1056067726, now seen corresponding path program 372 times [2020-02-10 19:49:11,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:11,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913748992] [2020-02-10 19:49:11,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:11,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:12,246 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 19:49:12,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:12,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913748992] [2020-02-10 19:49:12,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:12,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:49:12,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931866111] [2020-02-10 19:49:12,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:49:12,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:12,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:49:12,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:12,254 INFO L87 Difference]: Start difference. First operand 1571 states and 7044 transitions. Second operand 11 states. [2020-02-10 19:49:12,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:12,445 INFO L93 Difference]: Finished difference Result 2894 states and 11583 transitions. [2020-02-10 19:49:12,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:49:12,445 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:49:12,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:12,452 INFO L225 Difference]: With dead ends: 2894 [2020-02-10 19:49:12,452 INFO L226 Difference]: Without dead ends: 2872 [2020-02-10 19:49:12,452 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:49:12,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2872 states. [2020-02-10 19:49:12,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2872 to 1563. [2020-02-10 19:49:12,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2020-02-10 19:49:12,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 7026 transitions. [2020-02-10 19:49:12,520 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 7026 transitions. Word has length 28 [2020-02-10 19:49:12,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:12,520 INFO L479 AbstractCegarLoop]: Abstraction has 1563 states and 7026 transitions. [2020-02-10 19:49:12,520 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:49:12,520 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 7026 transitions. [2020-02-10 19:49:12,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:49:12,522 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:12,522 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:12,522 INFO L427 AbstractCegarLoop]: === Iteration 381 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:12,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:12,522 INFO L82 PathProgramCache]: Analyzing trace with hash -171884914, now seen corresponding path program 373 times [2020-02-10 19:49:12,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:12,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132088704] [2020-02-10 19:49:12,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:12,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:13,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:13,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132088704] [2020-02-10 19:49:13,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:13,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:49:13,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115347550] [2020-02-10 19:49:13,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:49:13,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:13,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:49:13,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:13,050 INFO L87 Difference]: Start difference. First operand 1563 states and 7026 transitions. Second operand 11 states. [2020-02-10 19:49:13,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:13,229 INFO L93 Difference]: Finished difference Result 2901 states and 11606 transitions. [2020-02-10 19:49:13,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:49:13,229 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:49:13,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:13,236 INFO L225 Difference]: With dead ends: 2901 [2020-02-10 19:49:13,237 INFO L226 Difference]: Without dead ends: 2886 [2020-02-10 19:49:13,237 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:49:13,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2886 states. [2020-02-10 19:49:13,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2886 to 1572. [2020-02-10 19:49:13,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 19:49:13,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7050 transitions. [2020-02-10 19:49:13,304 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7050 transitions. Word has length 28 [2020-02-10 19:49:13,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:13,304 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7050 transitions. [2020-02-10 19:49:13,304 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:49:13,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7050 transitions. [2020-02-10 19:49:13,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:49:13,307 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:13,307 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:13,307 INFO L427 AbstractCegarLoop]: === Iteration 382 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:13,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:13,307 INFO L82 PathProgramCache]: Analyzing trace with hash 2062222580, now seen corresponding path program 374 times [2020-02-10 19:49:13,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:13,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287723076] [2020-02-10 19:49:13,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:13,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:13,823 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 31 [2020-02-10 19:49:13,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:13,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287723076] [2020-02-10 19:49:13,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:13,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:49:13,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32693961] [2020-02-10 19:49:13,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:49:13,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:13,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:49:13,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:13,831 INFO L87 Difference]: Start difference. First operand 1572 states and 7050 transitions. Second operand 11 states. [2020-02-10 19:49:14,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:14,044 INFO L93 Difference]: Finished difference Result 2904 states and 11607 transitions. [2020-02-10 19:49:14,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:49:14,044 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:49:14,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:14,051 INFO L225 Difference]: With dead ends: 2904 [2020-02-10 19:49:14,051 INFO L226 Difference]: Without dead ends: 2881 [2020-02-10 19:49:14,052 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:49:14,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2881 states. [2020-02-10 19:49:14,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2881 to 1567. [2020-02-10 19:49:14,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 19:49:14,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7037 transitions. [2020-02-10 19:49:14,118 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7037 transitions. Word has length 28 [2020-02-10 19:49:14,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:14,119 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7037 transitions. [2020-02-10 19:49:14,119 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:49:14,119 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7037 transitions. [2020-02-10 19:49:14,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:49:14,121 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:14,121 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:14,121 INFO L427 AbstractCegarLoop]: === Iteration 383 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:14,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:14,121 INFO L82 PathProgramCache]: Analyzing trace with hash 365970664, now seen corresponding path program 375 times [2020-02-10 19:49:14,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:14,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565786995] [2020-02-10 19:49:14,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:14,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:14,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:14,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565786995] [2020-02-10 19:49:14,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:14,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:49:14,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199561910] [2020-02-10 19:49:14,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:49:14,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:14,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:49:14,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:14,658 INFO L87 Difference]: Start difference. First operand 1567 states and 7037 transitions. Second operand 11 states. [2020-02-10 19:49:14,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:14,856 INFO L93 Difference]: Finished difference Result 2896 states and 11591 transitions. [2020-02-10 19:49:14,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:49:14,857 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:49:14,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:14,864 INFO L225 Difference]: With dead ends: 2896 [2020-02-10 19:49:14,864 INFO L226 Difference]: Without dead ends: 2881 [2020-02-10 19:49:14,864 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:49:14,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2881 states. [2020-02-10 19:49:14,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2881 to 1571. [2020-02-10 19:49:14,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 19:49:14,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7044 transitions. [2020-02-10 19:49:14,952 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7044 transitions. Word has length 28 [2020-02-10 19:49:14,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:14,952 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7044 transitions. [2020-02-10 19:49:14,952 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:49:14,952 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7044 transitions. [2020-02-10 19:49:14,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:49:14,955 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:14,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] [2020-02-10 19:49:14,955 INFO L427 AbstractCegarLoop]: === Iteration 384 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:14,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:14,956 INFO L82 PathProgramCache]: Analyzing trace with hash 539218356, now seen corresponding path program 376 times [2020-02-10 19:49:14,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:14,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81767325] [2020-02-10 19:49:14,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:14,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:15,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 19:49:15,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81767325] [2020-02-10 19:49:15,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:15,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:49:15,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113957233] [2020-02-10 19:49:15,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:49:15,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:15,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:49:15,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:15,486 INFO L87 Difference]: Start difference. First operand 1571 states and 7044 transitions. Second operand 11 states. [2020-02-10 19:49:15,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:15,670 INFO L93 Difference]: Finished difference Result 2895 states and 11585 transitions. [2020-02-10 19:49:15,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:49:15,671 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:49:15,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:15,678 INFO L225 Difference]: With dead ends: 2895 [2020-02-10 19:49:15,679 INFO L226 Difference]: Without dead ends: 2877 [2020-02-10 19:49:15,679 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:49:15,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2877 states. [2020-02-10 19:49:15,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2877 to 1567. [2020-02-10 19:49:15,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 19:49:15,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7033 transitions. [2020-02-10 19:49:15,750 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7033 transitions. Word has length 28 [2020-02-10 19:49:15,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:15,751 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7033 transitions. [2020-02-10 19:49:15,751 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:49:15,751 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7033 transitions. [2020-02-10 19:49:15,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:49:15,753 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:15,753 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:15,753 INFO L427 AbstractCegarLoop]: === Iteration 385 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:15,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:15,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1157033560, now seen corresponding path program 377 times [2020-02-10 19:49:15,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:15,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302164927] [2020-02-10 19:49:15,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:15,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:16,262 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 19:49:16,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 19:49:16,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302164927] [2020-02-10 19:49:16,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:16,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:49:16,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316112862] [2020-02-10 19:49:16,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:49:16,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:16,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:49:16,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:16,271 INFO L87 Difference]: Start difference. First operand 1567 states and 7033 transitions. Second operand 11 states. [2020-02-10 19:49:16,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:16,481 INFO L93 Difference]: Finished difference Result 2902 states and 11599 transitions. [2020-02-10 19:49:16,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:49:16,481 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:49:16,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:16,489 INFO L225 Difference]: With dead ends: 2902 [2020-02-10 19:49:16,489 INFO L226 Difference]: Without dead ends: 2884 [2020-02-10 19:49:16,489 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:49:16,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2884 states. [2020-02-10 19:49:16,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2884 to 1571. [2020-02-10 19:49:16,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 19:49:16,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7040 transitions. [2020-02-10 19:49:16,556 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7040 transitions. Word has length 28 [2020-02-10 19:49:16,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:16,556 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7040 transitions. [2020-02-10 19:49:16,556 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:49:16,556 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7040 transitions. [2020-02-10 19:49:16,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:49:16,558 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:16,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] [2020-02-10 19:49:16,559 INFO L427 AbstractCegarLoop]: === Iteration 386 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:16,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:16,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1077073934, now seen corresponding path program 378 times [2020-02-10 19:49:16,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:16,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546991403] [2020-02-10 19:49:16,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:16,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:17,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 19:49:17,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546991403] [2020-02-10 19:49:17,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:17,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:49:17,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876948520] [2020-02-10 19:49:17,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:49:17,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:17,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:49:17,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:17,070 INFO L87 Difference]: Start difference. First operand 1571 states and 7040 transitions. Second operand 11 states. [2020-02-10 19:49:17,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:17,312 INFO L93 Difference]: Finished difference Result 2898 states and 11587 transitions. [2020-02-10 19:49:17,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:49:17,313 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:49:17,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:17,319 INFO L225 Difference]: With dead ends: 2898 [2020-02-10 19:49:17,320 INFO L226 Difference]: Without dead ends: 2876 [2020-02-10 19:49:17,320 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:49:17,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2876 states. [2020-02-10 19:49:17,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2876 to 1563. [2020-02-10 19:49:17,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2020-02-10 19:49:17,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 7022 transitions. [2020-02-10 19:49:17,388 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 7022 transitions. Word has length 28 [2020-02-10 19:49:17,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:17,389 INFO L479 AbstractCegarLoop]: Abstraction has 1563 states and 7022 transitions. [2020-02-10 19:49:17,389 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:49:17,389 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 7022 transitions. [2020-02-10 19:49:17,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:49:17,391 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:17,391 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:17,391 INFO L427 AbstractCegarLoop]: === Iteration 387 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:17,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:17,391 INFO L82 PathProgramCache]: Analyzing trace with hash 583320688, now seen corresponding path program 379 times [2020-02-10 19:49:17,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:17,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579024046] [2020-02-10 19:49:17,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:17,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:17,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 19:49:17,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579024046] [2020-02-10 19:49:17,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:17,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:49:17,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992476543] [2020-02-10 19:49:17,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:49:17,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:17,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:49:17,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:17,911 INFO L87 Difference]: Start difference. First operand 1563 states and 7022 transitions. Second operand 11 states. [2020-02-10 19:49:18,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:18,176 INFO L93 Difference]: Finished difference Result 2906 states and 11614 transitions. [2020-02-10 19:49:18,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:49:18,176 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:49:18,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:18,184 INFO L225 Difference]: With dead ends: 2906 [2020-02-10 19:49:18,184 INFO L226 Difference]: Without dead ends: 2890 [2020-02-10 19:49:18,184 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:49:18,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2890 states. [2020-02-10 19:49:18,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2890 to 1573. [2020-02-10 19:49:18,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 19:49:18,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7048 transitions. [2020-02-10 19:49:18,252 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7048 transitions. Word has length 28 [2020-02-10 19:49:18,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:18,252 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7048 transitions. [2020-02-10 19:49:18,252 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:49:18,252 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7048 transitions. [2020-02-10 19:49:18,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:49:18,254 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:18,254 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:18,254 INFO L427 AbstractCegarLoop]: === Iteration 388 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:18,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:18,255 INFO L82 PathProgramCache]: Analyzing trace with hash 2072725684, now seen corresponding path program 380 times [2020-02-10 19:49:18,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:18,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522894369] [2020-02-10 19:49:18,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:18,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:18,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:18,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522894369] [2020-02-10 19:49:18,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:18,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:49:18,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747050546] [2020-02-10 19:49:18,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:49:18,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:18,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:49:18,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:18,777 INFO L87 Difference]: Start difference. First operand 1573 states and 7048 transitions. Second operand 11 states. [2020-02-10 19:49:19,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:19,040 INFO L93 Difference]: Finished difference Result 2908 states and 11612 transitions. [2020-02-10 19:49:19,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:49:19,041 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:49:19,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:19,048 INFO L225 Difference]: With dead ends: 2908 [2020-02-10 19:49:19,048 INFO L226 Difference]: Without dead ends: 2884 [2020-02-10 19:49:19,048 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:49:19,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2884 states. [2020-02-10 19:49:19,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2884 to 1567. [2020-02-10 19:49:19,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 19:49:19,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7033 transitions. [2020-02-10 19:49:19,115 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7033 transitions. Word has length 28 [2020-02-10 19:49:19,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:19,115 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7033 transitions. [2020-02-10 19:49:19,115 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:49:19,115 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7033 transitions. [2020-02-10 19:49:19,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:49:19,118 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:19,118 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:19,118 INFO L427 AbstractCegarLoop]: === Iteration 389 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:19,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:19,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1121176266, now seen corresponding path program 381 times [2020-02-10 19:49:19,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:19,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961627914] [2020-02-10 19:49:19,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:19,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:19,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:19,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961627914] [2020-02-10 19:49:19,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:19,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:49:19,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606798569] [2020-02-10 19:49:19,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:49:19,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:19,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:49:19,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:19,633 INFO L87 Difference]: Start difference. First operand 1567 states and 7033 transitions. Second operand 11 states. [2020-02-10 19:49:19,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:19,832 INFO L93 Difference]: Finished difference Result 2900 states and 11596 transitions. [2020-02-10 19:49:19,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:49:19,833 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:49:19,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:19,840 INFO L225 Difference]: With dead ends: 2900 [2020-02-10 19:49:19,841 INFO L226 Difference]: Without dead ends: 2884 [2020-02-10 19:49:19,841 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:49:19,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2884 states. [2020-02-10 19:49:19,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2884 to 1571. [2020-02-10 19:49:19,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 19:49:19,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7040 transitions. [2020-02-10 19:49:19,910 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7040 transitions. Word has length 28 [2020-02-10 19:49:19,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:19,910 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7040 transitions. [2020-02-10 19:49:19,910 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:49:19,910 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7040 transitions. [2020-02-10 19:49:19,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:49:19,912 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:19,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] [2020-02-10 19:49:19,913 INFO L427 AbstractCegarLoop]: === Iteration 390 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:19,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:19,913 INFO L82 PathProgramCache]: Analyzing trace with hash 549721460, now seen corresponding path program 382 times [2020-02-10 19:49:19,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:19,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806631448] [2020-02-10 19:49:19,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:19,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:20,437 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 19:49:20,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:20,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806631448] [2020-02-10 19:49:20,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:20,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:49:20,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213792065] [2020-02-10 19:49:20,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:49:20,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:20,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:49:20,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:20,446 INFO L87 Difference]: Start difference. First operand 1571 states and 7040 transitions. Second operand 11 states. [2020-02-10 19:49:20,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:20,713 INFO L93 Difference]: Finished difference Result 2898 states and 11588 transitions. [2020-02-10 19:49:20,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:49:20,713 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:49:20,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:20,721 INFO L225 Difference]: With dead ends: 2898 [2020-02-10 19:49:20,721 INFO L226 Difference]: Without dead ends: 2880 [2020-02-10 19:49:20,721 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:49:20,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2880 states. [2020-02-10 19:49:20,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2880 to 1567. [2020-02-10 19:49:20,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 19:49:20,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7029 transitions. [2020-02-10 19:49:20,790 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7029 transitions. Word has length 28 [2020-02-10 19:49:20,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:20,790 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7029 transitions. [2020-02-10 19:49:20,790 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:49:20,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7029 transitions. [2020-02-10 19:49:20,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:49:20,792 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:20,792 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:20,792 INFO L427 AbstractCegarLoop]: === Iteration 391 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:20,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:20,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1537495882, now seen corresponding path program 383 times [2020-02-10 19:49:20,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:20,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500807105] [2020-02-10 19:49:20,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:20,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:21,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 19:49:21,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500807105] [2020-02-10 19:49:21,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:21,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:49:21,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554362478] [2020-02-10 19:49:21,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:49:21,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:21,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:49:21,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:21,317 INFO L87 Difference]: Start difference. First operand 1567 states and 7029 transitions. Second operand 11 states. [2020-02-10 19:49:21,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:21,589 INFO L93 Difference]: Finished difference Result 2904 states and 11600 transitions. [2020-02-10 19:49:21,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:49:21,590 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:49:21,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:21,597 INFO L225 Difference]: With dead ends: 2904 [2020-02-10 19:49:21,597 INFO L226 Difference]: Without dead ends: 2886 [2020-02-10 19:49:21,597 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:49:21,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2886 states. [2020-02-10 19:49:21,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2886 to 1571. [2020-02-10 19:49:21,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 19:49:21,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7036 transitions. [2020-02-10 19:49:21,669 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7036 transitions. Word has length 28 [2020-02-10 19:49:21,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:21,669 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7036 transitions. [2020-02-10 19:49:21,670 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:49:21,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7036 transitions. [2020-02-10 19:49:21,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:49:21,672 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:21,672 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:21,672 INFO L427 AbstractCegarLoop]: === Iteration 392 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:21,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:21,673 INFO L82 PathProgramCache]: Analyzing trace with hash -523363920, now seen corresponding path program 384 times [2020-02-10 19:49:21,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:21,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424659897] [2020-02-10 19:49:21,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:21,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:22,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:22,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424659897] [2020-02-10 19:49:22,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:22,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:49:22,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021074205] [2020-02-10 19:49:22,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:49:22,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:22,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:49:22,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:22,193 INFO L87 Difference]: Start difference. First operand 1571 states and 7036 transitions. Second operand 11 states. [2020-02-10 19:49:22,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:22,402 INFO L93 Difference]: Finished difference Result 2900 states and 11588 transitions. [2020-02-10 19:49:22,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:49:22,403 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:49:22,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:22,410 INFO L225 Difference]: With dead ends: 2900 [2020-02-10 19:49:22,410 INFO L226 Difference]: Without dead ends: 2874 [2020-02-10 19:49:22,410 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:49:22,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2874 states. [2020-02-10 19:49:22,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2874 to 1559. [2020-02-10 19:49:22,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1559 states. [2020-02-10 19:49:22,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 7011 transitions. [2020-02-10 19:49:22,477 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 7011 transitions. Word has length 28 [2020-02-10 19:49:22,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:22,477 INFO L479 AbstractCegarLoop]: Abstraction has 1559 states and 7011 transitions. [2020-02-10 19:49:22,477 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:49:22,477 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 7011 transitions. [2020-02-10 19:49:22,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:49:22,479 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:22,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] [2020-02-10 19:49:22,479 INFO L427 AbstractCegarLoop]: === Iteration 393 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:22,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:22,480 INFO L82 PathProgramCache]: Analyzing trace with hash -129443996, now seen corresponding path program 385 times [2020-02-10 19:49:22,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:22,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049145387] [2020-02-10 19:49:22,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:22,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:23,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 19:49:23,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049145387] [2020-02-10 19:49:23,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:23,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:49:23,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666055397] [2020-02-10 19:49:23,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:49:23,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:23,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:49:23,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:23,006 INFO L87 Difference]: Start difference. First operand 1559 states and 7011 transitions. Second operand 11 states. [2020-02-10 19:49:23,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:23,221 INFO L93 Difference]: Finished difference Result 2919 states and 11668 transitions. [2020-02-10 19:49:23,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:49:23,222 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:49:23,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:23,229 INFO L225 Difference]: With dead ends: 2919 [2020-02-10 19:49:23,229 INFO L226 Difference]: Without dead ends: 2904 [2020-02-10 19:49:23,229 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:49:23,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2904 states. [2020-02-10 19:49:23,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2904 to 1574. [2020-02-10 19:49:23,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 19:49:23,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7063 transitions. [2020-02-10 19:49:23,296 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7063 transitions. Word has length 28 [2020-02-10 19:49:23,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:23,296 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7063 transitions. [2020-02-10 19:49:23,296 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:49:23,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7063 transitions. [2020-02-10 19:49:23,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:49:23,299 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:23,299 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:23,299 INFO L427 AbstractCegarLoop]: === Iteration 394 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:23,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:23,299 INFO L82 PathProgramCache]: Analyzing trace with hash 615258502, now seen corresponding path program 386 times [2020-02-10 19:49:23,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:23,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594925931] [2020-02-10 19:49:23,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:23,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:23,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:23,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594925931] [2020-02-10 19:49:23,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:23,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:49:23,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428350913] [2020-02-10 19:49:23,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:49:23,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:23,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:49:23,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:23,836 INFO L87 Difference]: Start difference. First operand 1574 states and 7063 transitions. Second operand 11 states. [2020-02-10 19:49:24,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:24,054 INFO L93 Difference]: Finished difference Result 2920 states and 11665 transitions. [2020-02-10 19:49:24,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:49:24,054 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:49:24,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:24,061 INFO L225 Difference]: With dead ends: 2920 [2020-02-10 19:49:24,061 INFO L226 Difference]: Without dead ends: 2899 [2020-02-10 19:49:24,061 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:49:24,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2899 states. [2020-02-10 19:49:24,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2899 to 1569. [2020-02-10 19:49:24,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 19:49:24,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7049 transitions. [2020-02-10 19:49:24,128 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7049 transitions. Word has length 28 [2020-02-10 19:49:24,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:24,128 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7049 transitions. [2020-02-10 19:49:24,128 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:49:24,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7049 transitions. [2020-02-10 19:49:24,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:49:24,130 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:24,130 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:24,130 INFO L427 AbstractCegarLoop]: === Iteration 395 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:24,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:24,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1202529376, now seen corresponding path program 387 times [2020-02-10 19:49:24,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:24,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191656733] [2020-02-10 19:49:24,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:24,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:24,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:24,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191656733] [2020-02-10 19:49:24,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:24,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:49:24,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820200046] [2020-02-10 19:49:24,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:49:24,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:24,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:49:24,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:24,655 INFO L87 Difference]: Start difference. First operand 1569 states and 7049 transitions. Second operand 11 states. [2020-02-10 19:49:24,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:24,923 INFO L93 Difference]: Finished difference Result 2921 states and 11667 transitions. [2020-02-10 19:49:24,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:49:24,924 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:49:24,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:24,931 INFO L225 Difference]: With dead ends: 2921 [2020-02-10 19:49:24,931 INFO L226 Difference]: Without dead ends: 2906 [2020-02-10 19:49:24,932 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:49:24,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2906 states. [2020-02-10 19:49:24,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2906 to 1574. [2020-02-10 19:49:24,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 19:49:24,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7058 transitions. [2020-02-10 19:49:24,999 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7058 transitions. Word has length 28 [2020-02-10 19:49:24,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:24,999 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7058 transitions. [2020-02-10 19:49:24,999 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:49:24,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7058 transitions. [2020-02-10 19:49:25,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:49:25,001 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:25,001 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:25,001 INFO L427 AbstractCegarLoop]: === Iteration 396 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:25,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:25,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1031578118, now seen corresponding path program 388 times [2020-02-10 19:49:25,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:25,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208595073] [2020-02-10 19:49:25,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:25,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:25,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:25,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208595073] [2020-02-10 19:49:25,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:25,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:49:25,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208444166] [2020-02-10 19:49:25,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:49:25,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:25,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:49:25,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:25,525 INFO L87 Difference]: Start difference. First operand 1574 states and 7058 transitions. Second operand 11 states. [2020-02-10 19:49:25,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:25,790 INFO L93 Difference]: Finished difference Result 2924 states and 11668 transitions. [2020-02-10 19:49:25,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:49:25,791 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:49:25,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:25,797 INFO L225 Difference]: With dead ends: 2924 [2020-02-10 19:49:25,797 INFO L226 Difference]: Without dead ends: 2901 [2020-02-10 19:49:25,797 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:49:25,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2901 states. [2020-02-10 19:49:25,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2901 to 1569. [2020-02-10 19:49:25,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 19:49:25,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7044 transitions. [2020-02-10 19:49:25,864 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7044 transitions. Word has length 28 [2020-02-10 19:49:25,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:25,864 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7044 transitions. [2020-02-10 19:49:25,864 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:49:25,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7044 transitions. [2020-02-10 19:49:25,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:49:25,866 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:25,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] [2020-02-10 19:49:25,866 INFO L427 AbstractCegarLoop]: === Iteration 397 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:25,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:25,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1153114080, now seen corresponding path program 389 times [2020-02-10 19:49:25,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:25,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116179151] [2020-02-10 19:49:25,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:25,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:26,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 19:49:26,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116179151] [2020-02-10 19:49:26,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:26,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:49:26,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323493259] [2020-02-10 19:49:26,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:49:26,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:26,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:49:26,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:26,429 INFO L87 Difference]: Start difference. First operand 1569 states and 7044 transitions. Second operand 11 states. [2020-02-10 19:49:26,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:26,601 INFO L93 Difference]: Finished difference Result 2924 states and 11669 transitions. [2020-02-10 19:49:26,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:49:26,602 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:49:26,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:26,609 INFO L225 Difference]: With dead ends: 2924 [2020-02-10 19:49:26,609 INFO L226 Difference]: Without dead ends: 2908 [2020-02-10 19:49:26,609 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:49:26,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2908 states. [2020-02-10 19:49:26,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2908 to 1575. [2020-02-10 19:49:26,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 19:49:26,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7055 transitions. [2020-02-10 19:49:26,676 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7055 transitions. Word has length 28 [2020-02-10 19:49:26,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:26,676 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7055 transitions. [2020-02-10 19:49:26,677 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:49:26,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7055 transitions. [2020-02-10 19:49:26,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:49:26,679 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:26,679 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:26,679 INFO L427 AbstractCegarLoop]: === Iteration 398 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:26,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:26,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1652448220, now seen corresponding path program 390 times [2020-02-10 19:49:26,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:26,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439051840] [2020-02-10 19:49:26,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:26,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:27,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:27,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439051840] [2020-02-10 19:49:27,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:27,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:49:27,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870781142] [2020-02-10 19:49:27,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:49:27,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:27,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:49:27,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:27,194 INFO L87 Difference]: Start difference. First operand 1575 states and 7055 transitions. Second operand 11 states. [2020-02-10 19:49:27,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:27,369 INFO L93 Difference]: Finished difference Result 2926 states and 11667 transitions. [2020-02-10 19:49:27,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:49:27,370 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:49:27,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:27,377 INFO L225 Difference]: With dead ends: 2926 [2020-02-10 19:49:27,377 INFO L226 Difference]: Without dead ends: 2897 [2020-02-10 19:49:27,377 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:49:27,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2897 states. [2020-02-10 19:49:27,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2897 to 1564. [2020-02-10 19:49:27,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1564 states. [2020-02-10 19:49:27,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 7030 transitions. [2020-02-10 19:49:27,444 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 7030 transitions. Word has length 28 [2020-02-10 19:49:27,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:27,445 INFO L479 AbstractCegarLoop]: Abstraction has 1564 states and 7030 transitions. [2020-02-10 19:49:27,445 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:49:27,445 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 7030 transitions. [2020-02-10 19:49:27,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:49:27,447 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:27,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] [2020-02-10 19:49:27,447 INFO L427 AbstractCegarLoop]: === Iteration 399 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:27,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:27,447 INFO L82 PathProgramCache]: Analyzing trace with hash 458301326, now seen corresponding path program 391 times [2020-02-10 19:49:27,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:27,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535360395] [2020-02-10 19:49:27,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:27,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:27,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 19:49:27,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535360395] [2020-02-10 19:49:27,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:27,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:49:27,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990119145] [2020-02-10 19:49:27,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:49:27,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:27,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:49:27,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:27,980 INFO L87 Difference]: Start difference. First operand 1564 states and 7030 transitions. Second operand 11 states. [2020-02-10 19:49:28,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:28,151 INFO L93 Difference]: Finished difference Result 2918 states and 11661 transitions. [2020-02-10 19:49:28,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:49:28,152 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:49:28,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:28,159 INFO L225 Difference]: With dead ends: 2918 [2020-02-10 19:49:28,159 INFO L226 Difference]: Without dead ends: 2903 [2020-02-10 19:49:28,159 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:49:28,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2903 states. [2020-02-10 19:49:28,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2903 to 1574. [2020-02-10 19:49:28,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 19:49:28,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7058 transitions. [2020-02-10 19:49:28,227 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7058 transitions. Word has length 28 [2020-02-10 19:49:28,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:28,227 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7058 transitions. [2020-02-10 19:49:28,227 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:49:28,227 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7058 transitions. [2020-02-10 19:49:28,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:49:28,230 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:28,230 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:28,230 INFO L427 AbstractCegarLoop]: === Iteration 400 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:28,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:28,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1203003824, now seen corresponding path program 392 times [2020-02-10 19:49:28,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:28,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009138296] [2020-02-10 19:49:28,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:28,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:28,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 19:49:28,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009138296] [2020-02-10 19:49:28,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:28,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:49:28,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530548931] [2020-02-10 19:49:28,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:49:28,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:28,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:49:28,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:28,773 INFO L87 Difference]: Start difference. First operand 1574 states and 7058 transitions. Second operand 11 states. [2020-02-10 19:49:28,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:28,941 INFO L93 Difference]: Finished difference Result 2919 states and 11658 transitions. [2020-02-10 19:49:28,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:49:28,941 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:49:28,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:28,948 INFO L225 Difference]: With dead ends: 2919 [2020-02-10 19:49:28,949 INFO L226 Difference]: Without dead ends: 2898 [2020-02-10 19:49:28,949 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:49:28,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2898 states. [2020-02-10 19:49:29,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2898 to 1569. [2020-02-10 19:49:29,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 19:49:29,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7044 transitions. [2020-02-10 19:49:29,016 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7044 transitions. Word has length 28 [2020-02-10 19:49:29,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:29,016 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7044 transitions. [2020-02-10 19:49:29,016 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:49:29,016 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7044 transitions. [2020-02-10 19:49:29,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:49:29,018 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:29,018 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:29,018 INFO L427 AbstractCegarLoop]: === Iteration 401 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:29,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:29,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1150013856, now seen corresponding path program 393 times [2020-02-10 19:49:29,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:29,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106178443] [2020-02-10 19:49:29,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:29,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:29,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 19:49:29,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106178443] [2020-02-10 19:49:29,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:29,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:49:29,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216214028] [2020-02-10 19:49:29,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:49:29,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:29,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:49:29,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:29,550 INFO L87 Difference]: Start difference. First operand 1569 states and 7044 transitions. Second operand 11 states. [2020-02-10 19:49:29,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:29,726 INFO L93 Difference]: Finished difference Result 2919 states and 11658 transitions. [2020-02-10 19:49:29,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:49:29,726 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:49:29,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:29,733 INFO L225 Difference]: With dead ends: 2919 [2020-02-10 19:49:29,733 INFO L226 Difference]: Without dead ends: 2904 [2020-02-10 19:49:29,733 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:49:29,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2904 states. [2020-02-10 19:49:29,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2904 to 1574. [2020-02-10 19:49:29,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 19:49:29,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7053 transitions. [2020-02-10 19:49:29,800 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7053 transitions. Word has length 28 [2020-02-10 19:49:29,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:29,800 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7053 transitions. [2020-02-10 19:49:29,800 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:49:29,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7053 transitions. [2020-02-10 19:49:29,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:49:29,803 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:29,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] [2020-02-10 19:49:29,803 INFO L427 AbstractCegarLoop]: === Iteration 402 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:29,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:29,803 INFO L82 PathProgramCache]: Analyzing trace with hash 512638832, now seen corresponding path program 394 times [2020-02-10 19:49:29,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:29,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599012206] [2020-02-10 19:49:29,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:29,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:30,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:30,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599012206] [2020-02-10 19:49:30,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:30,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:49:30,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679828322] [2020-02-10 19:49:30,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:49:30,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:30,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:49:30,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:30,329 INFO L87 Difference]: Start difference. First operand 1574 states and 7053 transitions. Second operand 11 states. [2020-02-10 19:49:30,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:30,512 INFO L93 Difference]: Finished difference Result 2921 states and 11657 transitions. [2020-02-10 19:49:30,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:49:30,512 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:49:30,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:30,520 INFO L225 Difference]: With dead ends: 2921 [2020-02-10 19:49:30,520 INFO L226 Difference]: Without dead ends: 2899 [2020-02-10 19:49:30,520 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:49:30,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2899 states. [2020-02-10 19:49:30,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2899 to 1569. [2020-02-10 19:49:30,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 19:49:30,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7039 transitions. [2020-02-10 19:49:30,587 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7039 transitions. Word has length 28 [2020-02-10 19:49:30,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:30,587 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7039 transitions. [2020-02-10 19:49:30,587 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:49:30,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7039 transitions. [2020-02-10 19:49:30,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:49:30,589 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:30,590 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:30,590 INFO L427 AbstractCegarLoop]: === Iteration 403 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:30,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:30,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1205629600, now seen corresponding path program 395 times [2020-02-10 19:49:30,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:30,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409382525] [2020-02-10 19:49:30,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:30,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:31,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 19:49:31,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409382525] [2020-02-10 19:49:31,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:31,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:49:31,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127850214] [2020-02-10 19:49:31,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:49:31,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:31,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:49:31,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:31,122 INFO L87 Difference]: Start difference. First operand 1569 states and 7039 transitions. Second operand 11 states. [2020-02-10 19:49:31,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:31,293 INFO L93 Difference]: Finished difference Result 2922 states and 11660 transitions. [2020-02-10 19:49:31,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:49:31,294 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:49:31,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:31,301 INFO L225 Difference]: With dead ends: 2922 [2020-02-10 19:49:31,301 INFO L226 Difference]: Without dead ends: 2906 [2020-02-10 19:49:31,301 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:49:31,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2906 states. [2020-02-10 19:49:31,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2906 to 1575. [2020-02-10 19:49:31,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 19:49:31,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7050 transitions. [2020-02-10 19:49:31,388 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7050 transitions. Word has length 28 [2020-02-10 19:49:31,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:31,388 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7050 transitions. [2020-02-10 19:49:31,388 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:49:31,388 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7050 transitions. [2020-02-10 19:49:31,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:49:31,390 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:31,390 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:31,390 INFO L427 AbstractCegarLoop]: === Iteration 404 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:31,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:31,391 INFO L82 PathProgramCache]: Analyzing trace with hash 2123579790, now seen corresponding path program 396 times [2020-02-10 19:49:31,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:31,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679877706] [2020-02-10 19:49:31,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:31,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:31,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 19:49:31,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679877706] [2020-02-10 19:49:31,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:31,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:49:31,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739702096] [2020-02-10 19:49:31,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:49:31,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:31,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:49:31,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:31,920 INFO L87 Difference]: Start difference. First operand 1575 states and 7050 transitions. Second operand 11 states. [2020-02-10 19:49:32,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:32,121 INFO L93 Difference]: Finished difference Result 2923 states and 11656 transitions. [2020-02-10 19:49:32,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:49:32,122 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:49:32,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:32,128 INFO L225 Difference]: With dead ends: 2923 [2020-02-10 19:49:32,129 INFO L226 Difference]: Without dead ends: 2895 [2020-02-10 19:49:32,129 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:49:32,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2895 states. [2020-02-10 19:49:32,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2895 to 1564. [2020-02-10 19:49:32,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1564 states. [2020-02-10 19:49:32,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 7025 transitions. [2020-02-10 19:49:32,199 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 7025 transitions. Word has length 28 [2020-02-10 19:49:32,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:32,200 INFO L479 AbstractCegarLoop]: Abstraction has 1564 states and 7025 transitions. [2020-02-10 19:49:32,200 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:49:32,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 7025 transitions. [2020-02-10 19:49:32,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:49:32,202 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:32,202 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:32,202 INFO L427 AbstractCegarLoop]: === Iteration 405 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:32,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:32,203 INFO L82 PathProgramCache]: Analyzing trace with hash 479307534, now seen corresponding path program 397 times [2020-02-10 19:49:32,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:32,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909453355] [2020-02-10 19:49:32,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:32,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:32,724 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 19:49:32,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:32,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909453355] [2020-02-10 19:49:32,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:32,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:49:32,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930971817] [2020-02-10 19:49:32,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:49:32,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:32,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:49:32,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:32,732 INFO L87 Difference]: Start difference. First operand 1564 states and 7025 transitions. Second operand 11 states. [2020-02-10 19:49:32,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:32,931 INFO L93 Difference]: Finished difference Result 2923 states and 11667 transitions. [2020-02-10 19:49:32,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:49:32,932 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:49:32,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:32,939 INFO L225 Difference]: With dead ends: 2923 [2020-02-10 19:49:32,939 INFO L226 Difference]: Without dead ends: 2908 [2020-02-10 19:49:32,939 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:49:32,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2908 states. [2020-02-10 19:49:33,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2908 to 1574. [2020-02-10 19:49:33,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 19:49:33,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7053 transitions. [2020-02-10 19:49:33,007 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7053 transitions. Word has length 28 [2020-02-10 19:49:33,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:33,007 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7053 transitions. [2020-02-10 19:49:33,007 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:49:33,007 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7053 transitions. [2020-02-10 19:49:33,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:49:33,009 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:33,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] [2020-02-10 19:49:33,010 INFO L427 AbstractCegarLoop]: === Iteration 406 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:33,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:33,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1581552268, now seen corresponding path program 398 times [2020-02-10 19:49:33,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:33,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246483265] [2020-02-10 19:49:33,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:33,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:33,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:33,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246483265] [2020-02-10 19:49:33,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:33,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:49:33,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499309096] [2020-02-10 19:49:33,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:49:33,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:33,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:49:33,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:33,536 INFO L87 Difference]: Start difference. First operand 1574 states and 7053 transitions. Second operand 11 states. [2020-02-10 19:49:33,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:33,713 INFO L93 Difference]: Finished difference Result 2926 states and 11668 transitions. [2020-02-10 19:49:33,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:49:33,714 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:49:33,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:33,721 INFO L225 Difference]: With dead ends: 2926 [2020-02-10 19:49:33,721 INFO L226 Difference]: Without dead ends: 2903 [2020-02-10 19:49:33,721 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:49:33,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2903 states. [2020-02-10 19:49:33,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2903 to 1569. [2020-02-10 19:49:33,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 19:49:33,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7039 transitions. [2020-02-10 19:49:33,788 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7039 transitions. Word has length 28 [2020-02-10 19:49:33,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:33,788 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7039 transitions. [2020-02-10 19:49:33,788 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:49:33,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7039 transitions. [2020-02-10 19:49:33,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:49:33,791 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:33,791 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:33,791 INFO L427 AbstractCegarLoop]: === Iteration 407 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:33,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:33,791 INFO L82 PathProgramCache]: Analyzing trace with hash -55922268, now seen corresponding path program 399 times [2020-02-10 19:49:33,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:33,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374273439] [2020-02-10 19:49:33,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:33,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:34,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 19:49:34,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374273439] [2020-02-10 19:49:34,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:34,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:49:34,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631887535] [2020-02-10 19:49:34,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:49:34,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:34,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:49:34,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:34,321 INFO L87 Difference]: Start difference. First operand 1569 states and 7039 transitions. Second operand 11 states. [2020-02-10 19:49:34,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:34,507 INFO L93 Difference]: Finished difference Result 2922 states and 11660 transitions. [2020-02-10 19:49:34,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:49:34,507 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:49:34,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:34,514 INFO L225 Difference]: With dead ends: 2922 [2020-02-10 19:49:34,514 INFO L226 Difference]: Without dead ends: 2907 [2020-02-10 19:49:34,514 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:49:34,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2907 states. [2020-02-10 19:49:34,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2907 to 1574. [2020-02-10 19:49:34,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 19:49:34,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7048 transitions. [2020-02-10 19:49:34,581 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7048 transitions. Word has length 28 [2020-02-10 19:49:34,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:34,582 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7048 transitions. [2020-02-10 19:49:34,582 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:49:34,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7048 transitions. [2020-02-10 19:49:34,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:49:34,584 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:34,584 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:34,584 INFO L427 AbstractCegarLoop]: === Iteration 408 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:34,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:34,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1606730420, now seen corresponding path program 400 times [2020-02-10 19:49:34,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:34,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496886078] [2020-02-10 19:49:34,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:34,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:35,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:35,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496886078] [2020-02-10 19:49:35,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:35,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:49:35,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344026420] [2020-02-10 19:49:35,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:49:35,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:35,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:49:35,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:35,115 INFO L87 Difference]: Start difference. First operand 1574 states and 7048 transitions. Second operand 11 states. [2020-02-10 19:49:35,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:35,304 INFO L93 Difference]: Finished difference Result 2924 states and 11659 transitions. [2020-02-10 19:49:35,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:49:35,305 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:49:35,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:35,311 INFO L225 Difference]: With dead ends: 2924 [2020-02-10 19:49:35,311 INFO L226 Difference]: Without dead ends: 2902 [2020-02-10 19:49:35,312 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:49:35,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2902 states. [2020-02-10 19:49:35,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2902 to 1569. [2020-02-10 19:49:35,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 19:49:35,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7034 transitions. [2020-02-10 19:49:35,379 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7034 transitions. Word has length 28 [2020-02-10 19:49:35,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:35,379 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7034 transitions. [2020-02-10 19:49:35,379 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:49:35,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7034 transitions. [2020-02-10 19:49:35,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:49:35,381 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:35,381 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:35,381 INFO L427 AbstractCegarLoop]: === Iteration 409 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:35,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:35,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1578926492, now seen corresponding path program 401 times [2020-02-10 19:49:35,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:35,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49109749] [2020-02-10 19:49:35,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:35,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:35,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:35,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49109749] [2020-02-10 19:49:35,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:35,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:49:35,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086526640] [2020-02-10 19:49:35,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:49:35,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:35,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:49:35,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:35,910 INFO L87 Difference]: Start difference. First operand 1569 states and 7034 transitions. Second operand 11 states. [2020-02-10 19:49:36,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:36,127 INFO L93 Difference]: Finished difference Result 2930 states and 11673 transitions. [2020-02-10 19:49:36,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:49:36,127 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:49:36,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:36,134 INFO L225 Difference]: With dead ends: 2930 [2020-02-10 19:49:36,134 INFO L226 Difference]: Without dead ends: 2912 [2020-02-10 19:49:36,134 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:49:36,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2912 states. [2020-02-10 19:49:36,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2912 to 1576. [2020-02-10 19:49:36,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 19:49:36,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7047 transitions. [2020-02-10 19:49:36,202 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7047 transitions. Word has length 28 [2020-02-10 19:49:36,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:36,202 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7047 transitions. [2020-02-10 19:49:36,202 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:49:36,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7047 transitions. [2020-02-10 19:49:36,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:49:36,204 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:36,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] [2020-02-10 19:49:36,205 INFO L427 AbstractCegarLoop]: === Iteration 410 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:36,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:36,205 INFO L82 PathProgramCache]: Analyzing trace with hash 2144585998, now seen corresponding path program 402 times [2020-02-10 19:49:36,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:36,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085139313] [2020-02-10 19:49:36,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:36,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:36,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:36,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085139313] [2020-02-10 19:49:36,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:36,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:49:36,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024103961] [2020-02-10 19:49:36,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:49:36,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:36,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:49:36,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:36,727 INFO L87 Difference]: Start difference. First operand 1576 states and 7047 transitions. Second operand 11 states. [2020-02-10 19:49:36,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:36,921 INFO L93 Difference]: Finished difference Result 2929 states and 11664 transitions. [2020-02-10 19:49:36,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:49:36,922 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:49:36,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:36,929 INFO L225 Difference]: With dead ends: 2929 [2020-02-10 19:49:36,929 INFO L226 Difference]: Without dead ends: 2900 [2020-02-10 19:49:36,929 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:49:36,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2900 states. [2020-02-10 19:49:36,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2900 to 1564. [2020-02-10 19:49:36,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1564 states. [2020-02-10 19:49:36,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 7020 transitions. [2020-02-10 19:49:36,996 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 7020 transitions. Word has length 28 [2020-02-10 19:49:36,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:36,996 INFO L479 AbstractCegarLoop]: Abstraction has 1564 states and 7020 transitions. [2020-02-10 19:49:36,996 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:49:36,996 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 7020 transitions. [2020-02-10 19:49:36,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:49:36,998 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:36,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] [2020-02-10 19:49:36,998 INFO L427 AbstractCegarLoop]: === Iteration 411 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:36,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:36,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1234513136, now seen corresponding path program 403 times [2020-02-10 19:49:36,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:36,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474292561] [2020-02-10 19:49:36,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:37,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:37,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:37,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474292561] [2020-02-10 19:49:37,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:37,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:49:37,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596399862] [2020-02-10 19:49:37,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:49:37,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:37,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:49:37,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:37,524 INFO L87 Difference]: Start difference. First operand 1564 states and 7020 transitions. Second operand 11 states. [2020-02-10 19:49:37,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:37,710 INFO L93 Difference]: Finished difference Result 2930 states and 11681 transitions. [2020-02-10 19:49:37,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:49:37,710 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:49:37,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:37,718 INFO L225 Difference]: With dead ends: 2930 [2020-02-10 19:49:37,718 INFO L226 Difference]: Without dead ends: 2914 [2020-02-10 19:49:37,718 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:49:37,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2914 states. [2020-02-10 19:49:37,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2914 to 1576. [2020-02-10 19:49:37,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 19:49:37,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7054 transitions. [2020-02-10 19:49:37,786 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7054 transitions. Word has length 28 [2020-02-10 19:49:37,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:37,786 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7054 transitions. [2020-02-10 19:49:37,786 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:49:37,786 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7054 transitions. [2020-02-10 19:49:37,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:49:37,788 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:37,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] [2020-02-10 19:49:37,788 INFO L427 AbstractCegarLoop]: === Iteration 412 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:37,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:37,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1571049164, now seen corresponding path program 404 times [2020-02-10 19:49:37,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:37,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552792233] [2020-02-10 19:49:37,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:37,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:38,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 19:49:38,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552792233] [2020-02-10 19:49:38,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:38,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:49:38,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233547760] [2020-02-10 19:49:38,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:49:38,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:38,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:49:38,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:38,323 INFO L87 Difference]: Start difference. First operand 1576 states and 7054 transitions. Second operand 11 states. [2020-02-10 19:49:38,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:38,519 INFO L93 Difference]: Finished difference Result 2932 states and 11679 transitions. [2020-02-10 19:49:38,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:49:38,519 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:49:38,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:38,526 INFO L225 Difference]: With dead ends: 2932 [2020-02-10 19:49:38,526 INFO L226 Difference]: Without dead ends: 2908 [2020-02-10 19:49:38,526 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:49:38,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2908 states. [2020-02-10 19:49:38,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2908 to 1570. [2020-02-10 19:49:38,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 19:49:38,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7037 transitions. [2020-02-10 19:49:38,593 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7037 transitions. Word has length 28 [2020-02-10 19:49:38,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:38,593 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7037 transitions. [2020-02-10 19:49:38,593 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:49:38,593 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7037 transitions. [2020-02-10 19:49:38,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:49:38,596 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:38,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] [2020-02-10 19:49:38,596 INFO L427 AbstractCegarLoop]: === Iteration 413 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:38,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:38,596 INFO L82 PathProgramCache]: Analyzing trace with hash 699283334, now seen corresponding path program 405 times [2020-02-10 19:49:38,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:38,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514965721] [2020-02-10 19:49:38,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:38,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:39,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:39,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514965721] [2020-02-10 19:49:39,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:39,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:49:39,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160611343] [2020-02-10 19:49:39,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:49:39,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:39,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:49:39,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:39,135 INFO L87 Difference]: Start difference. First operand 1570 states and 7037 transitions. Second operand 11 states. [2020-02-10 19:49:39,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:39,317 INFO L93 Difference]: Finished difference Result 2929 states and 11673 transitions. [2020-02-10 19:49:39,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:49:39,317 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:49:39,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:39,324 INFO L225 Difference]: With dead ends: 2929 [2020-02-10 19:49:39,324 INFO L226 Difference]: Without dead ends: 2913 [2020-02-10 19:49:39,325 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:49:39,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2913 states. [2020-02-10 19:49:39,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2913 to 1576. [2020-02-10 19:49:39,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 19:49:39,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7048 transitions. [2020-02-10 19:49:39,392 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7048 transitions. Word has length 28 [2020-02-10 19:49:39,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:39,392 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7048 transitions. [2020-02-10 19:49:39,392 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:49:39,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7048 transitions. [2020-02-10 19:49:39,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:49:39,394 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:39,394 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:39,394 INFO L427 AbstractCegarLoop]: === Iteration 414 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:39,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:39,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1617233524, now seen corresponding path program 406 times [2020-02-10 19:49:39,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:39,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893704717] [2020-02-10 19:49:39,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:39,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:39,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 19:49:39,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893704717] [2020-02-10 19:49:39,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:39,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:49:39,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836676228] [2020-02-10 19:49:39,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:49:39,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:39,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:49:39,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:39,928 INFO L87 Difference]: Start difference. First operand 1576 states and 7048 transitions. Second operand 11 states. [2020-02-10 19:49:40,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:40,113 INFO L93 Difference]: Finished difference Result 2930 states and 11669 transitions. [2020-02-10 19:49:40,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:49:40,113 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:49:40,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:40,120 INFO L225 Difference]: With dead ends: 2930 [2020-02-10 19:49:40,121 INFO L226 Difference]: Without dead ends: 2907 [2020-02-10 19:49:40,121 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:49:40,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2907 states. [2020-02-10 19:49:40,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2907 to 1570. [2020-02-10 19:49:40,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 19:49:40,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7031 transitions. [2020-02-10 19:49:40,188 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7031 transitions. Word has length 28 [2020-02-10 19:49:40,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:40,188 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7031 transitions. [2020-02-10 19:49:40,188 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:49:40,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7031 transitions. [2020-02-10 19:49:40,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:49:40,190 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:40,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] [2020-02-10 19:49:40,190 INFO L427 AbstractCegarLoop]: === Iteration 415 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:40,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:40,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1115602950, now seen corresponding path program 407 times [2020-02-10 19:49:40,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:40,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320627835] [2020-02-10 19:49:40,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:40,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:40,717 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 33 [2020-02-10 19:49:40,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:40,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320627835] [2020-02-10 19:49:40,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:40,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:49:40,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595707996] [2020-02-10 19:49:40,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:49:40,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:40,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:49:40,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:40,726 INFO L87 Difference]: Start difference. First operand 1570 states and 7031 transitions. Second operand 11 states. [2020-02-10 19:49:40,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:40,900 INFO L93 Difference]: Finished difference Result 2934 states and 11678 transitions. [2020-02-10 19:49:40,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:49:40,901 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:49:40,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:40,908 INFO L225 Difference]: With dead ends: 2934 [2020-02-10 19:49:40,909 INFO L226 Difference]: Without dead ends: 2916 [2020-02-10 19:49:40,909 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:49:40,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2916 states. [2020-02-10 19:49:40,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2916 to 1577. [2020-02-10 19:49:40,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 19:49:40,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7044 transitions. [2020-02-10 19:49:40,976 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7044 transitions. Word has length 28 [2020-02-10 19:49:40,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:40,976 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7044 transitions. [2020-02-10 19:49:40,976 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:49:40,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7044 transitions. [2020-02-10 19:49:40,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:49:40,978 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:40,978 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:40,978 INFO L427 AbstractCegarLoop]: === Iteration 416 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:40,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:40,979 INFO L82 PathProgramCache]: Analyzing trace with hash 544148144, now seen corresponding path program 408 times [2020-02-10 19:49:40,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:40,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745407325] [2020-02-10 19:49:40,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:40,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:41,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 19:49:41,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745407325] [2020-02-10 19:49:41,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:41,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:49:41,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510673487] [2020-02-10 19:49:41,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:49:41,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:41,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:49:41,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:41,520 INFO L87 Difference]: Start difference. First operand 1577 states and 7044 transitions. Second operand 11 states. [2020-02-10 19:49:41,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:41,708 INFO L93 Difference]: Finished difference Result 2933 states and 11669 transitions. [2020-02-10 19:49:41,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:49:41,708 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:49:41,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:41,715 INFO L225 Difference]: With dead ends: 2933 [2020-02-10 19:49:41,716 INFO L226 Difference]: Without dead ends: 2898 [2020-02-10 19:49:41,716 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:49:41,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2898 states. [2020-02-10 19:49:41,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2898 to 1559. [2020-02-10 19:49:41,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1559 states. [2020-02-10 19:49:41,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 7007 transitions. [2020-02-10 19:49:41,782 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 7007 transitions. Word has length 28 [2020-02-10 19:49:41,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:41,782 INFO L479 AbstractCegarLoop]: Abstraction has 1559 states and 7007 transitions. [2020-02-10 19:49:41,782 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:49:41,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 7007 transitions. [2020-02-10 19:49:41,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:49:41,785 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:41,785 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:41,785 INFO L427 AbstractCegarLoop]: === Iteration 417 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:41,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:41,785 INFO L82 PathProgramCache]: Analyzing trace with hash 847344676, now seen corresponding path program 409 times [2020-02-10 19:49:41,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:41,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748780345] [2020-02-10 19:49:41,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:41,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:42,338 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 31 [2020-02-10 19:49:42,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 19:49:42,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748780345] [2020-02-10 19:49:42,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:42,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:49:42,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268058457] [2020-02-10 19:49:42,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:49:42,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:42,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:49:42,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:42,346 INFO L87 Difference]: Start difference. First operand 1559 states and 7007 transitions. Second operand 11 states. [2020-02-10 19:49:42,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:42,522 INFO L93 Difference]: Finished difference Result 2896 states and 11596 transitions. [2020-02-10 19:49:42,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:49:42,523 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:49:42,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:42,529 INFO L225 Difference]: With dead ends: 2896 [2020-02-10 19:49:42,530 INFO L226 Difference]: Without dead ends: 2881 [2020-02-10 19:49:42,530 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:49:42,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2881 states. [2020-02-10 19:49:42,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2881 to 1572. [2020-02-10 19:49:42,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 19:49:42,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7050 transitions. [2020-02-10 19:49:42,597 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7050 transitions. Word has length 28 [2020-02-10 19:49:42,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:42,597 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7050 transitions. [2020-02-10 19:49:42,597 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:49:42,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7050 transitions. [2020-02-10 19:49:42,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:49:42,599 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:42,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] [2020-02-10 19:49:42,600 INFO L427 AbstractCegarLoop]: === Iteration 418 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:42,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:42,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1592047174, now seen corresponding path program 410 times [2020-02-10 19:49:42,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:42,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161645554] [2020-02-10 19:49:42,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:42,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:43,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 19:49:43,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161645554] [2020-02-10 19:49:43,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:43,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:49:43,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538601892] [2020-02-10 19:49:43,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:49:43,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:43,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:49:43,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:43,136 INFO L87 Difference]: Start difference. First operand 1572 states and 7050 transitions. Second operand 11 states. [2020-02-10 19:49:43,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:43,330 INFO L93 Difference]: Finished difference Result 2897 states and 11593 transitions. [2020-02-10 19:49:43,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:49:43,331 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:49:43,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:43,338 INFO L225 Difference]: With dead ends: 2897 [2020-02-10 19:49:43,338 INFO L226 Difference]: Without dead ends: 2876 [2020-02-10 19:49:43,339 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:49:43,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2876 states. [2020-02-10 19:49:43,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2876 to 1567. [2020-02-10 19:49:43,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 19:49:43,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7037 transitions. [2020-02-10 19:49:43,408 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7037 transitions. Word has length 28 [2020-02-10 19:49:43,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:43,409 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7037 transitions. [2020-02-10 19:49:43,409 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:49:43,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7037 transitions. [2020-02-10 19:49:43,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:49:43,411 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:43,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] [2020-02-10 19:49:43,411 INFO L427 AbstractCegarLoop]: === Iteration 419 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:43,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:43,411 INFO L82 PathProgramCache]: Analyzing trace with hash 312114874, now seen corresponding path program 411 times [2020-02-10 19:49:43,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:43,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150196139] [2020-02-10 19:49:43,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:43,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:43,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 19:49:43,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150196139] [2020-02-10 19:49:43,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:43,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:49:43,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920859821] [2020-02-10 19:49:43,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:49:43,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:43,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:49:43,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:43,944 INFO L87 Difference]: Start difference. First operand 1567 states and 7037 transitions. Second operand 11 states. [2020-02-10 19:49:44,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:44,152 INFO L93 Difference]: Finished difference Result 2893 states and 11585 transitions. [2020-02-10 19:49:44,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:49:44,152 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:49:44,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:44,159 INFO L225 Difference]: With dead ends: 2893 [2020-02-10 19:49:44,159 INFO L226 Difference]: Without dead ends: 2878 [2020-02-10 19:49:44,159 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:49:44,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2878 states. [2020-02-10 19:49:44,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2878 to 1571. [2020-02-10 19:49:44,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 19:49:44,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7044 transitions. [2020-02-10 19:49:44,226 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7044 transitions. Word has length 28 [2020-02-10 19:49:44,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:44,227 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7044 transitions. [2020-02-10 19:49:44,227 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:49:44,227 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7044 transitions. [2020-02-10 19:49:44,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:49:44,229 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:44,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] [2020-02-10 19:49:44,229 INFO L427 AbstractCegarLoop]: === Iteration 420 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:44,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:44,229 INFO L82 PathProgramCache]: Analyzing trace with hash 485362566, now seen corresponding path program 412 times [2020-02-10 19:49:44,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:44,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552317675] [2020-02-10 19:49:44,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:44,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:44,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:44,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552317675] [2020-02-10 19:49:44,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:44,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:49:44,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652517376] [2020-02-10 19:49:44,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:49:44,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:44,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:49:44,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:44,760 INFO L87 Difference]: Start difference. First operand 1571 states and 7044 transitions. Second operand 11 states. [2020-02-10 19:49:44,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:44,973 INFO L93 Difference]: Finished difference Result 2892 states and 11579 transitions. [2020-02-10 19:49:44,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:49:44,973 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:49:44,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:44,981 INFO L225 Difference]: With dead ends: 2892 [2020-02-10 19:49:44,981 INFO L226 Difference]: Without dead ends: 2874 [2020-02-10 19:49:44,981 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:49:45,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2874 states. [2020-02-10 19:49:45,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2874 to 1567. [2020-02-10 19:49:45,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 19:49:45,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7033 transitions. [2020-02-10 19:49:45,047 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7033 transitions. Word has length 28 [2020-02-10 19:49:45,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:45,048 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7033 transitions. [2020-02-10 19:49:45,048 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:49:45,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7033 transitions. [2020-02-10 19:49:45,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:49:45,050 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:45,050 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:45,050 INFO L427 AbstractCegarLoop]: === Iteration 421 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:45,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:45,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1627208966, now seen corresponding path program 413 times [2020-02-10 19:49:45,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:45,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186271721] [2020-02-10 19:49:45,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:45,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:45,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:45,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186271721] [2020-02-10 19:49:45,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:45,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:49:45,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474007036] [2020-02-10 19:49:45,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:49:45,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:45,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:49:45,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:45,567 INFO L87 Difference]: Start difference. First operand 1567 states and 7033 transitions. Second operand 11 states. [2020-02-10 19:49:45,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:45,741 INFO L93 Difference]: Finished difference Result 2895 states and 11585 transitions. [2020-02-10 19:49:45,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:49:45,742 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:49:45,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:45,749 INFO L225 Difference]: With dead ends: 2895 [2020-02-10 19:49:45,749 INFO L226 Difference]: Without dead ends: 2879 [2020-02-10 19:49:45,750 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:49:45,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2879 states. [2020-02-10 19:49:45,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2879 to 1571. [2020-02-10 19:49:45,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 19:49:45,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7040 transitions. [2020-02-10 19:49:45,818 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7040 transitions. Word has length 28 [2020-02-10 19:49:45,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:45,818 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7040 transitions. [2020-02-10 19:49:45,818 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:49:45,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7040 transitions. [2020-02-10 19:49:45,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:49:45,820 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:45,820 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:45,821 INFO L427 AbstractCegarLoop]: === Iteration 422 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:45,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:45,821 INFO L82 PathProgramCache]: Analyzing trace with hash 2096303524, now seen corresponding path program 414 times [2020-02-10 19:49:45,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:45,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021363837] [2020-02-10 19:49:45,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:45,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:46,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:46,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021363837] [2020-02-10 19:49:46,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:46,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:49:46,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306276188] [2020-02-10 19:49:46,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:49:46,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:46,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:49:46,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:46,354 INFO L87 Difference]: Start difference. First operand 1571 states and 7040 transitions. Second operand 11 states. [2020-02-10 19:49:46,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:46,527 INFO L93 Difference]: Finished difference Result 2893 states and 11577 transitions. [2020-02-10 19:49:46,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:49:46,527 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:49:46,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:46,534 INFO L225 Difference]: With dead ends: 2893 [2020-02-10 19:49:46,534 INFO L226 Difference]: Without dead ends: 2871 [2020-02-10 19:49:46,534 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:49:46,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2871 states. [2020-02-10 19:49:46,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2871 to 1563. [2020-02-10 19:49:46,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2020-02-10 19:49:46,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 7022 transitions. [2020-02-10 19:49:46,601 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 7022 transitions. Word has length 28 [2020-02-10 19:49:46,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:46,601 INFO L479 AbstractCegarLoop]: Abstraction has 1563 states and 7022 transitions. [2020-02-10 19:49:46,601 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:49:46,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 7022 transitions. [2020-02-10 19:49:46,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:49:46,604 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:46,604 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:46,604 INFO L427 AbstractCegarLoop]: === Iteration 423 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:46,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:46,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1941436264, now seen corresponding path program 415 times [2020-02-10 19:49:46,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:46,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336281736] [2020-02-10 19:49:46,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:46,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:47,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 19:49:47,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336281736] [2020-02-10 19:49:47,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:47,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:49:47,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238615423] [2020-02-10 19:49:47,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:49:47,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:47,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:49:47,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:47,129 INFO L87 Difference]: Start difference. First operand 1563 states and 7022 transitions. Second operand 11 states. [2020-02-10 19:49:47,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:47,302 INFO L93 Difference]: Finished difference Result 2903 states and 11611 transitions. [2020-02-10 19:49:47,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:49:47,303 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:49:47,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:47,310 INFO L225 Difference]: With dead ends: 2903 [2020-02-10 19:49:47,310 INFO L226 Difference]: Without dead ends: 2888 [2020-02-10 19:49:47,311 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:49:47,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2888 states. [2020-02-10 19:49:47,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2888 to 1573. [2020-02-10 19:49:47,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 19:49:47,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7050 transitions. [2020-02-10 19:49:47,379 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7050 transitions. Word has length 28 [2020-02-10 19:49:47,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:47,380 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7050 transitions. [2020-02-10 19:49:47,380 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:49:47,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7050 transitions. [2020-02-10 19:49:47,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:49:47,382 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:47,382 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:47,382 INFO L427 AbstractCegarLoop]: === Iteration 424 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:47,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:47,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1608828534, now seen corresponding path program 416 times [2020-02-10 19:49:47,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:47,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264978522] [2020-02-10 19:49:47,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:47,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:47,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:47,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264978522] [2020-02-10 19:49:47,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:47,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:49:47,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999645159] [2020-02-10 19:49:47,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:49:47,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:47,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:49:47,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:47,934 INFO L87 Difference]: Start difference. First operand 1573 states and 7050 transitions. Second operand 11 states. [2020-02-10 19:49:48,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:48,110 INFO L93 Difference]: Finished difference Result 2904 states and 11608 transitions. [2020-02-10 19:49:48,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:49:48,111 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:49:48,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:48,118 INFO L225 Difference]: With dead ends: 2904 [2020-02-10 19:49:48,118 INFO L226 Difference]: Without dead ends: 2883 [2020-02-10 19:49:48,119 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:49:48,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2883 states. [2020-02-10 19:49:48,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2883 to 1568. [2020-02-10 19:49:48,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 19:49:48,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7036 transitions. [2020-02-10 19:49:48,187 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7036 transitions. Word has length 28 [2020-02-10 19:49:48,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:48,188 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7036 transitions. [2020-02-10 19:49:48,188 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:49:48,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7036 transitions. [2020-02-10 19:49:48,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:49:48,190 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:48,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] [2020-02-10 19:49:48,190 INFO L427 AbstractCegarLoop]: === Iteration 425 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:48,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:48,190 INFO L82 PathProgramCache]: Analyzing trace with hash 333121082, now seen corresponding path program 417 times [2020-02-10 19:49:48,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:48,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562820323] [2020-02-10 19:49:48,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:48,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:48,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 19:49:48,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562820323] [2020-02-10 19:49:48,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:48,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:49:48,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080028494] [2020-02-10 19:49:48,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:49:48,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:48,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:49:48,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:48,709 INFO L87 Difference]: Start difference. First operand 1568 states and 7036 transitions. Second operand 11 states. [2020-02-10 19:49:48,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:48,888 INFO L93 Difference]: Finished difference Result 2904 states and 11608 transitions. [2020-02-10 19:49:48,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:49:48,889 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:49:48,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:48,896 INFO L225 Difference]: With dead ends: 2904 [2020-02-10 19:49:48,896 INFO L226 Difference]: Without dead ends: 2889 [2020-02-10 19:49:48,896 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:49:48,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2889 states. [2020-02-10 19:49:48,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2889 to 1573. [2020-02-10 19:49:48,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 19:49:48,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7045 transitions. [2020-02-10 19:49:48,963 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7045 transitions. Word has length 28 [2020-02-10 19:49:48,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:48,963 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7045 transitions. [2020-02-10 19:49:48,963 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:49:48,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7045 transitions. [2020-02-10 19:49:48,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:49:48,965 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:48,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] [2020-02-10 19:49:48,966 INFO L427 AbstractCegarLoop]: === Iteration 426 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:48,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:48,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1995773770, now seen corresponding path program 418 times [2020-02-10 19:49:48,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:48,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672574901] [2020-02-10 19:49:48,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:48,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:49,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:49,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672574901] [2020-02-10 19:49:49,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:49,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:49:49,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622222361] [2020-02-10 19:49:49,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:49:49,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:49,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:49:49,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:49,498 INFO L87 Difference]: Start difference. First operand 1573 states and 7045 transitions. Second operand 11 states. [2020-02-10 19:49:49,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:49,678 INFO L93 Difference]: Finished difference Result 2906 states and 11607 transitions. [2020-02-10 19:49:49,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:49:49,679 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:49:49,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:49,686 INFO L225 Difference]: With dead ends: 2906 [2020-02-10 19:49:49,686 INFO L226 Difference]: Without dead ends: 2884 [2020-02-10 19:49:49,686 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:49:49,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2884 states. [2020-02-10 19:49:49,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2884 to 1568. [2020-02-10 19:49:49,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 19:49:49,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7031 transitions. [2020-02-10 19:49:49,755 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7031 transitions. Word has length 28 [2020-02-10 19:49:49,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:49,755 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7031 transitions. [2020-02-10 19:49:49,755 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:49:49,755 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7031 transitions. [2020-02-10 19:49:49,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:49:49,757 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:49,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] [2020-02-10 19:49:49,757 INFO L427 AbstractCegarLoop]: === Iteration 427 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:49,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:49,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1606202758, now seen corresponding path program 419 times [2020-02-10 19:49:49,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:49,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372442633] [2020-02-10 19:49:49,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:49,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:50,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:50,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372442633] [2020-02-10 19:49:50,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:50,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:49:50,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431119628] [2020-02-10 19:49:50,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:49:50,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:50,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:49:50,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:50,282 INFO L87 Difference]: Start difference. First operand 1568 states and 7031 transitions. Second operand 11 states. [2020-02-10 19:49:50,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:50,508 INFO L93 Difference]: Finished difference Result 2907 states and 11610 transitions. [2020-02-10 19:49:50,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:49:50,508 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:49:50,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:50,515 INFO L225 Difference]: With dead ends: 2907 [2020-02-10 19:49:50,515 INFO L226 Difference]: Without dead ends: 2891 [2020-02-10 19:49:50,515 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:49:50,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2891 states. [2020-02-10 19:49:50,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2891 to 1574. [2020-02-10 19:49:50,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 19:49:50,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7042 transitions. [2020-02-10 19:49:50,584 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7042 transitions. Word has length 28 [2020-02-10 19:49:50,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:50,584 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7042 transitions. [2020-02-10 19:49:50,584 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:49:50,585 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7042 transitions. [2020-02-10 19:49:50,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:49:50,587 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:50,587 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:50,587 INFO L427 AbstractCegarLoop]: === Iteration 428 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:50,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:50,587 INFO L82 PathProgramCache]: Analyzing trace with hash -688252568, now seen corresponding path program 420 times [2020-02-10 19:49:50,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:50,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521338783] [2020-02-10 19:49:50,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:50,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:51,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:51,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521338783] [2020-02-10 19:49:51,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:51,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:49:51,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87053906] [2020-02-10 19:49:51,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:49:51,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:51,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:49:51,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:51,126 INFO L87 Difference]: Start difference. First operand 1574 states and 7042 transitions. Second operand 11 states. [2020-02-10 19:49:51,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:51,304 INFO L93 Difference]: Finished difference Result 2908 states and 11606 transitions. [2020-02-10 19:49:51,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:49:51,305 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:49:51,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:51,312 INFO L225 Difference]: With dead ends: 2908 [2020-02-10 19:49:51,312 INFO L226 Difference]: Without dead ends: 2880 [2020-02-10 19:49:51,313 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:49:51,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2880 states. [2020-02-10 19:49:51,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2880 to 1563. [2020-02-10 19:49:51,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2020-02-10 19:49:51,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 7018 transitions. [2020-02-10 19:49:51,380 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 7018 transitions. Word has length 28 [2020-02-10 19:49:51,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:51,380 INFO L479 AbstractCegarLoop]: Abstraction has 1563 states and 7018 transitions. [2020-02-10 19:49:51,380 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:49:51,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 7018 transitions. [2020-02-10 19:49:51,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:49:51,382 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:51,382 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:51,382 INFO L427 AbstractCegarLoop]: === Iteration 429 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:51,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:51,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1993951784, now seen corresponding path program 421 times [2020-02-10 19:49:51,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:51,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381540087] [2020-02-10 19:49:51,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:51,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:51,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:51,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381540087] [2020-02-10 19:49:51,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:51,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:49:51,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120656296] [2020-02-10 19:49:51,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:49:51,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:51,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:49:51,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:51,917 INFO L87 Difference]: Start difference. First operand 1563 states and 7018 transitions. Second operand 11 states. [2020-02-10 19:49:52,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:52,129 INFO L93 Difference]: Finished difference Result 2894 states and 11583 transitions. [2020-02-10 19:49:52,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:49:52,130 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:49:52,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:52,137 INFO L225 Difference]: With dead ends: 2894 [2020-02-10 19:49:52,137 INFO L226 Difference]: Without dead ends: 2879 [2020-02-10 19:49:52,138 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:49:52,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2879 states. [2020-02-10 19:49:52,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2879 to 1571. [2020-02-10 19:49:52,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 19:49:52,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7040 transitions. [2020-02-10 19:49:52,204 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7040 transitions. Word has length 28 [2020-02-10 19:49:52,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:52,205 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7040 transitions. [2020-02-10 19:49:52,205 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:49:52,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7040 transitions. [2020-02-10 19:49:52,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:49:52,207 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:52,207 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:52,207 INFO L427 AbstractCegarLoop]: === Iteration 430 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:52,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:52,207 INFO L82 PathProgramCache]: Analyzing trace with hash -2127767820, now seen corresponding path program 422 times [2020-02-10 19:49:52,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:52,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188825778] [2020-02-10 19:49:52,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:52,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:52,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 19:49:52,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188825778] [2020-02-10 19:49:52,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:52,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:49:52,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327786749] [2020-02-10 19:49:52,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:49:52,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:52,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:49:52,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:52,734 INFO L87 Difference]: Start difference. First operand 1571 states and 7040 transitions. Second operand 11 states. [2020-02-10 19:49:52,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:52,927 INFO L93 Difference]: Finished difference Result 2893 states and 11577 transitions. [2020-02-10 19:49:52,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:49:52,928 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:49:52,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:52,935 INFO L225 Difference]: With dead ends: 2893 [2020-02-10 19:49:52,935 INFO L226 Difference]: Without dead ends: 2875 [2020-02-10 19:49:52,935 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:49:52,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2875 states. [2020-02-10 19:49:52,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2875 to 1567. [2020-02-10 19:49:52,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 19:49:53,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7029 transitions. [2020-02-10 19:49:53,002 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7029 transitions. Word has length 28 [2020-02-10 19:49:53,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:53,003 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7029 transitions. [2020-02-10 19:49:53,003 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:49:53,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7029 transitions. [2020-02-10 19:49:53,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:49:53,005 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:53,005 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:53,005 INFO L427 AbstractCegarLoop]: === Iteration 431 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:53,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:53,005 INFO L82 PathProgramCache]: Analyzing trace with hash 920866404, now seen corresponding path program 423 times [2020-02-10 19:49:53,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:53,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493832312] [2020-02-10 19:49:53,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:53,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:53,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:53,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493832312] [2020-02-10 19:49:53,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:53,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:49:53,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167275983] [2020-02-10 19:49:53,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:49:53,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:53,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:49:53,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:53,546 INFO L87 Difference]: Start difference. First operand 1567 states and 7029 transitions. Second operand 11 states. [2020-02-10 19:49:53,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:53,736 INFO L93 Difference]: Finished difference Result 2898 states and 11588 transitions. [2020-02-10 19:49:53,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:49:53,736 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:49:53,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:53,743 INFO L225 Difference]: With dead ends: 2898 [2020-02-10 19:49:53,743 INFO L226 Difference]: Without dead ends: 2883 [2020-02-10 19:49:53,743 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:49:53,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2883 states. [2020-02-10 19:49:53,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2883 to 1572. [2020-02-10 19:49:53,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 19:49:53,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7038 transitions. [2020-02-10 19:49:53,810 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7038 transitions. Word has length 28 [2020-02-10 19:49:53,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:53,810 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7038 transitions. [2020-02-10 19:49:53,810 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:49:53,810 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7038 transitions. [2020-02-10 19:49:53,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:49:53,813 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:53,813 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:53,813 INFO L427 AbstractCegarLoop]: === Iteration 432 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:53,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:53,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1711448204, now seen corresponding path program 424 times [2020-02-10 19:49:53,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:53,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879126662] [2020-02-10 19:49:53,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:53,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:54,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:54,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879126662] [2020-02-10 19:49:54,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:54,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:49:54,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337442387] [2020-02-10 19:49:54,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:49:54,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:54,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:49:54,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:54,338 INFO L87 Difference]: Start difference. First operand 1572 states and 7038 transitions. Second operand 11 states. [2020-02-10 19:49:54,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:54,553 INFO L93 Difference]: Finished difference Result 2900 states and 11587 transitions. [2020-02-10 19:49:54,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:49:54,553 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:49:54,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:54,560 INFO L225 Difference]: With dead ends: 2900 [2020-02-10 19:49:54,561 INFO L226 Difference]: Without dead ends: 2878 [2020-02-10 19:49:54,561 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:49:54,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2878 states. [2020-02-10 19:49:54,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2878 to 1567. [2020-02-10 19:49:54,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 19:49:54,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7025 transitions. [2020-02-10 19:49:54,628 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7025 transitions. Word has length 28 [2020-02-10 19:49:54,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:54,628 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7025 transitions. [2020-02-10 19:49:54,628 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:49:54,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7025 transitions. [2020-02-10 19:49:54,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:49:54,630 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49: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] [2020-02-10 19:49:54,630 INFO L427 AbstractCegarLoop]: === Iteration 433 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:54,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:54,631 INFO L82 PathProgramCache]: Analyzing trace with hash -2125142044, now seen corresponding path program 425 times [2020-02-10 19:49:54,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:54,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177258785] [2020-02-10 19:49:54,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:54,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:55,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:55,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177258785] [2020-02-10 19:49:55,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:55,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:49:55,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795984925] [2020-02-10 19:49:55,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:49:55,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:55,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:49:55,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:55,159 INFO L87 Difference]: Start difference. First operand 1567 states and 7025 transitions. Second operand 11 states. [2020-02-10 19:49:55,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:55,392 INFO L93 Difference]: Finished difference Result 2895 states and 11577 transitions. [2020-02-10 19:49:55,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:49:55,392 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:49:55,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:55,400 INFO L225 Difference]: With dead ends: 2895 [2020-02-10 19:49:55,400 INFO L226 Difference]: Without dead ends: 2881 [2020-02-10 19:49:55,400 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:49:55,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2881 states. [2020-02-10 19:49:55,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2881 to 1571. [2020-02-10 19:49:55,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 19:49:55,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7032 transitions. [2020-02-10 19:49:55,467 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7032 transitions. Word has length 28 [2020-02-10 19:49:55,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:55,467 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7032 transitions. [2020-02-10 19:49:55,467 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:49:55,467 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7032 transitions. [2020-02-10 19:49:55,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:49:55,469 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:55,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] [2020-02-10 19:49:55,469 INFO L427 AbstractCegarLoop]: === Iteration 434 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:55,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:55,470 INFO L82 PathProgramCache]: Analyzing trace with hash -635737048, now seen corresponding path program 426 times [2020-02-10 19:49:55,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:55,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876811493] [2020-02-10 19:49:55,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:55,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:55,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 19:49:55,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876811493] [2020-02-10 19:49:55,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:55,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:49:55,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724125886] [2020-02-10 19:49:55,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:49:55,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:55,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:49:55,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:55,996 INFO L87 Difference]: Start difference. First operand 1571 states and 7032 transitions. Second operand 11 states. [2020-02-10 19:49:56,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:56,201 INFO L93 Difference]: Finished difference Result 2898 states and 11579 transitions. [2020-02-10 19:49:56,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:49:56,201 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:49:56,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:56,208 INFO L225 Difference]: With dead ends: 2898 [2020-02-10 19:49:56,208 INFO L226 Difference]: Without dead ends: 2873 [2020-02-10 19:49:56,208 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:49:56,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2873 states. [2020-02-10 19:49:56,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2873 to 1563. [2020-02-10 19:49:56,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2020-02-10 19:49:56,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 7014 transitions. [2020-02-10 19:49:56,275 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 7014 transitions. Word has length 28 [2020-02-10 19:49:56,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:56,276 INFO L479 AbstractCegarLoop]: Abstraction has 1563 states and 7014 transitions. [2020-02-10 19:49:56,276 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:49:56,276 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 7014 transitions. [2020-02-10 19:49:56,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:49:56,278 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:56,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] [2020-02-10 19:49:56,278 INFO L427 AbstractCegarLoop]: === Iteration 435 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:56,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:56,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1545809910, now seen corresponding path program 427 times [2020-02-10 19:49:56,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:56,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079516971] [2020-02-10 19:49:56,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:56,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:56,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 19:49:56,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079516971] [2020-02-10 19:49:56,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:56,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:49:56,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355826904] [2020-02-10 19:49:56,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:49:56,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:56,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:49:56,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:56,801 INFO L87 Difference]: Start difference. First operand 1563 states and 7014 transitions. Second operand 11 states. [2020-02-10 19:49:57,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:57,000 INFO L93 Difference]: Finished difference Result 2898 states and 11588 transitions. [2020-02-10 19:49:57,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:49:57,000 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:49:57,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:57,008 INFO L225 Difference]: With dead ends: 2898 [2020-02-10 19:49:57,008 INFO L226 Difference]: Without dead ends: 2882 [2020-02-10 19:49:57,008 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:49:57,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2882 states. [2020-02-10 19:49:57,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2882 to 1571. [2020-02-10 19:49:57,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 19:49:57,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7036 transitions. [2020-02-10 19:49:57,075 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7036 transitions. Word has length 28 [2020-02-10 19:49:57,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:57,075 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7036 transitions. [2020-02-10 19:49:57,075 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:49:57,076 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7036 transitions. [2020-02-10 19:49:57,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:49:57,078 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:57,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] [2020-02-10 19:49:57,078 INFO L427 AbstractCegarLoop]: === Iteration 436 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:57,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:57,078 INFO L82 PathProgramCache]: Analyzing trace with hash -2117264716, now seen corresponding path program 428 times [2020-02-10 19:49:57,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:57,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612882364] [2020-02-10 19:49:57,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:57,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:57,588 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 19:49:57,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:49:57,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612882364] [2020-02-10 19:49:57,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:57,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:49:57,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619847355] [2020-02-10 19:49:57,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:49:57,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:57,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:49:57,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:57,595 INFO L87 Difference]: Start difference. First operand 1571 states and 7036 transitions. Second operand 11 states. [2020-02-10 19:49:57,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:57,815 INFO L93 Difference]: Finished difference Result 2896 states and 11580 transitions. [2020-02-10 19:49:57,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:49:57,815 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:49:57,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:57,823 INFO L225 Difference]: With dead ends: 2896 [2020-02-10 19:49:57,823 INFO L226 Difference]: Without dead ends: 2878 [2020-02-10 19:49:57,823 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:49:57,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2878 states. [2020-02-10 19:49:57,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2878 to 1567. [2020-02-10 19:49:57,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 19:49:57,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7025 transitions. [2020-02-10 19:49:57,890 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7025 transitions. Word has length 28 [2020-02-10 19:49:57,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:57,890 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7025 transitions. [2020-02-10 19:49:57,890 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:49:57,890 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7025 transitions. [2020-02-10 19:49:57,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:49:57,892 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:57,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] [2020-02-10 19:49:57,893 INFO L427 AbstractCegarLoop]: === Iteration 437 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:57,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:57,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1676072006, now seen corresponding path program 429 times [2020-02-10 19:49:57,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:57,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165831382] [2020-02-10 19:49:57,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:57,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:58,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 19:49:58,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165831382] [2020-02-10 19:49:58,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:58,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:49:58,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313595835] [2020-02-10 19:49:58,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:49:58,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:58,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:49:58,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:58,422 INFO L87 Difference]: Start difference. First operand 1567 states and 7025 transitions. Second operand 11 states. [2020-02-10 19:49:58,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:58,613 INFO L93 Difference]: Finished difference Result 2903 states and 11596 transitions. [2020-02-10 19:49:58,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:49:58,613 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:49:58,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:58,620 INFO L225 Difference]: With dead ends: 2903 [2020-02-10 19:49:58,620 INFO L226 Difference]: Without dead ends: 2887 [2020-02-10 19:49:58,620 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:49:58,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2887 states. [2020-02-10 19:49:58,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2887 to 1573. [2020-02-10 19:49:58,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 19:49:58,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7036 transitions. [2020-02-10 19:49:58,716 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7036 transitions. Word has length 28 [2020-02-10 19:49:58,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:58,716 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7036 transitions. [2020-02-10 19:49:58,716 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:49:58,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7036 transitions. [2020-02-10 19:49:58,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:49:58,719 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:58,719 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:58,719 INFO L427 AbstractCegarLoop]: === Iteration 438 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:58,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:58,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1700945100, now seen corresponding path program 430 times [2020-02-10 19:49:58,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:58,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119319480] [2020-02-10 19:49:58,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:58,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:49:59,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 19:49:59,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119319480] [2020-02-10 19:49:59,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:49:59,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:49:59,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619386624] [2020-02-10 19:49:59,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:49:59,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:49:59,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:49:59,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:49:59,261 INFO L87 Difference]: Start difference. First operand 1573 states and 7036 transitions. Second operand 11 states. [2020-02-10 19:49:59,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:49:59,447 INFO L93 Difference]: Finished difference Result 2904 states and 11592 transitions. [2020-02-10 19:49:59,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:49:59,448 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:49:59,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:49:59,455 INFO L225 Difference]: With dead ends: 2904 [2020-02-10 19:49:59,455 INFO L226 Difference]: Without dead ends: 2881 [2020-02-10 19:49:59,455 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:49:59,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2881 states. [2020-02-10 19:49:59,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2881 to 1567. [2020-02-10 19:49:59,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 19:49:59,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7021 transitions. [2020-02-10 19:49:59,521 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7021 transitions. Word has length 28 [2020-02-10 19:49:59,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:49:59,522 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7021 transitions. [2020-02-10 19:49:59,522 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:49:59,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7021 transitions. [2020-02-10 19:49:59,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:49:59,524 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:49:59,524 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:49:59,524 INFO L427 AbstractCegarLoop]: === Iteration 439 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:49:59,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:49:59,524 INFO L82 PathProgramCache]: Analyzing trace with hash 569387398, now seen corresponding path program 431 times [2020-02-10 19:49:59,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:49:59,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118896980] [2020-02-10 19:49:59,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:49:59,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:00,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:00,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118896980] [2020-02-10 19:50:00,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:00,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:50:00,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130438926] [2020-02-10 19:50:00,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:50:00,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:00,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:50:00,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:00,050 INFO L87 Difference]: Start difference. First operand 1567 states and 7021 transitions. Second operand 11 states. [2020-02-10 19:50:00,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:00,236 INFO L93 Difference]: Finished difference Result 2897 states and 11578 transitions. [2020-02-10 19:50:00,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:50:00,236 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:50:00,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:00,243 INFO L225 Difference]: With dead ends: 2897 [2020-02-10 19:50:00,243 INFO L226 Difference]: Without dead ends: 2883 [2020-02-10 19:50:00,243 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:50:00,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2883 states. [2020-02-10 19:50:00,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2883 to 1571. [2020-02-10 19:50:00,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 19:50:00,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7028 transitions. [2020-02-10 19:50:00,310 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7028 transitions. Word has length 28 [2020-02-10 19:50:00,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:00,310 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7028 transitions. [2020-02-10 19:50:00,310 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:50:00,310 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7028 transitions. [2020-02-10 19:50:00,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:50:00,312 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:00,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] [2020-02-10 19:50:00,312 INFO L427 AbstractCegarLoop]: === Iteration 440 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:00,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:00,313 INFO L82 PathProgramCache]: Analyzing trace with hash 2058792394, now seen corresponding path program 432 times [2020-02-10 19:50:00,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:00,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376128804] [2020-02-10 19:50:00,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:00,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:00,836 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 19:50:00,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:00,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376128804] [2020-02-10 19:50:00,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:00,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:50:00,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187540088] [2020-02-10 19:50:00,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:50:00,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:00,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:50:00,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:00,843 INFO L87 Difference]: Start difference. First operand 1571 states and 7028 transitions. Second operand 11 states. [2020-02-10 19:50:01,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:01,064 INFO L93 Difference]: Finished difference Result 2900 states and 11580 transitions. [2020-02-10 19:50:01,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:50:01,064 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:50:01,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:01,071 INFO L225 Difference]: With dead ends: 2900 [2020-02-10 19:50:01,072 INFO L226 Difference]: Without dead ends: 2871 [2020-02-10 19:50:01,072 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:50:01,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2871 states. [2020-02-10 19:50:01,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2871 to 1559. [2020-02-10 19:50:01,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1559 states. [2020-02-10 19:50:01,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 7003 transitions. [2020-02-10 19:50:01,139 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 7003 transitions. Word has length 28 [2020-02-10 19:50:01,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:01,139 INFO L479 AbstractCegarLoop]: Abstraction has 1559 states and 7003 transitions. [2020-02-10 19:50:01,139 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:50:01,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 7003 transitions. [2020-02-10 19:50:01,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:50:01,141 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:01,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] [2020-02-10 19:50:01,141 INFO L427 AbstractCegarLoop]: === Iteration 441 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:01,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:01,142 INFO L82 PathProgramCache]: Analyzing trace with hash 425451744, now seen corresponding path program 433 times [2020-02-10 19:50:01,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:01,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251215056] [2020-02-10 19:50:01,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:01,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:01,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 19:50:01,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251215056] [2020-02-10 19:50:01,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:01,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:50:01,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345185174] [2020-02-10 19:50:01,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:50:01,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:01,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:50:01,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:01,656 INFO L87 Difference]: Start difference. First operand 1559 states and 7003 transitions. Second operand 11 states. [2020-02-10 19:50:01,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:01,833 INFO L93 Difference]: Finished difference Result 2903 states and 11607 transitions. [2020-02-10 19:50:01,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:50:01,834 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:50:01,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:01,841 INFO L225 Difference]: With dead ends: 2903 [2020-02-10 19:50:01,841 INFO L226 Difference]: Without dead ends: 2888 [2020-02-10 19:50:01,841 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:50:01,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2888 states. [2020-02-10 19:50:01,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2888 to 1572. [2020-02-10 19:50:01,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 19:50:01,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7046 transitions. [2020-02-10 19:50:01,908 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7046 transitions. Word has length 28 [2020-02-10 19:50:01,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:01,908 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7046 transitions. [2020-02-10 19:50:01,909 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:50:01,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7046 transitions. [2020-02-10 19:50:01,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:50:01,911 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:01,911 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:01,911 INFO L427 AbstractCegarLoop]: === Iteration 442 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:01,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:01,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1635408058, now seen corresponding path program 434 times [2020-02-10 19:50:01,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:01,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485501406] [2020-02-10 19:50:01,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:01,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:02,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:02,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485501406] [2020-02-10 19:50:02,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:02,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:50:02,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360799889] [2020-02-10 19:50:02,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:50:02,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:02,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:50:02,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:02,466 INFO L87 Difference]: Start difference. First operand 1572 states and 7046 transitions. Second operand 11 states. [2020-02-10 19:50:02,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:02,639 INFO L93 Difference]: Finished difference Result 2906 states and 11608 transitions. [2020-02-10 19:50:02,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:50:02,640 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:50:02,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:02,647 INFO L225 Difference]: With dead ends: 2906 [2020-02-10 19:50:02,647 INFO L226 Difference]: Without dead ends: 2883 [2020-02-10 19:50:02,648 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:50:02,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2883 states. [2020-02-10 19:50:02,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2883 to 1567. [2020-02-10 19:50:02,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 19:50:02,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7033 transitions. [2020-02-10 19:50:02,714 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7033 transitions. Word has length 28 [2020-02-10 19:50:02,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:02,714 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7033 transitions. [2020-02-10 19:50:02,714 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:50:02,714 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7033 transitions. [2020-02-10 19:50:02,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:50:02,717 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:02,717 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:02,717 INFO L427 AbstractCegarLoop]: === Iteration 443 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:02,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:02,717 INFO L82 PathProgramCache]: Analyzing trace with hash 963307322, now seen corresponding path program 435 times [2020-02-10 19:50:02,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:02,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778312218] [2020-02-10 19:50:02,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:02,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:03,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 19:50:03,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778312218] [2020-02-10 19:50:03,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:03,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:50:03,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621641037] [2020-02-10 19:50:03,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:50:03,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:03,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:50:03,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:03,244 INFO L87 Difference]: Start difference. First operand 1567 states and 7033 transitions. Second operand 11 states. [2020-02-10 19:50:03,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:03,447 INFO L93 Difference]: Finished difference Result 2898 states and 11592 transitions. [2020-02-10 19:50:03,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:50:03,447 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:50:03,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:03,455 INFO L225 Difference]: With dead ends: 2898 [2020-02-10 19:50:03,455 INFO L226 Difference]: Without dead ends: 2883 [2020-02-10 19:50:03,455 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:50:03,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2883 states. [2020-02-10 19:50:03,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2883 to 1571. [2020-02-10 19:50:03,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 19:50:03,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7040 transitions. [2020-02-10 19:50:03,522 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7040 transitions. Word has length 28 [2020-02-10 19:50:03,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:03,522 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7040 transitions. [2020-02-10 19:50:03,523 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:50:03,523 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7040 transitions. [2020-02-10 19:50:03,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:50:03,525 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:03,525 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:03,525 INFO L427 AbstractCegarLoop]: === Iteration 444 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:03,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:03,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1136555014, now seen corresponding path program 436 times [2020-02-10 19:50:03,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:03,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146004803] [2020-02-10 19:50:03,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:03,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:04,056 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 19:50:04,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:04,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146004803] [2020-02-10 19:50:04,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:04,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:50:04,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690399071] [2020-02-10 19:50:04,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:50:04,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:04,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:50:04,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:04,063 INFO L87 Difference]: Start difference. First operand 1571 states and 7040 transitions. Second operand 11 states. [2020-02-10 19:50:04,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:04,265 INFO L93 Difference]: Finished difference Result 2897 states and 11586 transitions. [2020-02-10 19:50:04,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:50:04,266 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:50:04,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:04,273 INFO L225 Difference]: With dead ends: 2897 [2020-02-10 19:50:04,273 INFO L226 Difference]: Without dead ends: 2879 [2020-02-10 19:50:04,273 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:50:04,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2879 states. [2020-02-10 19:50:04,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2879 to 1567. [2020-02-10 19:50:04,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 19:50:04,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7029 transitions. [2020-02-10 19:50:04,360 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7029 transitions. Word has length 28 [2020-02-10 19:50:04,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:04,360 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7029 transitions. [2020-02-10 19:50:04,360 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:50:04,360 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7029 transitions. [2020-02-10 19:50:04,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:50:04,362 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:04,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] [2020-02-10 19:50:04,362 INFO L427 AbstractCegarLoop]: === Iteration 445 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:04,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:04,363 INFO L82 PathProgramCache]: Analyzing trace with hash -559696902, now seen corresponding path program 437 times [2020-02-10 19:50:04,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:04,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107421375] [2020-02-10 19:50:04,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:04,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:04,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:04,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107421375] [2020-02-10 19:50:04,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:04,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:50:04,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241629550] [2020-02-10 19:50:04,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:50:04,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:04,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:50:04,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:04,871 INFO L87 Difference]: Start difference. First operand 1567 states and 7029 transitions. Second operand 11 states. [2020-02-10 19:50:05,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:05,062 INFO L93 Difference]: Finished difference Result 2904 states and 11600 transitions. [2020-02-10 19:50:05,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:50:05,063 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:50:05,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:05,070 INFO L225 Difference]: With dead ends: 2904 [2020-02-10 19:50:05,070 INFO L226 Difference]: Without dead ends: 2886 [2020-02-10 19:50:05,070 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:50:05,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2886 states. [2020-02-10 19:50:05,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2886 to 1571. [2020-02-10 19:50:05,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 19:50:05,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7036 transitions. [2020-02-10 19:50:05,137 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7036 transitions. Word has length 28 [2020-02-10 19:50:05,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:05,137 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7036 transitions. [2020-02-10 19:50:05,137 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:50:05,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7036 transitions. [2020-02-10 19:50:05,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:50:05,140 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:05,140 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:05,140 INFO L427 AbstractCegarLoop]: === Iteration 446 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:05,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:05,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1674410592, now seen corresponding path program 438 times [2020-02-10 19:50:05,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:05,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511483971] [2020-02-10 19:50:05,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:05,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:05,643 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 19:50:05,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:05,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511483971] [2020-02-10 19:50:05,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:05,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:50:05,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635508998] [2020-02-10 19:50:05,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:50:05,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:05,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:50:05,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:05,651 INFO L87 Difference]: Start difference. First operand 1571 states and 7036 transitions. Second operand 11 states. [2020-02-10 19:50:05,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:05,833 INFO L93 Difference]: Finished difference Result 2900 states and 11588 transitions. [2020-02-10 19:50:05,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:50:05,834 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:50:05,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:05,842 INFO L225 Difference]: With dead ends: 2900 [2020-02-10 19:50:05,842 INFO L226 Difference]: Without dead ends: 2878 [2020-02-10 19:50:05,842 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:50:05,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2878 states. [2020-02-10 19:50:05,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2878 to 1563. [2020-02-10 19:50:05,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2020-02-10 19:50:05,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 7018 transitions. [2020-02-10 19:50:05,910 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 7018 transitions. Word has length 28 [2020-02-10 19:50:05,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:05,910 INFO L479 AbstractCegarLoop]: Abstraction has 1563 states and 7018 transitions. [2020-02-10 19:50:05,910 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:50:05,910 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 7018 transitions. [2020-02-10 19:50:05,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:50:05,912 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:05,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] [2020-02-10 19:50:05,912 INFO L427 AbstractCegarLoop]: === Iteration 447 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:05,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:05,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1519543332, now seen corresponding path program 439 times [2020-02-10 19:50:05,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:05,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504471113] [2020-02-10 19:50:05,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:05,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:06,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:06,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504471113] [2020-02-10 19:50:06,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:06,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:50:06,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914460742] [2020-02-10 19:50:06,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:50:06,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:06,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:50:06,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:06,429 INFO L87 Difference]: Start difference. First operand 1563 states and 7018 transitions. Second operand 11 states. [2020-02-10 19:50:06,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:06,610 INFO L93 Difference]: Finished difference Result 2911 states and 11625 transitions. [2020-02-10 19:50:06,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:50:06,610 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:50:06,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:06,617 INFO L225 Difference]: With dead ends: 2911 [2020-02-10 19:50:06,618 INFO L226 Difference]: Without dead ends: 2896 [2020-02-10 19:50:06,618 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:50:06,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2896 states. [2020-02-10 19:50:06,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2896 to 1573. [2020-02-10 19:50:06,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 19:50:06,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7046 transitions. [2020-02-10 19:50:06,685 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7046 transitions. Word has length 28 [2020-02-10 19:50:06,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:06,685 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7046 transitions. [2020-02-10 19:50:06,685 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:50:06,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7046 transitions. [2020-02-10 19:50:06,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:50:06,687 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:06,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] [2020-02-10 19:50:06,687 INFO L427 AbstractCegarLoop]: === Iteration 448 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:06,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:06,688 INFO L82 PathProgramCache]: Analyzing trace with hash -541316470, now seen corresponding path program 440 times [2020-02-10 19:50:06,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:06,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409141677] [2020-02-10 19:50:06,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:06,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:07,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:07,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409141677] [2020-02-10 19:50:07,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:07,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:50:07,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626291656] [2020-02-10 19:50:07,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:50:07,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:07,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:50:07,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:07,209 INFO L87 Difference]: Start difference. First operand 1573 states and 7046 transitions. Second operand 11 states. [2020-02-10 19:50:07,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:07,382 INFO L93 Difference]: Finished difference Result 2914 states and 11626 transitions. [2020-02-10 19:50:07,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:50:07,383 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:50:07,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:07,391 INFO L225 Difference]: With dead ends: 2914 [2020-02-10 19:50:07,391 INFO L226 Difference]: Without dead ends: 2891 [2020-02-10 19:50:07,392 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:50:07,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2891 states. [2020-02-10 19:50:07,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2891 to 1568. [2020-02-10 19:50:07,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 19:50:07,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7032 transitions. [2020-02-10 19:50:07,466 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7032 transitions. Word has length 28 [2020-02-10 19:50:07,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:07,466 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7032 transitions. [2020-02-10 19:50:07,466 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:50:07,466 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7032 transitions. [2020-02-10 19:50:07,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:50:07,469 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:07,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] [2020-02-10 19:50:07,469 INFO L427 AbstractCegarLoop]: === Iteration 449 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:07,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:07,469 INFO L82 PathProgramCache]: Analyzing trace with hash 984313530, now seen corresponding path program 441 times [2020-02-10 19:50:07,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:07,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208166111] [2020-02-10 19:50:07,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:07,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:07,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:07,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208166111] [2020-02-10 19:50:07,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:07,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:50:07,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161570637] [2020-02-10 19:50:07,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:50:07,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:07,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:50:07,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:07,982 INFO L87 Difference]: Start difference. First operand 1568 states and 7032 transitions. Second operand 11 states. [2020-02-10 19:50:08,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:08,154 INFO L93 Difference]: Finished difference Result 2910 states and 11618 transitions. [2020-02-10 19:50:08,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:50:08,155 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:50:08,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:08,162 INFO L225 Difference]: With dead ends: 2910 [2020-02-10 19:50:08,162 INFO L226 Difference]: Without dead ends: 2895 [2020-02-10 19:50:08,162 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:50:08,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2895 states. [2020-02-10 19:50:08,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2895 to 1573. [2020-02-10 19:50:08,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 19:50:08,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7041 transitions. [2020-02-10 19:50:08,230 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7041 transitions. Word has length 28 [2020-02-10 19:50:08,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:08,230 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7041 transitions. [2020-02-10 19:50:08,230 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:50:08,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7041 transitions. [2020-02-10 19:50:08,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:50:08,232 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:08,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] [2020-02-10 19:50:08,232 INFO L427 AbstractCegarLoop]: === Iteration 450 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:08,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:08,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1648001078, now seen corresponding path program 442 times [2020-02-10 19:50:08,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:08,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104131164] [2020-02-10 19:50:08,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:08,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:08,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:08,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104131164] [2020-02-10 19:50:08,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:08,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:50:08,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791662680] [2020-02-10 19:50:08,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:50:08,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:08,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:50:08,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:08,755 INFO L87 Difference]: Start difference. First operand 1573 states and 7041 transitions. Second operand 11 states. [2020-02-10 19:50:08,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:08,935 INFO L93 Difference]: Finished difference Result 2912 states and 11617 transitions. [2020-02-10 19:50:08,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:50:08,935 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:50:08,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:08,942 INFO L225 Difference]: With dead ends: 2912 [2020-02-10 19:50:08,942 INFO L226 Difference]: Without dead ends: 2890 [2020-02-10 19:50:08,942 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:50:08,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2890 states. [2020-02-10 19:50:09,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2890 to 1568. [2020-02-10 19:50:09,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 19:50:09,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7027 transitions. [2020-02-10 19:50:09,020 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7027 transitions. Word has length 28 [2020-02-10 19:50:09,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:09,020 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7027 transitions. [2020-02-10 19:50:09,020 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:50:09,020 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7027 transitions. [2020-02-10 19:50:09,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:50:09,023 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:09,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] [2020-02-10 19:50:09,023 INFO L427 AbstractCegarLoop]: === Iteration 451 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:09,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:09,023 INFO L82 PathProgramCache]: Analyzing trace with hash -538690694, now seen corresponding path program 443 times [2020-02-10 19:50:09,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:09,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611057898] [2020-02-10 19:50:09,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:09,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:09,554 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 19:50:09,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 19:50:09,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611057898] [2020-02-10 19:50:09,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:09,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:50:09,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083466979] [2020-02-10 19:50:09,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:50:09,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:09,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:50:09,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:09,562 INFO L87 Difference]: Start difference. First operand 1568 states and 7027 transitions. Second operand 11 states. [2020-02-10 19:50:09,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:09,735 INFO L93 Difference]: Finished difference Result 2918 states and 11631 transitions. [2020-02-10 19:50:09,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:50:09,736 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:50:09,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:09,743 INFO L225 Difference]: With dead ends: 2918 [2020-02-10 19:50:09,743 INFO L226 Difference]: Without dead ends: 2900 [2020-02-10 19:50:09,743 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:50:09,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2900 states. [2020-02-10 19:50:09,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2900 to 1575. [2020-02-10 19:50:09,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 19:50:09,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7040 transitions. [2020-02-10 19:50:09,832 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7040 transitions. Word has length 28 [2020-02-10 19:50:09,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:09,832 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7040 transitions. [2020-02-10 19:50:09,832 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:50:09,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7040 transitions. [2020-02-10 19:50:09,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:50:09,835 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:09,835 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:09,835 INFO L427 AbstractCegarLoop]: === Iteration 452 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:09,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:09,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1110145500, now seen corresponding path program 444 times [2020-02-10 19:50:09,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:09,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741679900] [2020-02-10 19:50:09,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:09,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:10,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:10,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741679900] [2020-02-10 19:50:10,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:10,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:50:10,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632581562] [2020-02-10 19:50:10,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:50:10,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:10,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:50:10,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:10,348 INFO L87 Difference]: Start difference. First operand 1575 states and 7040 transitions. Second operand 11 states. [2020-02-10 19:50:10,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:10,524 INFO L93 Difference]: Finished difference Result 2917 states and 11622 transitions. [2020-02-10 19:50:10,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:50:10,524 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:50:10,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:10,531 INFO L225 Difference]: With dead ends: 2917 [2020-02-10 19:50:10,531 INFO L226 Difference]: Without dead ends: 2888 [2020-02-10 19:50:10,531 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:50:10,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2888 states. [2020-02-10 19:50:10,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2888 to 1563. [2020-02-10 19:50:10,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2020-02-10 19:50:10,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 7014 transitions. [2020-02-10 19:50:10,598 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 7014 transitions. Word has length 28 [2020-02-10 19:50:10,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:10,598 INFO L479 AbstractCegarLoop]: Abstraction has 1563 states and 7014 transitions. [2020-02-10 19:50:10,598 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:50:10,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 7014 transitions. [2020-02-10 19:50:10,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:50:10,601 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:10,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] [2020-02-10 19:50:10,601 INFO L427 AbstractCegarLoop]: === Iteration 453 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:10,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:10,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1551052644, now seen corresponding path program 445 times [2020-02-10 19:50:10,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:10,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099488162] [2020-02-10 19:50:10,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:10,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:11,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:11,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099488162] [2020-02-10 19:50:11,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:11,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:50:11,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821072390] [2020-02-10 19:50:11,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:50:11,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:11,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:50:11,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:11,118 INFO L87 Difference]: Start difference. First operand 1563 states and 7014 transitions. Second operand 11 states. [2020-02-10 19:50:11,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:11,316 INFO L93 Difference]: Finished difference Result 2897 states and 11586 transitions. [2020-02-10 19:50:11,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:50:11,317 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:50:11,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:11,323 INFO L225 Difference]: With dead ends: 2897 [2020-02-10 19:50:11,323 INFO L226 Difference]: Without dead ends: 2882 [2020-02-10 19:50:11,324 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:50:11,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2882 states. [2020-02-10 19:50:11,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2882 to 1571. [2020-02-10 19:50:11,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 19:50:11,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7036 transitions. [2020-02-10 19:50:11,392 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7036 transitions. Word has length 28 [2020-02-10 19:50:11,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:11,392 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7036 transitions. [2020-02-10 19:50:11,392 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:50:11,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7036 transitions. [2020-02-10 19:50:11,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:50:11,394 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:11,394 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:11,394 INFO L427 AbstractCegarLoop]: === Iteration 454 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:11,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:11,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1724300336, now seen corresponding path program 446 times [2020-02-10 19:50:11,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:11,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291064459] [2020-02-10 19:50:11,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:11,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:11,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:11,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291064459] [2020-02-10 19:50:11,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:11,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:50:11,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762396636] [2020-02-10 19:50:11,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:50:11,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:11,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:50:11,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:11,917 INFO L87 Difference]: Start difference. First operand 1571 states and 7036 transitions. Second operand 11 states. [2020-02-10 19:50:12,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:12,122 INFO L93 Difference]: Finished difference Result 2896 states and 11580 transitions. [2020-02-10 19:50:12,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:50:12,123 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:50:12,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:12,130 INFO L225 Difference]: With dead ends: 2896 [2020-02-10 19:50:12,130 INFO L226 Difference]: Without dead ends: 2878 [2020-02-10 19:50:12,130 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:50:12,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2878 states. [2020-02-10 19:50:12,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2878 to 1567. [2020-02-10 19:50:12,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 19:50:12,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7025 transitions. [2020-02-10 19:50:12,198 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7025 transitions. Word has length 28 [2020-02-10 19:50:12,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:12,198 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7025 transitions. [2020-02-10 19:50:12,198 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:50:12,198 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7025 transitions. [2020-02-10 19:50:12,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:50:12,200 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:12,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] [2020-02-10 19:50:12,200 INFO L427 AbstractCegarLoop]: === Iteration 455 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:12,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:12,200 INFO L82 PathProgramCache]: Analyzing trace with hash 477967264, now seen corresponding path program 447 times [2020-02-10 19:50:12,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:12,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093097944] [2020-02-10 19:50:12,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:12,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:12,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 19:50:12,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093097944] [2020-02-10 19:50:12,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:12,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:50:12,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834400185] [2020-02-10 19:50:12,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:50:12,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:12,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:50:12,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:12,718 INFO L87 Difference]: Start difference. First operand 1567 states and 7025 transitions. Second operand 11 states. [2020-02-10 19:50:12,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:12,934 INFO L93 Difference]: Finished difference Result 2901 states and 11591 transitions. [2020-02-10 19:50:12,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:50:12,935 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:50:12,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:12,942 INFO L225 Difference]: With dead ends: 2901 [2020-02-10 19:50:12,942 INFO L226 Difference]: Without dead ends: 2886 [2020-02-10 19:50:12,942 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:50:12,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2886 states. [2020-02-10 19:50:13,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2886 to 1572. [2020-02-10 19:50:13,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 19:50:13,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7034 transitions. [2020-02-10 19:50:13,008 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7034 transitions. Word has length 28 [2020-02-10 19:50:13,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:13,009 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7034 transitions. [2020-02-10 19:50:13,009 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:50:13,009 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7034 transitions. [2020-02-10 19:50:13,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:50:13,011 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:13,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] [2020-02-10 19:50:13,011 INFO L427 AbstractCegarLoop]: === Iteration 456 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:13,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:13,011 INFO L82 PathProgramCache]: Analyzing trace with hash 2140619952, now seen corresponding path program 448 times [2020-02-10 19:50:13,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:13,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740671697] [2020-02-10 19:50:13,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:13,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:13,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 19:50:13,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740671697] [2020-02-10 19:50:13,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:13,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:50:13,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907882030] [2020-02-10 19:50:13,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:50:13,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:13,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:50:13,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:13,535 INFO L87 Difference]: Start difference. First operand 1572 states and 7034 transitions. Second operand 11 states. [2020-02-10 19:50:13,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:13,719 INFO L93 Difference]: Finished difference Result 2903 states and 11590 transitions. [2020-02-10 19:50:13,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:50:13,719 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:50:13,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:13,727 INFO L225 Difference]: With dead ends: 2903 [2020-02-10 19:50:13,727 INFO L226 Difference]: Without dead ends: 2881 [2020-02-10 19:50:13,727 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:50:13,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2881 states. [2020-02-10 19:50:13,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2881 to 1567. [2020-02-10 19:50:13,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 19:50:13,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7021 transitions. [2020-02-10 19:50:13,794 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7021 transitions. Word has length 28 [2020-02-10 19:50:13,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:13,795 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7021 transitions. [2020-02-10 19:50:13,795 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:50:13,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7021 transitions. [2020-02-10 19:50:13,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:50:13,797 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:13,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] [2020-02-10 19:50:13,797 INFO L427 AbstractCegarLoop]: === Iteration 457 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:13,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:13,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1726926112, now seen corresponding path program 449 times [2020-02-10 19:50:13,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:13,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376844498] [2020-02-10 19:50:13,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:13,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:14,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 19:50:14,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376844498] [2020-02-10 19:50:14,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:14,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:50:14,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38454285] [2020-02-10 19:50:14,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:50:14,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:14,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:50:14,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:14,308 INFO L87 Difference]: Start difference. First operand 1567 states and 7021 transitions. Second operand 11 states. [2020-02-10 19:50:14,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:14,508 INFO L93 Difference]: Finished difference Result 2898 states and 11580 transitions. [2020-02-10 19:50:14,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:50:14,509 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:50:14,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:14,516 INFO L225 Difference]: With dead ends: 2898 [2020-02-10 19:50:14,516 INFO L226 Difference]: Without dead ends: 2884 [2020-02-10 19:50:14,516 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:50:14,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2884 states. [2020-02-10 19:50:14,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2884 to 1571. [2020-02-10 19:50:14,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 19:50:14,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7028 transitions. [2020-02-10 19:50:14,585 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7028 transitions. Word has length 28 [2020-02-10 19:50:14,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:14,585 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7028 transitions. [2020-02-10 19:50:14,585 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:50:14,586 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7028 transitions. [2020-02-10 19:50:14,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:50:14,588 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:14,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] [2020-02-10 19:50:14,588 INFO L427 AbstractCegarLoop]: === Iteration 458 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:14,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:14,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1078636188, now seen corresponding path program 450 times [2020-02-10 19:50:14,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:14,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520356662] [2020-02-10 19:50:14,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:14,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:15,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:15,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520356662] [2020-02-10 19:50:15,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:15,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:50:15,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128505498] [2020-02-10 19:50:15,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:50:15,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:15,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:50:15,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:15,112 INFO L87 Difference]: Start difference. First operand 1571 states and 7028 transitions. Second operand 11 states. [2020-02-10 19:50:15,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:15,335 INFO L93 Difference]: Finished difference Result 2901 states and 11582 transitions. [2020-02-10 19:50:15,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:50:15,336 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:50:15,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:15,344 INFO L225 Difference]: With dead ends: 2901 [2020-02-10 19:50:15,344 INFO L226 Difference]: Without dead ends: 2876 [2020-02-10 19:50:15,344 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:50:15,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2876 states. [2020-02-10 19:50:15,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2876 to 1563. [2020-02-10 19:50:15,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2020-02-10 19:50:15,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 7010 transitions. [2020-02-10 19:50:15,411 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 7010 transitions. Word has length 28 [2020-02-10 19:50:15,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:15,411 INFO L479 AbstractCegarLoop]: Abstraction has 1563 states and 7010 transitions. [2020-02-10 19:50:15,411 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:50:15,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 7010 transitions. [2020-02-10 19:50:15,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:50:15,413 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:15,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] [2020-02-10 19:50:15,413 INFO L427 AbstractCegarLoop]: === Iteration 459 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:15,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:15,413 INFO L82 PathProgramCache]: Analyzing trace with hash -478297846, now seen corresponding path program 451 times [2020-02-10 19:50:15,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:15,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144452830] [2020-02-10 19:50:15,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:15,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:15,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 19:50:15,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144452830] [2020-02-10 19:50:15,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:15,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:50:15,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401422356] [2020-02-10 19:50:15,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:50:15,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:15,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:50:15,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:15,922 INFO L87 Difference]: Start difference. First operand 1563 states and 7010 transitions. Second operand 11 states. [2020-02-10 19:50:16,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:16,095 INFO L93 Difference]: Finished difference Result 2908 states and 11606 transitions. [2020-02-10 19:50:16,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:50:16,095 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:50:16,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:16,102 INFO L225 Difference]: With dead ends: 2908 [2020-02-10 19:50:16,102 INFO L226 Difference]: Without dead ends: 2890 [2020-02-10 19:50:16,102 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:50:16,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2890 states. [2020-02-10 19:50:16,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2890 to 1571. [2020-02-10 19:50:16,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 19:50:16,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7032 transitions. [2020-02-10 19:50:16,171 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7032 transitions. Word has length 28 [2020-02-10 19:50:16,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:16,171 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7032 transitions. [2020-02-10 19:50:16,171 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:50:16,171 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7032 transitions. [2020-02-10 19:50:16,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:50:16,174 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:16,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] [2020-02-10 19:50:16,174 INFO L427 AbstractCegarLoop]: === Iteration 460 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:16,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:16,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1755809648, now seen corresponding path program 452 times [2020-02-10 19:50:16,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:16,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865724946] [2020-02-10 19:50:16,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:16,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:16,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:16,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865724946] [2020-02-10 19:50:16,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:16,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:50:16,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76331020] [2020-02-10 19:50:16,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:50:16,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:16,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:50:16,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:16,691 INFO L87 Difference]: Start difference. First operand 1571 states and 7032 transitions. Second operand 11 states. [2020-02-10 19:50:16,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:16,872 INFO L93 Difference]: Finished difference Result 2904 states and 11594 transitions. [2020-02-10 19:50:16,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:50:16,872 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:50:16,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:16,879 INFO L225 Difference]: With dead ends: 2904 [2020-02-10 19:50:16,880 INFO L226 Difference]: Without dead ends: 2886 [2020-02-10 19:50:16,880 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:50:16,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2886 states. [2020-02-10 19:50:16,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2886 to 1567. [2020-02-10 19:50:16,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 19:50:16,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7021 transitions. [2020-02-10 19:50:16,947 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7021 transitions. Word has length 28 [2020-02-10 19:50:16,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:16,947 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7021 transitions. [2020-02-10 19:50:16,947 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:50:16,947 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7021 transitions. [2020-02-10 19:50:16,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:50:16,949 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:16,949 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:16,949 INFO L427 AbstractCegarLoop]: === Iteration 461 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:16,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:16,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1551383226, now seen corresponding path program 453 times [2020-02-10 19:50:16,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:16,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164495439] [2020-02-10 19:50:16,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:16,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:17,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 19:50:17,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164495439] [2020-02-10 19:50:17,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:17,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:50:17,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698196582] [2020-02-10 19:50:17,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:50:17,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:17,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:50:17,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:17,479 INFO L87 Difference]: Start difference. First operand 1567 states and 7021 transitions. Second operand 11 states. [2020-02-10 19:50:17,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:17,691 INFO L93 Difference]: Finished difference Result 2914 states and 11617 transitions. [2020-02-10 19:50:17,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:50:17,692 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:50:17,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:17,699 INFO L225 Difference]: With dead ends: 2914 [2020-02-10 19:50:17,699 INFO L226 Difference]: Without dead ends: 2896 [2020-02-10 19:50:17,699 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:50:17,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2896 states. [2020-02-10 19:50:17,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2896 to 1574. [2020-02-10 19:50:17,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 19:50:17,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7034 transitions. [2020-02-10 19:50:17,768 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7034 transitions. Word has length 28 [2020-02-10 19:50:17,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:17,768 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7034 transitions. [2020-02-10 19:50:17,768 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:50:17,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7034 transitions. [2020-02-10 19:50:17,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:50:17,770 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:17,770 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:17,770 INFO L427 AbstractCegarLoop]: === Iteration 462 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:17,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:17,771 INFO L82 PathProgramCache]: Analyzing trace with hash -2122838032, now seen corresponding path program 454 times [2020-02-10 19:50:17,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:17,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690726735] [2020-02-10 19:50:17,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:17,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:18,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 19:50:18,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690726735] [2020-02-10 19:50:18,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:18,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:50:18,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428818765] [2020-02-10 19:50:18,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:50:18,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:18,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:50:18,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:18,298 INFO L87 Difference]: Start difference. First operand 1574 states and 7034 transitions. Second operand 11 states. [2020-02-10 19:50:18,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:18,493 INFO L93 Difference]: Finished difference Result 2913 states and 11608 transitions. [2020-02-10 19:50:18,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:50:18,494 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:50:18,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:18,501 INFO L225 Difference]: With dead ends: 2913 [2020-02-10 19:50:18,501 INFO L226 Difference]: Without dead ends: 2889 [2020-02-10 19:50:18,502 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:50:18,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2889 states. [2020-02-10 19:50:18,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2889 to 1567. [2020-02-10 19:50:18,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 19:50:18,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7017 transitions. [2020-02-10 19:50:18,569 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7017 transitions. Word has length 28 [2020-02-10 19:50:18,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:18,569 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7017 transitions. [2020-02-10 19:50:18,569 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:50:18,569 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7017 transitions. [2020-02-10 19:50:18,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:50:18,571 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:18,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] [2020-02-10 19:50:18,571 INFO L427 AbstractCegarLoop]: === Iteration 463 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:18,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:18,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1220579846, now seen corresponding path program 455 times [2020-02-10 19:50:18,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:18,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344058425] [2020-02-10 19:50:18,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:18,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:19,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 19:50:19,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344058425] [2020-02-10 19:50:19,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:19,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:50:19,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353733030] [2020-02-10 19:50:19,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:50:19,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:19,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:50:19,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:19,097 INFO L87 Difference]: Start difference. First operand 1567 states and 7017 transitions. Second operand 11 states. [2020-02-10 19:50:19,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:19,327 INFO L93 Difference]: Finished difference Result 2903 states and 11588 transitions. [2020-02-10 19:50:19,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:50:19,327 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:50:19,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:19,335 INFO L225 Difference]: With dead ends: 2903 [2020-02-10 19:50:19,335 INFO L226 Difference]: Without dead ends: 2889 [2020-02-10 19:50:19,335 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:50:19,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2889 states. [2020-02-10 19:50:19,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2889 to 1571. [2020-02-10 19:50:19,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 19:50:19,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7024 transitions. [2020-02-10 19:50:19,402 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7024 transitions. Word has length 28 [2020-02-10 19:50:19,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:19,402 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7024 transitions. [2020-02-10 19:50:19,402 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:50:19,402 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7024 transitions. [2020-02-10 19:50:19,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:50:19,404 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:19,405 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:19,405 INFO L427 AbstractCegarLoop]: === Iteration 464 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:19,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:19,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1584982454, now seen corresponding path program 456 times [2020-02-10 19:50:19,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:19,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231615988] [2020-02-10 19:50:19,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:19,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:19,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 19:50:19,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231615988] [2020-02-10 19:50:19,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:19,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:50:19,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421422072] [2020-02-10 19:50:19,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:50:19,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:19,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:50:19,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:19,922 INFO L87 Difference]: Start difference. First operand 1571 states and 7024 transitions. Second operand 11 states. [2020-02-10 19:50:20,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:20,143 INFO L93 Difference]: Finished difference Result 2906 states and 11590 transitions. [2020-02-10 19:50:20,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:50:20,144 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:50:20,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:20,151 INFO L225 Difference]: With dead ends: 2906 [2020-02-10 19:50:20,151 INFO L226 Difference]: Without dead ends: 2877 [2020-02-10 19:50:20,152 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:50:20,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2877 states. [2020-02-10 19:50:20,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2877 to 1559. [2020-02-10 19:50:20,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1559 states. [2020-02-10 19:50:20,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 6999 transitions. [2020-02-10 19:50:20,220 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 6999 transitions. Word has length 28 [2020-02-10 19:50:20,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:20,220 INFO L479 AbstractCegarLoop]: Abstraction has 1559 states and 6999 transitions. [2020-02-10 19:50:20,220 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:50:20,220 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 6999 transitions. [2020-02-10 19:50:20,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:50:20,222 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:20,222 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:20,222 INFO L427 AbstractCegarLoop]: === Iteration 465 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:20,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:20,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1188275872, now seen corresponding path program 457 times [2020-02-10 19:50:20,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:20,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26611686] [2020-02-10 19:50:20,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:20,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:20,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:20,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26611686] [2020-02-10 19:50:20,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:20,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:50:20,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029684788] [2020-02-10 19:50:20,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:50:20,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:20,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:50:20,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:20,743 INFO L87 Difference]: Start difference. First operand 1559 states and 6999 transitions. Second operand 11 states. [2020-02-10 19:50:20,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:20,968 INFO L93 Difference]: Finished difference Result 2912 states and 11627 transitions. [2020-02-10 19:50:20,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:50:20,969 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:50:20,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:20,976 INFO L225 Difference]: With dead ends: 2912 [2020-02-10 19:50:20,977 INFO L226 Difference]: Without dead ends: 2896 [2020-02-10 19:50:20,977 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:50:21,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2896 states. [2020-02-10 19:50:21,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2896 to 1573. [2020-02-10 19:50:21,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 19:50:21,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7044 transitions. [2020-02-10 19:50:21,043 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7044 transitions. Word has length 28 [2020-02-10 19:50:21,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:21,044 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7044 transitions. [2020-02-10 19:50:21,044 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:50:21,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7044 transitions. [2020-02-10 19:50:21,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:50:21,046 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:21,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] [2020-02-10 19:50:21,046 INFO L427 AbstractCegarLoop]: === Iteration 466 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:21,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:21,046 INFO L82 PathProgramCache]: Analyzing trace with hash 301129124, now seen corresponding path program 458 times [2020-02-10 19:50:21,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:21,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704957769] [2020-02-10 19:50:21,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:21,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:21,555 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 19:50:21,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:21,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704957769] [2020-02-10 19:50:21,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:21,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:50:21,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292342340] [2020-02-10 19:50:21,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:50:21,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:21,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:50:21,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:21,563 INFO L87 Difference]: Start difference. First operand 1573 states and 7044 transitions. Second operand 11 states. [2020-02-10 19:50:21,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:21,749 INFO L93 Difference]: Finished difference Result 2914 states and 11625 transitions. [2020-02-10 19:50:21,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:50:21,749 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:50:21,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:21,757 INFO L225 Difference]: With dead ends: 2914 [2020-02-10 19:50:21,757 INFO L226 Difference]: Without dead ends: 2890 [2020-02-10 19:50:21,757 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:50:21,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2890 states. [2020-02-10 19:50:21,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2890 to 1567. [2020-02-10 19:50:21,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 19:50:21,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7029 transitions. [2020-02-10 19:50:21,825 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7029 transitions. Word has length 28 [2020-02-10 19:50:21,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:21,826 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7029 transitions. [2020-02-10 19:50:21,826 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:50:21,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7029 transitions. [2020-02-10 19:50:21,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:50:21,828 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:21,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] [2020-02-10 19:50:21,828 INFO L427 AbstractCegarLoop]: === Iteration 467 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:21,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:21,828 INFO L82 PathProgramCache]: Analyzing trace with hash -650420294, now seen corresponding path program 459 times [2020-02-10 19:50:21,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:21,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696889094] [2020-02-10 19:50:21,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:21,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:22,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:22,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696889094] [2020-02-10 19:50:22,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:22,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:50:22,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713747392] [2020-02-10 19:50:22,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:50:22,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:22,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:50:22,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:22,350 INFO L87 Difference]: Start difference. First operand 1567 states and 7029 transitions. Second operand 11 states. [2020-02-10 19:50:22,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:22,559 INFO L93 Difference]: Finished difference Result 2906 states and 11609 transitions. [2020-02-10 19:50:22,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:50:22,559 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:50:22,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:22,566 INFO L225 Difference]: With dead ends: 2906 [2020-02-10 19:50:22,566 INFO L226 Difference]: Without dead ends: 2890 [2020-02-10 19:50:22,566 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:50:22,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2890 states. [2020-02-10 19:50:22,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2890 to 1571. [2020-02-10 19:50:22,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 19:50:22,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7036 transitions. [2020-02-10 19:50:22,633 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7036 transitions. Word has length 28 [2020-02-10 19:50:22,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:22,633 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7036 transitions. [2020-02-10 19:50:22,633 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:50:22,633 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7036 transitions. [2020-02-10 19:50:22,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:50:22,636 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:22,636 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:22,636 INFO L427 AbstractCegarLoop]: === Iteration 468 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:22,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:22,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1221875100, now seen corresponding path program 460 times [2020-02-10 19:50:22,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:22,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392673749] [2020-02-10 19:50:22,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:22,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:23,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 19:50:23,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392673749] [2020-02-10 19:50:23,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:23,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:50:23,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590954641] [2020-02-10 19:50:23,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:50:23,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:23,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:50:23,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:23,157 INFO L87 Difference]: Start difference. First operand 1571 states and 7036 transitions. Second operand 11 states. [2020-02-10 19:50:23,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:23,388 INFO L93 Difference]: Finished difference Result 2904 states and 11601 transitions. [2020-02-10 19:50:23,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:50:23,388 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:50:23,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:23,395 INFO L225 Difference]: With dead ends: 2904 [2020-02-10 19:50:23,395 INFO L226 Difference]: Without dead ends: 2886 [2020-02-10 19:50:23,395 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:50:23,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2886 states. [2020-02-10 19:50:23,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2886 to 1567. [2020-02-10 19:50:23,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 19:50:23,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7025 transitions. [2020-02-10 19:50:23,464 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7025 transitions. Word has length 28 [2020-02-10 19:50:23,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:23,464 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7025 transitions. [2020-02-10 19:50:23,464 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:50:23,464 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7025 transitions. [2020-02-10 19:50:23,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:50:23,466 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:23,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] [2020-02-10 19:50:23,466 INFO L427 AbstractCegarLoop]: === Iteration 469 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:23,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:23,467 INFO L82 PathProgramCache]: Analyzing trace with hash -234100678, now seen corresponding path program 461 times [2020-02-10 19:50:23,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:23,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902032091] [2020-02-10 19:50:23,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:23,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:23,980 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 19:50:23,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:23,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902032091] [2020-02-10 19:50:23,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:23,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:50:23,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261842371] [2020-02-10 19:50:23,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:50:23,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:23,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:50:23,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:23,987 INFO L87 Difference]: Start difference. First operand 1567 states and 7025 transitions. Second operand 11 states. [2020-02-10 19:50:24,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:24,188 INFO L93 Difference]: Finished difference Result 2910 states and 11613 transitions. [2020-02-10 19:50:24,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:50:24,188 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:50:24,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:24,196 INFO L225 Difference]: With dead ends: 2910 [2020-02-10 19:50:24,196 INFO L226 Difference]: Without dead ends: 2892 [2020-02-10 19:50:24,196 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:50:24,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2892 states. [2020-02-10 19:50:24,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2892 to 1571. [2020-02-10 19:50:24,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 19:50:24,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7032 transitions. [2020-02-10 19:50:24,264 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7032 transitions. Word has length 28 [2020-02-10 19:50:24,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:24,264 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7032 transitions. [2020-02-10 19:50:24,264 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:50:24,264 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7032 transitions. [2020-02-10 19:50:24,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:50:24,266 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:24,266 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:24,266 INFO L427 AbstractCegarLoop]: === Iteration 470 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:24,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:24,266 INFO L82 PathProgramCache]: Analyzing trace with hash 2000006816, now seen corresponding path program 462 times [2020-02-10 19:50:24,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:24,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688916815] [2020-02-10 19:50:24,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:24,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:24,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:24,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688916815] [2020-02-10 19:50:24,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:24,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:50:24,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630272481] [2020-02-10 19:50:24,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:50:24,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:24,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:50:24,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:24,777 INFO L87 Difference]: Start difference. First operand 1571 states and 7032 transitions. Second operand 11 states. [2020-02-10 19:50:24,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:24,971 INFO L93 Difference]: Finished difference Result 2906 states and 11601 transitions. [2020-02-10 19:50:24,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:50:24,971 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:50:24,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:24,979 INFO L225 Difference]: With dead ends: 2906 [2020-02-10 19:50:24,979 INFO L226 Difference]: Without dead ends: 2884 [2020-02-10 19:50:24,979 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:50:25,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2884 states. [2020-02-10 19:50:25,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2884 to 1563. [2020-02-10 19:50:25,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2020-02-10 19:50:25,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 7014 transitions. [2020-02-10 19:50:25,046 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 7014 transitions. Word has length 28 [2020-02-10 19:50:25,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:25,046 INFO L479 AbstractCegarLoop]: Abstraction has 1563 states and 7014 transitions. [2020-02-10 19:50:25,046 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:50:25,046 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 7014 transitions. [2020-02-10 19:50:25,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:50:25,048 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:25,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] [2020-02-10 19:50:25,049 INFO L427 AbstractCegarLoop]: === Iteration 471 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:25,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:25,049 INFO L82 PathProgramCache]: Analyzing trace with hash -94184284, now seen corresponding path program 463 times [2020-02-10 19:50:25,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:25,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499023131] [2020-02-10 19:50:25,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:25,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:25,568 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 19:50:25,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:25,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499023131] [2020-02-10 19:50:25,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:25,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:50:25,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702609551] [2020-02-10 19:50:25,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:50:25,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:25,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:50:25,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:25,576 INFO L87 Difference]: Start difference. First operand 1563 states and 7014 transitions. Second operand 11 states. [2020-02-10 19:50:25,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:25,788 INFO L93 Difference]: Finished difference Result 2922 states and 11652 transitions. [2020-02-10 19:50:25,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:50:25,789 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:50:25,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:25,796 INFO L225 Difference]: With dead ends: 2922 [2020-02-10 19:50:25,796 INFO L226 Difference]: Without dead ends: 2906 [2020-02-10 19:50:25,796 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:50:25,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2906 states. [2020-02-10 19:50:25,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2906 to 1575. [2020-02-10 19:50:25,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 19:50:25,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7048 transitions. [2020-02-10 19:50:25,863 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7048 transitions. Word has length 28 [2020-02-10 19:50:25,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:25,863 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7048 transitions. [2020-02-10 19:50:25,863 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:50:25,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7048 transitions. [2020-02-10 19:50:25,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:50:25,865 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:25,865 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:25,866 INFO L427 AbstractCegarLoop]: === Iteration 472 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:25,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:25,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1395220712, now seen corresponding path program 464 times [2020-02-10 19:50:25,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:25,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800232335] [2020-02-10 19:50:25,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:25,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:26,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 19:50:26,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800232335] [2020-02-10 19:50:26,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:26,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:50:26,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391681698] [2020-02-10 19:50:26,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:50:26,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:26,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:50:26,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:26,400 INFO L87 Difference]: Start difference. First operand 1575 states and 7048 transitions. Second operand 11 states. [2020-02-10 19:50:26,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:26,603 INFO L93 Difference]: Finished difference Result 2924 states and 11650 transitions. [2020-02-10 19:50:26,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:50:26,604 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:50:26,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:26,611 INFO L225 Difference]: With dead ends: 2924 [2020-02-10 19:50:26,611 INFO L226 Difference]: Without dead ends: 2900 [2020-02-10 19:50:26,611 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:50:26,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2900 states. [2020-02-10 19:50:26,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2900 to 1569. [2020-02-10 19:50:26,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 19:50:26,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7031 transitions. [2020-02-10 19:50:26,677 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7031 transitions. Word has length 28 [2020-02-10 19:50:26,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:26,677 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7031 transitions. [2020-02-10 19:50:26,678 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:50:26,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7031 transitions. [2020-02-10 19:50:26,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:50:26,680 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:26,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] [2020-02-10 19:50:26,680 INFO L427 AbstractCegarLoop]: === Iteration 473 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:26,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:26,680 INFO L82 PathProgramCache]: Analyzing trace with hash -629414086, now seen corresponding path program 465 times [2020-02-10 19:50:26,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:26,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238080812] [2020-02-10 19:50:26,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:26,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50: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 19:50:27,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238080812] [2020-02-10 19:50:27,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:27,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:50:27,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079659853] [2020-02-10 19:50:27,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:50:27,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:27,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:50:27,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:27,206 INFO L87 Difference]: Start difference. First operand 1569 states and 7031 transitions. Second operand 11 states. [2020-02-10 19:50:27,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:27,467 INFO L93 Difference]: Finished difference Result 2921 states and 11644 transitions. [2020-02-10 19:50:27,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:50:27,467 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:50:27,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:27,475 INFO L225 Difference]: With dead ends: 2921 [2020-02-10 19:50:27,475 INFO L226 Difference]: Without dead ends: 2905 [2020-02-10 19:50:27,475 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:50:27,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2905 states. [2020-02-10 19:50:27,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2905 to 1575. [2020-02-10 19:50:27,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 19:50:27,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7042 transitions. [2020-02-10 19:50:27,542 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7042 transitions. Word has length 28 [2020-02-10 19:50:27,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:27,542 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7042 transitions. [2020-02-10 19:50:27,542 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:50:27,542 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7042 transitions. [2020-02-10 19:50:27,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:50:27,544 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:27,544 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:27,545 INFO L427 AbstractCegarLoop]: === Iteration 474 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:27,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:27,545 INFO L82 PathProgramCache]: Analyzing trace with hash 288536104, now seen corresponding path program 466 times [2020-02-10 19:50:27,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:27,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068625936] [2020-02-10 19:50:27,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:27,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:28,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 19:50:28,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068625936] [2020-02-10 19:50:28,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:28,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:50:28,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111946553] [2020-02-10 19:50:28,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:50:28,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:28,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:50:28,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:28,071 INFO L87 Difference]: Start difference. First operand 1575 states and 7042 transitions. Second operand 11 states. [2020-02-10 19:50:28,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:28,279 INFO L93 Difference]: Finished difference Result 2922 states and 11640 transitions. [2020-02-10 19:50:28,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:50:28,280 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:50:28,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:28,287 INFO L225 Difference]: With dead ends: 2922 [2020-02-10 19:50:28,287 INFO L226 Difference]: Without dead ends: 2899 [2020-02-10 19:50:28,287 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:50:28,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2899 states. [2020-02-10 19:50:28,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2899 to 1569. [2020-02-10 19:50:28,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 19:50:28,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7025 transitions. [2020-02-10 19:50:28,354 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7025 transitions. Word has length 28 [2020-02-10 19:50:28,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:28,355 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7025 transitions. [2020-02-10 19:50:28,355 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:50:28,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7025 transitions. [2020-02-10 19:50:28,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:50:28,357 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:28,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] [2020-02-10 19:50:28,357 INFO L427 AbstractCegarLoop]: === Iteration 475 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:28,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:28,357 INFO L82 PathProgramCache]: Analyzing trace with hash -213094470, now seen corresponding path program 467 times [2020-02-10 19:50:28,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:28,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724061628] [2020-02-10 19:50:28,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:28,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:28,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:28,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724061628] [2020-02-10 19:50:28,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:28,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:50:28,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971476053] [2020-02-10 19:50:28,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:50:28,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:28,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:50:28,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:28,888 INFO L87 Difference]: Start difference. First operand 1569 states and 7025 transitions. Second operand 11 states. [2020-02-10 19:50:29,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:29,149 INFO L93 Difference]: Finished difference Result 2926 states and 11649 transitions. [2020-02-10 19:50:29,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:50:29,150 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:50:29,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:29,157 INFO L225 Difference]: With dead ends: 2926 [2020-02-10 19:50:29,157 INFO L226 Difference]: Without dead ends: 2908 [2020-02-10 19:50:29,157 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:50:29,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2908 states. [2020-02-10 19:50:29,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2908 to 1576. [2020-02-10 19:50:29,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 19:50:29,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7038 transitions. [2020-02-10 19:50:29,223 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7038 transitions. Word has length 28 [2020-02-10 19:50:29,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:29,224 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7038 transitions. [2020-02-10 19:50:29,224 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:50:29,224 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7038 transitions. [2020-02-10 19:50:29,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:50:29,226 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:29,226 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:29,226 INFO L427 AbstractCegarLoop]: === Iteration 476 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:29,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:29,226 INFO L82 PathProgramCache]: Analyzing trace with hash -784549276, now seen corresponding path program 468 times [2020-02-10 19:50:29,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:29,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762837942] [2020-02-10 19:50:29,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:29,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:29,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:29,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762837942] [2020-02-10 19:50:29,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:29,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:50:29,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093596309] [2020-02-10 19:50:29,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:50:29,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:29,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:50:29,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:29,763 INFO L87 Difference]: Start difference. First operand 1576 states and 7038 transitions. Second operand 11 states. [2020-02-10 19:50:29,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:29,970 INFO L93 Difference]: Finished difference Result 2925 states and 11640 transitions. [2020-02-10 19:50:29,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:50:29,971 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:50:29,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:29,978 INFO L225 Difference]: With dead ends: 2925 [2020-02-10 19:50:29,978 INFO L226 Difference]: Without dead ends: 2895 [2020-02-10 19:50:29,978 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:50:30,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2895 states. [2020-02-10 19:50:30,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2895 to 1563. [2020-02-10 19:50:30,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2020-02-10 19:50:30,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 7010 transitions. [2020-02-10 19:50:30,045 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 7010 transitions. Word has length 28 [2020-02-10 19:50:30,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:30,045 INFO L479 AbstractCegarLoop]: Abstraction has 1563 states and 7010 transitions. [2020-02-10 19:50:30,045 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:50:30,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 7010 transitions. [2020-02-10 19:50:30,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:50:30,047 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:30,047 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:30,048 INFO L427 AbstractCegarLoop]: === Iteration 477 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:30,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:30,048 INFO L82 PathProgramCache]: Analyzing trace with hash -62674972, now seen corresponding path program 469 times [2020-02-10 19:50:30,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:30,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39880889] [2020-02-10 19:50:30,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:30,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:30,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 19:50:30,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39880889] [2020-02-10 19:50:30,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:30,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:50:30,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527263234] [2020-02-10 19:50:30,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:50:30,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:30,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:50:30,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:30,569 INFO L87 Difference]: Start difference. First operand 1563 states and 7010 transitions. Second operand 11 states. [2020-02-10 19:50:30,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:30,783 INFO L93 Difference]: Finished difference Result 2905 states and 11603 transitions. [2020-02-10 19:50:30,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:50:30,783 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:50:30,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:30,791 INFO L225 Difference]: With dead ends: 2905 [2020-02-10 19:50:30,791 INFO L226 Difference]: Without dead ends: 2889 [2020-02-10 19:50:30,791 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:50:30,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2889 states. [2020-02-10 19:50:30,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2889 to 1571. [2020-02-10 19:50:30,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 19:50:30,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7032 transitions. [2020-02-10 19:50:30,858 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7032 transitions. Word has length 28 [2020-02-10 19:50:30,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:30,859 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7032 transitions. [2020-02-10 19:50:30,859 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:50:30,859 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7032 transitions. [2020-02-10 19:50:30,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:50:30,861 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:30,861 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:30,861 INFO L427 AbstractCegarLoop]: === Iteration 478 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:30,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:30,861 INFO L82 PathProgramCache]: Analyzing trace with hash -634129778, now seen corresponding path program 470 times [2020-02-10 19:50:30,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:30,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581825858] [2020-02-10 19:50:30,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:30,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:31,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:31,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581825858] [2020-02-10 19:50:31,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:31,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:50:31,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497299284] [2020-02-10 19:50:31,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:50:31,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:31,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:50:31,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:31,383 INFO L87 Difference]: Start difference. First operand 1571 states and 7032 transitions. Second operand 11 states. [2020-02-10 19:50:31,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:31,593 INFO L93 Difference]: Finished difference Result 2903 states and 11595 transitions. [2020-02-10 19:50:31,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:50:31,593 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:50:31,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:31,600 INFO L225 Difference]: With dead ends: 2903 [2020-02-10 19:50:31,601 INFO L226 Difference]: Without dead ends: 2885 [2020-02-10 19:50:31,601 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:50:31,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2885 states. [2020-02-10 19:50:31,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2885 to 1567. [2020-02-10 19:50:31,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 19:50:31,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7021 transitions. [2020-02-10 19:50:31,669 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7021 transitions. Word has length 28 [2020-02-10 19:50:31,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:31,669 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7021 transitions. [2020-02-10 19:50:31,669 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:50:31,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7021 transitions. [2020-02-10 19:50:31,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:50:31,671 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:31,672 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:31,672 INFO L427 AbstractCegarLoop]: === Iteration 479 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:31,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:31,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1135760352, now seen corresponding path program 471 times [2020-02-10 19:50:31,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:31,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388175006] [2020-02-10 19:50:31,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:31,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:32,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:32,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388175006] [2020-02-10 19:50:32,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:32,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:50:32,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785194608] [2020-02-10 19:50:32,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:50:32,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:32,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:50:32,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:32,195 INFO L87 Difference]: Start difference. First operand 1567 states and 7021 transitions. Second operand 11 states. [2020-02-10 19:50:32,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:32,399 INFO L93 Difference]: Finished difference Result 2910 states and 11611 transitions. [2020-02-10 19:50:32,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:50:32,400 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:50:32,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:32,407 INFO L225 Difference]: With dead ends: 2910 [2020-02-10 19:50:32,407 INFO L226 Difference]: Without dead ends: 2894 [2020-02-10 19:50:32,408 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:50:32,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2894 states. [2020-02-10 19:50:32,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2894 to 1573. [2020-02-10 19:50:32,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 19:50:32,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7032 transitions. [2020-02-10 19:50:32,476 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7032 transitions. Word has length 28 [2020-02-10 19:50:32,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:32,476 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7032 transitions. [2020-02-10 19:50:32,476 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:50:32,476 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7032 transitions. [2020-02-10 19:50:32,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:50:32,478 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:32,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] [2020-02-10 19:50:32,478 INFO L427 AbstractCegarLoop]: === Iteration 480 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:32,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:32,479 INFO L82 PathProgramCache]: Analyzing trace with hash -217810162, now seen corresponding path program 472 times [2020-02-10 19:50:32,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:32,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087880432] [2020-02-10 19:50:32,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:32,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:32,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:33,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087880432] [2020-02-10 19:50:33,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:33,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:50:33,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407190969] [2020-02-10 19:50:33,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:50:33,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:33,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:50:33,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:33,001 INFO L87 Difference]: Start difference. First operand 1573 states and 7032 transitions. Second operand 11 states. [2020-02-10 19:50:33,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:33,269 INFO L93 Difference]: Finished difference Result 2911 states and 11607 transitions. [2020-02-10 19:50:33,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:50:33,270 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:50:33,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:33,277 INFO L225 Difference]: With dead ends: 2911 [2020-02-10 19:50:33,277 INFO L226 Difference]: Without dead ends: 2888 [2020-02-10 19:50:33,278 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:50:33,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2888 states. [2020-02-10 19:50:33,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2888 to 1567. [2020-02-10 19:50:33,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 19:50:33,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7017 transitions. [2020-02-10 19:50:33,347 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7017 transitions. Word has length 28 [2020-02-10 19:50:33,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:33,347 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7017 transitions. [2020-02-10 19:50:33,347 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:50:33,347 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7017 transitions. [2020-02-10 19:50:33,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:50:33,349 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:33,349 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:33,349 INFO L427 AbstractCegarLoop]: === Iteration 481 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:33,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:33,350 INFO L82 PathProgramCache]: Analyzing trace with hash 2052522336, now seen corresponding path program 473 times [2020-02-10 19:50:33,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:33,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199581111] [2020-02-10 19:50:33,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:33,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:33,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:33,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199581111] [2020-02-10 19:50:33,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:33,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:50:33,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015671742] [2020-02-10 19:50:33,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:50:33,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:33,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:50:33,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:33,870 INFO L87 Difference]: Start difference. First operand 1567 states and 7017 transitions. Second operand 11 states. [2020-02-10 19:50:34,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:34,067 INFO L93 Difference]: Finished difference Result 2904 states and 11593 transitions. [2020-02-10 19:50:34,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:50:34,068 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:50:34,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:34,075 INFO L225 Difference]: With dead ends: 2904 [2020-02-10 19:50:34,075 INFO L226 Difference]: Without dead ends: 2890 [2020-02-10 19:50:34,076 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:50:34,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2890 states. [2020-02-10 19:50:34,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2890 to 1571. [2020-02-10 19:50:34,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 19:50:34,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7024 transitions. [2020-02-10 19:50:34,143 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7024 transitions. Word has length 28 [2020-02-10 19:50:34,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:34,143 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7024 transitions. [2020-02-10 19:50:34,143 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:50:34,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7024 transitions. [2020-02-10 19:50:34,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:50:34,145 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:34,145 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:34,145 INFO L427 AbstractCegarLoop]: === Iteration 482 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:34,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:34,145 INFO L82 PathProgramCache]: Analyzing trace with hash -753039964, now seen corresponding path program 474 times [2020-02-10 19:50:34,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:34,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552338917] [2020-02-10 19:50:34,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:34,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:34,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 19:50:34,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552338917] [2020-02-10 19:50:34,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:34,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:50:34,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884939492] [2020-02-10 19:50:34,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:50:34,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:34,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:50:34,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:34,663 INFO L87 Difference]: Start difference. First operand 1571 states and 7024 transitions. Second operand 11 states. [2020-02-10 19:50:34,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:34,932 INFO L93 Difference]: Finished difference Result 2907 states and 11595 transitions. [2020-02-10 19:50:34,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:50:34,933 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:50:34,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:34,940 INFO L225 Difference]: With dead ends: 2907 [2020-02-10 19:50:34,940 INFO L226 Difference]: Without dead ends: 2882 [2020-02-10 19:50:34,940 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:50:34,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2882 states. [2020-02-10 19:50:35,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2882 to 1563. [2020-02-10 19:50:35,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2020-02-10 19:50:35,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 7006 transitions. [2020-02-10 19:50:35,009 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 7006 transitions. Word has length 28 [2020-02-10 19:50:35,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:35,009 INFO L479 AbstractCegarLoop]: Abstraction has 1563 states and 7006 transitions. [2020-02-10 19:50:35,009 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:50:35,009 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 7006 transitions. [2020-02-10 19:50:35,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:50:35,011 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:35,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] [2020-02-10 19:50:35,012 INFO L427 AbstractCegarLoop]: === Iteration 483 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:35,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:35,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1447736232, now seen corresponding path program 475 times [2020-02-10 19:50:35,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:35,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981158942] [2020-02-10 19:50:35,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:35,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:35,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:35,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981158942] [2020-02-10 19:50:35,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:35,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:50:35,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469998566] [2020-02-10 19:50:35,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:50:35,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:35,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:50:35,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:35,528 INFO L87 Difference]: Start difference. First operand 1563 states and 7006 transitions. Second operand 11 states. [2020-02-10 19:50:35,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:35,695 INFO L93 Difference]: Finished difference Result 2912 states and 11614 transitions. [2020-02-10 19:50:35,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:50:35,695 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:50:35,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:35,702 INFO L225 Difference]: With dead ends: 2912 [2020-02-10 19:50:35,703 INFO L226 Difference]: Without dead ends: 2894 [2020-02-10 19:50:35,703 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:50:35,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2894 states. [2020-02-10 19:50:35,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2894 to 1571. [2020-02-10 19:50:35,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 19:50:35,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7028 transitions. [2020-02-10 19:50:35,770 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7028 transitions. Word has length 28 [2020-02-10 19:50:35,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:35,770 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7028 transitions. [2020-02-10 19:50:35,770 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:50:35,770 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7028 transitions. [2020-02-10 19:50:35,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:50:35,772 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:35,772 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:35,772 INFO L427 AbstractCegarLoop]: === Iteration 484 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:35,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:35,772 INFO L82 PathProgramCache]: Analyzing trace with hash -613123570, now seen corresponding path program 476 times [2020-02-10 19:50:35,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:35,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391472322] [2020-02-10 19:50:35,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:35,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:36,296 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 19:50:36,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:36,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391472322] [2020-02-10 19:50:36,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:36,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:50:36,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030353942] [2020-02-10 19:50:36,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:50:36,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:36,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:50:36,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:36,305 INFO L87 Difference]: Start difference. First operand 1571 states and 7028 transitions. Second operand 11 states. [2020-02-10 19:50:36,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:36,482 INFO L93 Difference]: Finished difference Result 2908 states and 11602 transitions. [2020-02-10 19:50:36,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:50:36,482 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:50:36,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:36,489 INFO L225 Difference]: With dead ends: 2908 [2020-02-10 19:50:36,490 INFO L226 Difference]: Without dead ends: 2890 [2020-02-10 19:50:36,490 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:50:36,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2890 states. [2020-02-10 19:50:36,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2890 to 1567. [2020-02-10 19:50:36,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 19:50:36,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7017 transitions. [2020-02-10 19:50:36,556 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7017 transitions. Word has length 28 [2020-02-10 19:50:36,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:36,556 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7017 transitions. [2020-02-10 19:50:36,556 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:50:36,556 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7017 transitions. [2020-02-10 19:50:36,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:50:36,558 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:36,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] [2020-02-10 19:50:36,558 INFO L427 AbstractCegarLoop]: === Iteration 485 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:36,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:36,559 INFO L82 PathProgramCache]: Analyzing trace with hash 374650852, now seen corresponding path program 477 times [2020-02-10 19:50:36,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:36,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598273753] [2020-02-10 19:50:36,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:36,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:37,090 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 19:50:37,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 19:50:37,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598273753] [2020-02-10 19:50:37,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:37,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:50:37,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913979276] [2020-02-10 19:50:37,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:50:37,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:37,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:50:37,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:37,098 INFO L87 Difference]: Start difference. First operand 1567 states and 7017 transitions. Second operand 11 states. [2020-02-10 19:50:37,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:37,273 INFO L93 Difference]: Finished difference Result 2918 states and 11625 transitions. [2020-02-10 19:50:37,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:50:37,273 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:50:37,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:37,280 INFO L225 Difference]: With dead ends: 2918 [2020-02-10 19:50:37,280 INFO L226 Difference]: Without dead ends: 2900 [2020-02-10 19:50:37,280 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:50:37,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2900 states. [2020-02-10 19:50:37,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2900 to 1574. [2020-02-10 19:50:37,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 19:50:37,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7030 transitions. [2020-02-10 19:50:37,348 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7030 transitions. Word has length 28 [2020-02-10 19:50:37,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:37,348 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7030 transitions. [2020-02-10 19:50:37,348 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:50:37,348 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7030 transitions. [2020-02-10 19:50:37,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:50:37,350 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:37,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] [2020-02-10 19:50:37,350 INFO L427 AbstractCegarLoop]: === Iteration 486 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:37,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:37,351 INFO L82 PathProgramCache]: Analyzing trace with hash -196803954, now seen corresponding path program 478 times [2020-02-10 19:50:37,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:37,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377260784] [2020-02-10 19:50:37,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:37,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:37,876 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 19:50:37,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 19:50:37,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377260784] [2020-02-10 19:50:37,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:37,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:50:37,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088816650] [2020-02-10 19:50:37,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:50:37,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:37,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:50:37,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:37,883 INFO L87 Difference]: Start difference. First operand 1574 states and 7030 transitions. Second operand 11 states. [2020-02-10 19:50:38,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:38,071 INFO L93 Difference]: Finished difference Result 2917 states and 11616 transitions. [2020-02-10 19:50:38,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:50:38,071 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:50:38,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:38,078 INFO L225 Difference]: With dead ends: 2917 [2020-02-10 19:50:38,078 INFO L226 Difference]: Without dead ends: 2893 [2020-02-10 19:50:38,079 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:50:38,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2893 states. [2020-02-10 19:50:38,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2893 to 1567. [2020-02-10 19:50:38,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 19:50:38,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7013 transitions. [2020-02-10 19:50:38,145 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7013 transitions. Word has length 28 [2020-02-10 19:50:38,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:38,145 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7013 transitions. [2020-02-10 19:50:38,146 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:50:38,146 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7013 transitions. [2020-02-10 19:50:38,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:50:38,148 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:38,148 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:38,148 INFO L427 AbstractCegarLoop]: === Iteration 487 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:38,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:38,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1148353372, now seen corresponding path program 479 times [2020-02-10 19:50:38,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:38,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581435773] [2020-02-10 19:50:38,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:38,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:38,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:38,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581435773] [2020-02-10 19:50:38,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:38,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:50:38,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102847792] [2020-02-10 19:50:38,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:50:38,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:38,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:50:38,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:38,673 INFO L87 Difference]: Start difference. First operand 1567 states and 7013 transitions. Second operand 11 states. [2020-02-10 19:50:38,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:38,864 INFO L93 Difference]: Finished difference Result 2907 states and 11596 transitions. [2020-02-10 19:50:38,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:50:38,865 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:50:38,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:38,872 INFO L225 Difference]: With dead ends: 2907 [2020-02-10 19:50:38,872 INFO L226 Difference]: Without dead ends: 2893 [2020-02-10 19:50:38,872 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:50:38,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2893 states. [2020-02-10 19:50:38,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2893 to 1571. [2020-02-10 19:50:38,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 19:50:38,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7020 transitions. [2020-02-10 19:50:38,940 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7020 transitions. Word has length 28 [2020-02-10 19:50:38,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:38,940 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7020 transitions. [2020-02-10 19:50:38,940 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:50:38,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7020 transitions. [2020-02-10 19:50:38,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:50:38,942 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:38,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] [2020-02-10 19:50:38,943 INFO L427 AbstractCegarLoop]: === Iteration 488 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:38,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:38,943 INFO L82 PathProgramCache]: Analyzing trace with hash 341051624, now seen corresponding path program 480 times [2020-02-10 19:50:38,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:38,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126779196] [2020-02-10 19:50:38,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:38,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:39,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:39,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126779196] [2020-02-10 19:50:39,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:39,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:50:39,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701889779] [2020-02-10 19:50:39,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:50:39,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:39,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:50:39,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:39,472 INFO L87 Difference]: Start difference. First operand 1571 states and 7020 transitions. Second operand 11 states. [2020-02-10 19:50:39,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:39,666 INFO L93 Difference]: Finished difference Result 2910 states and 11598 transitions. [2020-02-10 19:50:39,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:50:39,667 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:50:39,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:39,675 INFO L225 Difference]: With dead ends: 2910 [2020-02-10 19:50:39,675 INFO L226 Difference]: Without dead ends: 2877 [2020-02-10 19:50:39,675 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:50:39,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2877 states. [2020-02-10 19:50:39,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2877 to 1555. [2020-02-10 19:50:39,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1555 states. [2020-02-10 19:50:39,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 6988 transitions. [2020-02-10 19:50:39,744 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 6988 transitions. Word has length 28 [2020-02-10 19:50:39,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:39,744 INFO L479 AbstractCegarLoop]: Abstraction has 1555 states and 6988 transitions. [2020-02-10 19:50:39,744 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:50:39,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 6988 transitions. [2020-02-10 19:50:39,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:50:39,747 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:39,747 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:39,748 INFO L427 AbstractCegarLoop]: === Iteration 489 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:39,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:39,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1827506600, now seen corresponding path program 481 times [2020-02-10 19:50:39,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:39,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431281021] [2020-02-10 19:50:39,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:39,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:40,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 19:50:40,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431281021] [2020-02-10 19:50:40,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:40,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:50:40,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048569333] [2020-02-10 19:50:40,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:50:40,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:40,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:50:40,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:40,293 INFO L87 Difference]: Start difference. First operand 1555 states and 6988 transitions. Second operand 11 states. [2020-02-10 19:50:40,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:40,472 INFO L93 Difference]: Finished difference Result 2973 states and 11790 transitions. [2020-02-10 19:50:40,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:50:40,472 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:50:40,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:40,479 INFO L225 Difference]: With dead ends: 2973 [2020-02-10 19:50:40,479 INFO L226 Difference]: Without dead ends: 2958 [2020-02-10 19:50:40,479 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:50:40,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2958 states. [2020-02-10 19:50:40,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2958 to 1581. [2020-02-10 19:50:40,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 19:50:40,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7084 transitions. [2020-02-10 19:50:40,546 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7084 transitions. Word has length 28 [2020-02-10 19:50:40,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:40,547 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7084 transitions. [2020-02-10 19:50:40,547 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:50:40,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7084 transitions. [2020-02-10 19:50:40,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:50:40,549 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:40,549 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:40,549 INFO L427 AbstractCegarLoop]: === Iteration 490 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:40,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:40,549 INFO L82 PathProgramCache]: Analyzing trace with hash -978055700, now seen corresponding path program 482 times [2020-02-10 19:50:40,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:40,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528512559] [2020-02-10 19:50:40,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:40,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:41,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:41,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528512559] [2020-02-10 19:50:41,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:41,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:50:41,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871184880] [2020-02-10 19:50:41,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:50:41,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:41,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:50:41,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:41,090 INFO L87 Difference]: Start difference. First operand 1581 states and 7084 transitions. Second operand 11 states. [2020-02-10 19:50:41,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:41,221 INFO L93 Difference]: Finished difference Result 2978 states and 11794 transitions. [2020-02-10 19:50:41,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:50:41,222 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:50:41,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:41,229 INFO L225 Difference]: With dead ends: 2978 [2020-02-10 19:50:41,230 INFO L226 Difference]: Without dead ends: 2952 [2020-02-10 19:50:41,230 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:50:41,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2952 states. [2020-02-10 19:50:41,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2952 to 1575. [2020-02-10 19:50:41,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 19:50:41,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7067 transitions. [2020-02-10 19:50:41,297 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7067 transitions. Word has length 28 [2020-02-10 19:50:41,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:41,297 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7067 transitions. [2020-02-10 19:50:41,297 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:50:41,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7067 transitions. [2020-02-10 19:50:41,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:50:41,299 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:41,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] [2020-02-10 19:50:41,300 INFO L427 AbstractCegarLoop]: === Iteration 491 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:41,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:41,300 INFO L82 PathProgramCache]: Analyzing trace with hash -856519738, now seen corresponding path program 483 times [2020-02-10 19:50:41,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:41,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750357052] [2020-02-10 19:50:41,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:41,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:41,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:41,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750357052] [2020-02-10 19:50:41,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:41,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:50:41,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881292286] [2020-02-10 19:50:41,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:50:41,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:41,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:50:41,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:41,833 INFO L87 Difference]: Start difference. First operand 1575 states and 7067 transitions. Second operand 11 states. [2020-02-10 19:50:42,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:42,005 INFO L93 Difference]: Finished difference Result 2970 states and 11779 transitions. [2020-02-10 19:50:42,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:50:42,006 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:50:42,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:42,013 INFO L225 Difference]: With dead ends: 2970 [2020-02-10 19:50:42,013 INFO L226 Difference]: Without dead ends: 2955 [2020-02-10 19:50:42,013 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:50:42,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2955 states. [2020-02-10 19:50:42,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2955 to 1580. [2020-02-10 19:50:42,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 19:50:42,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7076 transitions. [2020-02-10 19:50:42,080 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7076 transitions. Word has length 28 [2020-02-10 19:50:42,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:42,081 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7076 transitions. [2020-02-10 19:50:42,081 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:50:42,081 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7076 transitions. [2020-02-10 19:50:42,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:50:42,083 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:42,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] [2020-02-10 19:50:42,083 INFO L427 AbstractCegarLoop]: === Iteration 492 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:42,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:42,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1377587756, now seen corresponding path program 484 times [2020-02-10 19:50:42,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:42,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724668371] [2020-02-10 19:50:42,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:42,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:42,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 19:50:42,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724668371] [2020-02-10 19:50:42,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:42,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:50:42,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550293904] [2020-02-10 19:50:42,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:50:42,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:42,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:50:42,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:42,614 INFO L87 Difference]: Start difference. First operand 1580 states and 7076 transitions. Second operand 11 states. [2020-02-10 19:50:42,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:42,797 INFO L93 Difference]: Finished difference Result 2973 states and 11780 transitions. [2020-02-10 19:50:42,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:50:42,798 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:50:42,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:42,805 INFO L225 Difference]: With dead ends: 2973 [2020-02-10 19:50:42,805 INFO L226 Difference]: Without dead ends: 2950 [2020-02-10 19:50:42,805 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:50:42,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2020-02-10 19:50:42,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 1575. [2020-02-10 19:50:42,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 19:50:42,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7062 transitions. [2020-02-10 19:50:42,872 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7062 transitions. Word has length 28 [2020-02-10 19:50:42,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:42,872 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7062 transitions. [2020-02-10 19:50:42,872 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:50:42,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7062 transitions. [2020-02-10 19:50:42,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:50:42,875 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:42,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] [2020-02-10 19:50:42,875 INFO L427 AbstractCegarLoop]: === Iteration 493 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:42,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:42,875 INFO L82 PathProgramCache]: Analyzing trace with hash -440200122, now seen corresponding path program 485 times [2020-02-10 19:50:42,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:42,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030490237] [2020-02-10 19:50:42,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:42,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:43,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:43,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030490237] [2020-02-10 19:50:43,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:43,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:50:43,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009371364] [2020-02-10 19:50:43,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:50:43,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:43,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:50:43,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:43,442 INFO L87 Difference]: Start difference. First operand 1575 states and 7062 transitions. Second operand 11 states. [2020-02-10 19:50:43,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:43,591 INFO L93 Difference]: Finished difference Result 2985 states and 11804 transitions. [2020-02-10 19:50:43,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:50:43,592 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:50:43,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:43,599 INFO L225 Difference]: With dead ends: 2985 [2020-02-10 19:50:43,599 INFO L226 Difference]: Without dead ends: 2965 [2020-02-10 19:50:43,599 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:50:43,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2965 states. [2020-02-10 19:50:43,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2965 to 1585. [2020-02-10 19:50:43,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1585 states. [2020-02-10 19:50:43,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 7079 transitions. [2020-02-10 19:50:43,666 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 7079 transitions. Word has length 28 [2020-02-10 19:50:43,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:43,666 INFO L479 AbstractCegarLoop]: Abstraction has 1585 states and 7079 transitions. [2020-02-10 19:50:43,666 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:50:43,666 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 7079 transitions. [2020-02-10 19:50:43,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:50:43,668 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:43,669 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:43,669 INFO L427 AbstractCegarLoop]: === Iteration 494 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:43,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:43,669 INFO L82 PathProgramCache]: Analyzing trace with hash 304502376, now seen corresponding path program 486 times [2020-02-10 19:50:43,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:43,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078573961] [2020-02-10 19:50:43,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:43,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:44,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 19:50:44,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078573961] [2020-02-10 19:50:44,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:44,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:50:44,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165962903] [2020-02-10 19:50:44,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:50:44,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:44,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:50:44,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:44,213 INFO L87 Difference]: Start difference. First operand 1585 states and 7079 transitions. Second operand 11 states. [2020-02-10 19:50:44,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:44,412 INFO L93 Difference]: Finished difference Result 2983 states and 11792 transitions. [2020-02-10 19:50:44,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:50:44,412 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:50:44,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:44,420 INFO L225 Difference]: With dead ends: 2983 [2020-02-10 19:50:44,420 INFO L226 Difference]: Without dead ends: 2948 [2020-02-10 19:50:44,420 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:50:44,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2948 states. [2020-02-10 19:50:44,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2948 to 1568. [2020-02-10 19:50:44,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 19:50:44,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7043 transitions. [2020-02-10 19:50:44,488 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7043 transitions. Word has length 28 [2020-02-10 19:50:44,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:44,488 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7043 transitions. [2020-02-10 19:50:44,488 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:50:44,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7043 transitions. [2020-02-10 19:50:44,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:50:44,490 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:44,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] [2020-02-10 19:50:44,490 INFO L427 AbstractCegarLoop]: === Iteration 495 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:44,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:44,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1321160334, now seen corresponding path program 487 times [2020-02-10 19:50:44,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:44,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168499119] [2020-02-10 19:50:44,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:44,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:45,022 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 31 [2020-02-10 19:50:45,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:45,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168499119] [2020-02-10 19:50:45,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:45,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:50:45,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828455911] [2020-02-10 19:50:45,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:50:45,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:45,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:50:45,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:45,030 INFO L87 Difference]: Start difference. First operand 1568 states and 7043 transitions. Second operand 11 states. [2020-02-10 19:50:45,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:45,207 INFO L93 Difference]: Finished difference Result 2961 states and 11754 transitions. [2020-02-10 19:50:45,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:50:45,207 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:50:45,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:45,214 INFO L225 Difference]: With dead ends: 2961 [2020-02-10 19:50:45,214 INFO L226 Difference]: Without dead ends: 2946 [2020-02-10 19:50:45,215 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:50:45,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2946 states. [2020-02-10 19:50:45,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2946 to 1579. [2020-02-10 19:50:45,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 19:50:45,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7072 transitions. [2020-02-10 19:50:45,281 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7072 transitions. Word has length 28 [2020-02-10 19:50:45,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:45,282 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7072 transitions. [2020-02-10 19:50:45,282 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:50:45,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7072 transitions. [2020-02-10 19:50:45,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:50:45,284 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:45,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] [2020-02-10 19:50:45,284 INFO L427 AbstractCegarLoop]: === Iteration 496 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:45,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:45,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1484401966, now seen corresponding path program 488 times [2020-02-10 19:50:45,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:45,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103862626] [2020-02-10 19:50:45,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:45,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:45,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:45,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103862626] [2020-02-10 19:50:45,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:45,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:50:45,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315785470] [2020-02-10 19:50:45,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:50:45,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:45,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:50:45,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:45,817 INFO L87 Difference]: Start difference. First operand 1579 states and 7072 transitions. Second operand 11 states. [2020-02-10 19:50:45,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:45,955 INFO L93 Difference]: Finished difference Result 2966 states and 11758 transitions. [2020-02-10 19:50:45,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:50:45,955 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:50:45,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:45,963 INFO L225 Difference]: With dead ends: 2966 [2020-02-10 19:50:45,963 INFO L226 Difference]: Without dead ends: 2940 [2020-02-10 19:50:45,963 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:50:46,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2940 states. [2020-02-10 19:50:46,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2940 to 1573. [2020-02-10 19:50:46,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 19:50:46,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7056 transitions. [2020-02-10 19:50:46,030 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7056 transitions. Word has length 28 [2020-02-10 19:50:46,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:46,030 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7056 transitions. [2020-02-10 19:50:46,030 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:50:46,030 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7056 transitions. [2020-02-10 19:50:46,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:50:46,032 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:46,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] [2020-02-10 19:50:46,033 INFO L427 AbstractCegarLoop]: === Iteration 497 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:46,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:46,033 INFO L82 PathProgramCache]: Analyzing trace with hash -825010426, now seen corresponding path program 489 times [2020-02-10 19:50:46,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:46,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918289567] [2020-02-10 19:50:46,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:46,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:46,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:46,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918289567] [2020-02-10 19:50:46,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:46,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:50:46,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548241628] [2020-02-10 19:50:46,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:50:46,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:46,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:50:46,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:46,569 INFO L87 Difference]: Start difference. First operand 1573 states and 7056 transitions. Second operand 11 states. [2020-02-10 19:50:46,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:46,746 INFO L93 Difference]: Finished difference Result 2953 states and 11733 transitions. [2020-02-10 19:50:46,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:50:46,747 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:50:46,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:46,754 INFO L225 Difference]: With dead ends: 2953 [2020-02-10 19:50:46,754 INFO L226 Difference]: Without dead ends: 2938 [2020-02-10 19:50:46,754 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:50:46,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2938 states. [2020-02-10 19:50:46,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2938 to 1577. [2020-02-10 19:50:46,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 19:50:46,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7063 transitions. [2020-02-10 19:50:46,821 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7063 transitions. Word has length 28 [2020-02-10 19:50:46,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:46,821 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7063 transitions. [2020-02-10 19:50:46,821 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:50:46,822 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7063 transitions. [2020-02-10 19:50:46,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:50:46,824 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:46,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] [2020-02-10 19:50:46,824 INFO L427 AbstractCegarLoop]: === Iteration 498 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:46,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:46,824 INFO L82 PathProgramCache]: Analyzing trace with hash -651762734, now seen corresponding path program 490 times [2020-02-10 19:50:46,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:46,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584725987] [2020-02-10 19:50:46,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:46,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:47,356 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 19:50:47,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:47,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584725987] [2020-02-10 19:50:47,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:47,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:50:47,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201158442] [2020-02-10 19:50:47,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:50:47,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:47,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:50:47,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:47,364 INFO L87 Difference]: Start difference. First operand 1577 states and 7063 transitions. Second operand 11 states. [2020-02-10 19:50:47,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:47,568 INFO L93 Difference]: Finished difference Result 2952 states and 11727 transitions. [2020-02-10 19:50:47,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:50:47,568 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:50:47,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:47,575 INFO L225 Difference]: With dead ends: 2952 [2020-02-10 19:50:47,575 INFO L226 Difference]: Without dead ends: 2934 [2020-02-10 19:50:47,575 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:50:47,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2934 states. [2020-02-10 19:50:47,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2934 to 1573. [2020-02-10 19:50:47,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 19:50:47,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7052 transitions. [2020-02-10 19:50:47,642 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7052 transitions. Word has length 28 [2020-02-10 19:50:47,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:47,643 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7052 transitions. [2020-02-10 19:50:47,643 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:50:47,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7052 transitions. [2020-02-10 19:50:47,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:50:47,645 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:47,645 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:47,645 INFO L427 AbstractCegarLoop]: === Iteration 499 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:47,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:47,645 INFO L82 PathProgramCache]: Analyzing trace with hash -408690810, now seen corresponding path program 491 times [2020-02-10 19:50:47,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:47,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020572339] [2020-02-10 19:50:47,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:47,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:48,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:48,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020572339] [2020-02-10 19:50:48,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:48,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:50:48,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401919272] [2020-02-10 19:50:48,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:50:48,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:48,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:50:48,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:48,182 INFO L87 Difference]: Start difference. First operand 1573 states and 7052 transitions. Second operand 11 states. [2020-02-10 19:50:48,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:48,320 INFO L93 Difference]: Finished difference Result 2964 states and 11749 transitions. [2020-02-10 19:50:48,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:50:48,320 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:50:48,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:48,327 INFO L225 Difference]: With dead ends: 2964 [2020-02-10 19:50:48,327 INFO L226 Difference]: Without dead ends: 2944 [2020-02-10 19:50:48,327 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:50:48,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2944 states. [2020-02-10 19:50:48,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2944 to 1578. [2020-02-10 19:50:48,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 19:50:48,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7060 transitions. [2020-02-10 19:50:48,394 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7060 transitions. Word has length 28 [2020-02-10 19:50:48,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:48,394 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7060 transitions. [2020-02-10 19:50:48,394 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:50:48,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7060 transitions. [2020-02-10 19:50:48,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:50:48,396 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:48,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] [2020-02-10 19:50:48,397 INFO L427 AbstractCegarLoop]: === Iteration 500 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:48,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:48,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1724848114, now seen corresponding path program 492 times [2020-02-10 19:50:48,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:48,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065585796] [2020-02-10 19:50:48,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:48,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:48,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 19:50:48,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065585796] [2020-02-10 19:50:48,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:48,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:50:48,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320025043] [2020-02-10 19:50:48,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:50:48,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:48,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:50:48,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:48,922 INFO L87 Difference]: Start difference. First operand 1578 states and 7060 transitions. Second operand 11 states. [2020-02-10 19:50:49,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:49,112 INFO L93 Difference]: Finished difference Result 2958 states and 11733 transitions. [2020-02-10 19:50:49,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:50:49,113 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:50:49,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:49,120 INFO L225 Difference]: With dead ends: 2958 [2020-02-10 19:50:49,120 INFO L226 Difference]: Without dead ends: 2934 [2020-02-10 19:50:49,120 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:50:49,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2934 states. [2020-02-10 19:50:49,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2934 to 1568. [2020-02-10 19:50:49,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 19:50:49,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7038 transitions. [2020-02-10 19:50:49,206 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7038 transitions. Word has length 28 [2020-02-10 19:50:49,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:49,206 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7038 transitions. [2020-02-10 19:50:49,206 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:50:49,206 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7038 transitions. [2020-02-10 19:50:49,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:50:49,208 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:49,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] [2020-02-10 19:50:49,208 INFO L427 AbstractCegarLoop]: === Iteration 501 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:49,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:49,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1331663438, now seen corresponding path program 493 times [2020-02-10 19:50:49,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:49,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319551549] [2020-02-10 19:50:49,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:49,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:49,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:49,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319551549] [2020-02-10 19:50:49,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:49,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:50:49,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485054589] [2020-02-10 19:50:49,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:50:49,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:49,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:50:49,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:49,733 INFO L87 Difference]: Start difference. First operand 1568 states and 7038 transitions. Second operand 11 states. [2020-02-10 19:50:49,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:49,902 INFO L93 Difference]: Finished difference Result 2953 states and 11734 transitions. [2020-02-10 19:50:49,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:50:49,903 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:50:49,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:49,910 INFO L225 Difference]: With dead ends: 2953 [2020-02-10 19:50:49,910 INFO L226 Difference]: Without dead ends: 2938 [2020-02-10 19:50:49,910 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:50:49,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2938 states. [2020-02-10 19:50:49,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2938 to 1577. [2020-02-10 19:50:49,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 19:50:49,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7062 transitions. [2020-02-10 19:50:49,981 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7062 transitions. Word has length 28 [2020-02-10 19:50:49,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:49,981 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7062 transitions. [2020-02-10 19:50:49,981 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:50:49,981 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7062 transitions. [2020-02-10 19:50:49,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:50:49,983 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:49,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] [2020-02-10 19:50:49,984 INFO L427 AbstractCegarLoop]: === Iteration 502 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:49,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:49,984 INFO L82 PathProgramCache]: Analyzing trace with hash -729196364, now seen corresponding path program 494 times [2020-02-10 19:50:49,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:49,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216442868] [2020-02-10 19:50:49,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:49,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:50,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:50,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216442868] [2020-02-10 19:50:50,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:50,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:50:50,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726142942] [2020-02-10 19:50:50,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:50:50,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:50,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:50:50,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:50,522 INFO L87 Difference]: Start difference. First operand 1577 states and 7062 transitions. Second operand 11 states. [2020-02-10 19:50:50,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:50,700 INFO L93 Difference]: Finished difference Result 2956 states and 11735 transitions. [2020-02-10 19:50:50,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:50:50,700 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:50:50,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:50,707 INFO L225 Difference]: With dead ends: 2956 [2020-02-10 19:50:50,707 INFO L226 Difference]: Without dead ends: 2933 [2020-02-10 19:50:50,707 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:50:50,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2933 states. [2020-02-10 19:50:50,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2933 to 1572. [2020-02-10 19:50:50,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 19:50:50,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7049 transitions. [2020-02-10 19:50:50,774 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7049 transitions. Word has length 28 [2020-02-10 19:50:50,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:50,775 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7049 transitions. [2020-02-10 19:50:50,775 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:50:50,775 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7049 transitions. [2020-02-10 19:50:50,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:50:50,777 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:50,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] [2020-02-10 19:50:50,777 INFO L427 AbstractCegarLoop]: === Iteration 503 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:50,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:50,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1869519016, now seen corresponding path program 495 times [2020-02-10 19:50:50,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:50,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530900227] [2020-02-10 19:50:50,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:50,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:51,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 19:50:51,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530900227] [2020-02-10 19:50:51,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:51,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:50:51,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237174505] [2020-02-10 19:50:51,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:50:51,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:51,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:50:51,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:51,308 INFO L87 Difference]: Start difference. First operand 1572 states and 7049 transitions. Second operand 11 states. [2020-02-10 19:50:51,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:51,483 INFO L93 Difference]: Finished difference Result 2948 states and 11719 transitions. [2020-02-10 19:50:51,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:50:51,483 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:50:51,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:51,491 INFO L225 Difference]: With dead ends: 2948 [2020-02-10 19:50:51,491 INFO L226 Difference]: Without dead ends: 2933 [2020-02-10 19:50:51,491 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:50:51,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2933 states. [2020-02-10 19:50:51,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2933 to 1576. [2020-02-10 19:50:51,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 19:50:51,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7056 transitions. [2020-02-10 19:50:51,558 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7056 transitions. Word has length 28 [2020-02-10 19:50:51,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:51,558 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7056 transitions. [2020-02-10 19:50:51,558 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:50:51,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7056 transitions. [2020-02-10 19:50:51,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:50:51,561 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:51,561 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:51,561 INFO L427 AbstractCegarLoop]: === Iteration 504 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:51,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:51,561 INFO L82 PathProgramCache]: Analyzing trace with hash 2042766708, now seen corresponding path program 496 times [2020-02-10 19:50:51,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:51,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299218431] [2020-02-10 19:50:51,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:51,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:52,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:52,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299218431] [2020-02-10 19:50:52,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:52,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:50:52,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829540305] [2020-02-10 19:50:52,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:50:52,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:52,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:50:52,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:52,090 INFO L87 Difference]: Start difference. First operand 1576 states and 7056 transitions. Second operand 11 states. [2020-02-10 19:50:52,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:52,273 INFO L93 Difference]: Finished difference Result 2947 states and 11713 transitions. [2020-02-10 19:50:52,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:50:52,274 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:50:52,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:52,281 INFO L225 Difference]: With dead ends: 2947 [2020-02-10 19:50:52,281 INFO L226 Difference]: Without dead ends: 2929 [2020-02-10 19:50:52,282 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:50:52,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2929 states. [2020-02-10 19:50:52,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2929 to 1572. [2020-02-10 19:50:52,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 19:50:52,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7045 transitions. [2020-02-10 19:50:52,349 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7045 transitions. Word has length 28 [2020-02-10 19:50:52,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:52,349 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7045 transitions. [2020-02-10 19:50:52,349 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:50:52,349 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7045 transitions. [2020-02-10 19:50:52,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:50:52,352 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:52,352 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:52,352 INFO L427 AbstractCegarLoop]: === Iteration 505 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:52,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:52,352 INFO L82 PathProgramCache]: Analyzing trace with hash 346514792, now seen corresponding path program 497 times [2020-02-10 19:50:52,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:52,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069077384] [2020-02-10 19:50:52,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:52,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:52,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:52,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069077384] [2020-02-10 19:50:52,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:52,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:50:52,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010528316] [2020-02-10 19:50:52,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:50:52,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:52,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:50:52,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:52,867 INFO L87 Difference]: Start difference. First operand 1572 states and 7045 transitions. Second operand 11 states. [2020-02-10 19:50:53,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:53,059 INFO L93 Difference]: Finished difference Result 2954 states and 11727 transitions. [2020-02-10 19:50:53,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:50:53,059 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:50:53,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:53,066 INFO L225 Difference]: With dead ends: 2954 [2020-02-10 19:50:53,066 INFO L226 Difference]: Without dead ends: 2936 [2020-02-10 19:50:53,066 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:50:53,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2936 states. [2020-02-10 19:50:53,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2936 to 1576. [2020-02-10 19:50:53,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 19:50:53,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7052 transitions. [2020-02-10 19:50:53,133 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7052 transitions. Word has length 28 [2020-02-10 19:50:53,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:53,133 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7052 transitions. [2020-02-10 19:50:53,133 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:50:53,134 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7052 transitions. [2020-02-10 19:50:53,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:50:53,136 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50: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] [2020-02-10 19:50:53,136 INFO L427 AbstractCegarLoop]: === Iteration 506 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:53,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:53,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1714345010, now seen corresponding path program 498 times [2020-02-10 19:50:53,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:53,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448954813] [2020-02-10 19:50:53,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:53,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:53,663 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 19:50:53,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:53,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448954813] [2020-02-10 19:50:53,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:53,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:50:53,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157732864] [2020-02-10 19:50:53,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:50:53,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:53,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:50:53,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:53,671 INFO L87 Difference]: Start difference. First operand 1576 states and 7052 transitions. Second operand 11 states. [2020-02-10 19:50:53,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:53,844 INFO L93 Difference]: Finished difference Result 2950 states and 11715 transitions. [2020-02-10 19:50:53,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:50:53,845 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:50:53,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:53,852 INFO L225 Difference]: With dead ends: 2950 [2020-02-10 19:50:53,852 INFO L226 Difference]: Without dead ends: 2928 [2020-02-10 19:50:53,852 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:50:53,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2928 states. [2020-02-10 19:50:53,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2928 to 1568. [2020-02-10 19:50:53,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 19:50:53,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7034 transitions. [2020-02-10 19:50:53,919 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7034 transitions. Word has length 28 [2020-02-10 19:50:53,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:53,919 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7034 transitions. [2020-02-10 19:50:53,919 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:50:53,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7034 transitions. [2020-02-10 19:50:53,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:50:53,922 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:53,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] [2020-02-10 19:50:53,922 INFO L427 AbstractCegarLoop]: === Iteration 507 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:53,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:53,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1452892654, now seen corresponding path program 499 times [2020-02-10 19:50:53,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:53,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974570677] [2020-02-10 19:50:53,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:53,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:54,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 19:50:54,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974570677] [2020-02-10 19:50:54,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:54,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:50:54,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183640388] [2020-02-10 19:50:54,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:50:54,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:54,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:50:54,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:54,481 INFO L87 Difference]: Start difference. First operand 1568 states and 7034 transitions. Second operand 11 states. [2020-02-10 19:50:54,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:54,617 INFO L93 Difference]: Finished difference Result 2981 states and 11788 transitions. [2020-02-10 19:50:54,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:50:54,618 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:50:54,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:54,625 INFO L225 Difference]: With dead ends: 2981 [2020-02-10 19:50:54,626 INFO L226 Difference]: Without dead ends: 2961 [2020-02-10 19:50:54,626 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:50:54,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2961 states. [2020-02-10 19:50:54,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2961 to 1584. [2020-02-10 19:50:54,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1584 states. [2020-02-10 19:50:54,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 7071 transitions. [2020-02-10 19:50:54,719 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 7071 transitions. Word has length 28 [2020-02-10 19:50:54,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:54,719 INFO L479 AbstractCegarLoop]: Abstraction has 1584 states and 7071 transitions. [2020-02-10 19:50:54,719 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:50:54,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 7071 transitions. [2020-02-10 19:50:54,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:50:54,721 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:54,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] [2020-02-10 19:50:54,722 INFO L427 AbstractCegarLoop]: === Iteration 508 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:54,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:54,722 INFO L82 PathProgramCache]: Analyzing trace with hash -708190156, now seen corresponding path program 500 times [2020-02-10 19:50:54,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:54,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240135610] [2020-02-10 19:50:54,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:54,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:55,258 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 19:50:55,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 19:50:55,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240135610] [2020-02-10 19:50:55,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:55,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:50:55,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457284701] [2020-02-10 19:50:55,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:50:55,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:55,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:50:55,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:55,266 INFO L87 Difference]: Start difference. First operand 1584 states and 7071 transitions. Second operand 11 states. [2020-02-10 19:50:55,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:55,433 INFO L93 Difference]: Finished difference Result 2979 states and 11776 transitions. [2020-02-10 19:50:55,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:50:55,433 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:50:55,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:55,440 INFO L225 Difference]: With dead ends: 2979 [2020-02-10 19:50:55,440 INFO L226 Difference]: Without dead ends: 2951 [2020-02-10 19:50:55,440 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:50:55,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2020-02-10 19:50:55,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 1574. [2020-02-10 19:50:55,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 19:50:55,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7048 transitions. [2020-02-10 19:50:55,508 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7048 transitions. Word has length 28 [2020-02-10 19:50:55,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:55,508 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7048 transitions. [2020-02-10 19:50:55,508 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:50:55,509 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7048 transitions. [2020-02-10 19:50:55,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:50:55,511 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50: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] [2020-02-10 19:50:55,511 INFO L427 AbstractCegarLoop]: === Iteration 509 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:55,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:55,511 INFO L82 PathProgramCache]: Analyzing trace with hash -915037076, now seen corresponding path program 501 times [2020-02-10 19:50:55,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:55,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272125292] [2020-02-10 19:50:55,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:55,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:56,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:56,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272125292] [2020-02-10 19:50:56,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:56,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:50:56,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455710686] [2020-02-10 19:50:56,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:50:56,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:56,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:50:56,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:56,033 INFO L87 Difference]: Start difference. First operand 1574 states and 7048 transitions. Second operand 11 states. [2020-02-10 19:50:56,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:56,171 INFO L93 Difference]: Finished difference Result 2972 states and 11761 transitions. [2020-02-10 19:50:56,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:50:56,171 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:50:56,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:56,179 INFO L225 Difference]: With dead ends: 2972 [2020-02-10 19:50:56,179 INFO L226 Difference]: Without dead ends: 2952 [2020-02-10 19:50:56,179 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:50:56,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2952 states. [2020-02-10 19:50:56,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2952 to 1579. [2020-02-10 19:50:56,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 19:50:56,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7056 transitions. [2020-02-10 19:50:56,247 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7056 transitions. Word has length 28 [2020-02-10 19:50:56,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:56,247 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7056 transitions. [2020-02-10 19:50:56,247 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:50:56,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7056 transitions. [2020-02-10 19:50:56,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:50:56,249 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:56,249 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:56,249 INFO L427 AbstractCegarLoop]: === Iteration 510 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:56,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:56,250 INFO L82 PathProgramCache]: Analyzing trace with hash 2063772916, now seen corresponding path program 502 times [2020-02-10 19:50:56,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:56,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844698476] [2020-02-10 19:50:56,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:56,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:56,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 19:50:56,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844698476] [2020-02-10 19:50:56,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:56,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:50:56,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669693503] [2020-02-10 19:50:56,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:50:56,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:56,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:50:56,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:56,764 INFO L87 Difference]: Start difference. First operand 1579 states and 7056 transitions. Second operand 11 states. [2020-02-10 19:50:56,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:56,935 INFO L93 Difference]: Finished difference Result 2966 states and 11745 transitions. [2020-02-10 19:50:56,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:50:56,935 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:50:56,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:56,942 INFO L225 Difference]: With dead ends: 2966 [2020-02-10 19:50:56,943 INFO L226 Difference]: Without dead ends: 2947 [2020-02-10 19:50:56,943 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:50:56,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2947 states. [2020-02-10 19:50:57,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2947 to 1574. [2020-02-10 19:50:57,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 19:50:57,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7043 transitions. [2020-02-10 19:50:57,009 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7043 transitions. Word has length 28 [2020-02-10 19:50:57,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:57,010 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7043 transitions. [2020-02-10 19:50:57,010 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:50:57,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7043 transitions. [2020-02-10 19:50:57,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:50:57,012 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:57,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] [2020-02-10 19:50:57,012 INFO L427 AbstractCegarLoop]: === Iteration 511 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:57,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:57,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1440606380, now seen corresponding path program 503 times [2020-02-10 19:50:57,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:57,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946101467] [2020-02-10 19:50:57,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:57,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:57,536 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 19:50:57,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:57,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946101467] [2020-02-10 19:50:57,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:57,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:50:57,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513432783] [2020-02-10 19:50:57,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:50:57,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:57,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:50:57,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:57,545 INFO L87 Difference]: Start difference. First operand 1574 states and 7043 transitions. Second operand 11 states. [2020-02-10 19:50:57,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:57,727 INFO L93 Difference]: Finished difference Result 2967 states and 11748 transitions. [2020-02-10 19:50:57,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:50:57,727 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:50:57,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:57,734 INFO L225 Difference]: With dead ends: 2967 [2020-02-10 19:50:57,734 INFO L226 Difference]: Without dead ends: 2949 [2020-02-10 19:50:57,735 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:50:57,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2949 states. [2020-02-10 19:50:57,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2949 to 1578. [2020-02-10 19:50:57,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 19:50:57,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7050 transitions. [2020-02-10 19:50:57,802 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7050 transitions. Word has length 28 [2020-02-10 19:50:57,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:57,802 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7050 transitions. [2020-02-10 19:50:57,802 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:50:57,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7050 transitions. [2020-02-10 19:50:57,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:50:57,804 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:57,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] [2020-02-10 19:50:57,805 INFO L427 AbstractCegarLoop]: === Iteration 512 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:57,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:57,805 INFO L82 PathProgramCache]: Analyzing trace with hash -620253422, now seen corresponding path program 504 times [2020-02-10 19:50:57,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:57,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570262181] [2020-02-10 19:50:57,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:57,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:58,328 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 19:50:58,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:58,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570262181] [2020-02-10 19:50:58,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:58,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:50:58,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738048286] [2020-02-10 19:50:58,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:50:58,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:58,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:50:58,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:58,338 INFO L87 Difference]: Start difference. First operand 1578 states and 7050 transitions. Second operand 11 states. [2020-02-10 19:50:58,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:58,524 INFO L93 Difference]: Finished difference Result 2963 states and 11736 transitions. [2020-02-10 19:50:58,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:50:58,525 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:50:58,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:58,532 INFO L225 Difference]: With dead ends: 2963 [2020-02-10 19:50:58,532 INFO L226 Difference]: Without dead ends: 2933 [2020-02-10 19:50:58,533 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:50:58,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2933 states. [2020-02-10 19:50:58,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2933 to 1562. [2020-02-10 19:50:58,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1562 states. [2020-02-10 19:50:58,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1562 states to 1562 states and 7017 transitions. [2020-02-10 19:50:58,602 INFO L78 Accepts]: Start accepts. Automaton has 1562 states and 7017 transitions. Word has length 28 [2020-02-10 19:50:58,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:58,602 INFO L479 AbstractCegarLoop]: Abstraction has 1562 states and 7017 transitions. [2020-02-10 19:50:58,602 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:50:58,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1562 states and 7017 transitions. [2020-02-10 19:50:58,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:50:58,604 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:58,604 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:50:58,604 INFO L427 AbstractCegarLoop]: === Iteration 513 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:58,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:58,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1384607460, now seen corresponding path program 505 times [2020-02-10 19:50:58,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:58,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093513561] [2020-02-10 19:50:58,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:58,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:59,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:50:59,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093513561] [2020-02-10 19:50:59,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:59,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:50:59,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356023742] [2020-02-10 19:50:59,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:50:59,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:59,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:50:59,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:59,138 INFO L87 Difference]: Start difference. First operand 1562 states and 7017 transitions. Second operand 11 states. [2020-02-10 19:50:59,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:50:59,337 INFO L93 Difference]: Finished difference Result 2991 states and 11839 transitions. [2020-02-10 19:50:59,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:50:59,337 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:50:59,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:50:59,344 INFO L225 Difference]: With dead ends: 2991 [2020-02-10 19:50:59,345 INFO L226 Difference]: Without dead ends: 2976 [2020-02-10 19:50:59,345 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:50:59,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2976 states. [2020-02-10 19:50:59,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2976 to 1583. [2020-02-10 19:50:59,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 19:50:59,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7085 transitions. [2020-02-10 19:50:59,414 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7085 transitions. Word has length 28 [2020-02-10 19:50:59,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:50:59,415 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7085 transitions. [2020-02-10 19:50:59,415 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:50:59,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7085 transitions. [2020-02-10 19:50:59,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:50:59,417 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:50:59,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] [2020-02-10 19:50:59,417 INFO L427 AbstractCegarLoop]: === Iteration 514 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:50:59,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:50:59,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1420954840, now seen corresponding path program 506 times [2020-02-10 19:50:59,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:50:59,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136443086] [2020-02-10 19:50:59,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:50:59,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:50:59,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 19:50:59,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136443086] [2020-02-10 19:50:59,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:50:59,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:50:59,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779183861] [2020-02-10 19:50:59,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:50:59,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:50:59,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:50:59,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:50:59,951 INFO L87 Difference]: Start difference. First operand 1583 states and 7085 transitions. Second operand 11 states. [2020-02-10 19:51:00,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:00,093 INFO L93 Difference]: Finished difference Result 2996 states and 11843 transitions. [2020-02-10 19:51:00,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:51:00,093 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:51:00,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:00,101 INFO L225 Difference]: With dead ends: 2996 [2020-02-10 19:51:00,101 INFO L226 Difference]: Without dead ends: 2970 [2020-02-10 19:51:00,101 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:51:00,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2970 states. [2020-02-10 19:51:00,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2970 to 1577. [2020-02-10 19:51:00,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 19:51:00,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7068 transitions. [2020-02-10 19:51:00,172 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7068 transitions. Word has length 28 [2020-02-10 19:51:00,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:00,173 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7068 transitions. [2020-02-10 19:51:00,173 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:51:00,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7068 transitions. [2020-02-10 19:51:00,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:51:00,175 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:00,175 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:00,175 INFO L427 AbstractCegarLoop]: === Iteration 515 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:00,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:00,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1299418878, now seen corresponding path program 507 times [2020-02-10 19:51:00,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:00,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627215574] [2020-02-10 19:51:00,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:00,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:00,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 19:51:00,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627215574] [2020-02-10 19:51:00,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:00,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:51:00,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784732916] [2020-02-10 19:51:00,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:51:00,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:00,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:51:00,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:00,720 INFO L87 Difference]: Start difference. First operand 1577 states and 7068 transitions. Second operand 11 states. [2020-02-10 19:51:00,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:00,929 INFO L93 Difference]: Finished difference Result 2988 states and 11828 transitions. [2020-02-10 19:51:00,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:51:00,930 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:51:00,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:00,937 INFO L225 Difference]: With dead ends: 2988 [2020-02-10 19:51:00,938 INFO L226 Difference]: Without dead ends: 2973 [2020-02-10 19:51:00,938 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:51:00,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2973 states. [2020-02-10 19:51:01,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2973 to 1582. [2020-02-10 19:51:01,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2020-02-10 19:51:01,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 7077 transitions. [2020-02-10 19:51:01,005 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 7077 transitions. Word has length 28 [2020-02-10 19:51:01,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:01,006 INFO L479 AbstractCegarLoop]: Abstraction has 1582 states and 7077 transitions. [2020-02-10 19:51:01,006 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:51:01,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 7077 transitions. [2020-02-10 19:51:01,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:51:01,008 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:01,008 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:01,008 INFO L427 AbstractCegarLoop]: === Iteration 516 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:01,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:01,008 INFO L82 PathProgramCache]: Analyzing trace with hash 934688616, now seen corresponding path program 508 times [2020-02-10 19:51:01,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:01,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882918844] [2020-02-10 19:51:01,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:01,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:01,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:01,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882918844] [2020-02-10 19:51:01,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:01,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:51:01,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750213128] [2020-02-10 19:51:01,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:51:01,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:01,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:51:01,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:01,543 INFO L87 Difference]: Start difference. First operand 1582 states and 7077 transitions. Second operand 11 states. [2020-02-10 19:51:01,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:01,755 INFO L93 Difference]: Finished difference Result 2991 states and 11829 transitions. [2020-02-10 19:51:01,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:51:01,755 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:51:01,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:01,763 INFO L225 Difference]: With dead ends: 2991 [2020-02-10 19:51:01,763 INFO L226 Difference]: Without dead ends: 2968 [2020-02-10 19:51:01,763 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:51:01,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2968 states. [2020-02-10 19:51:01,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2968 to 1577. [2020-02-10 19:51:01,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 19:51:01,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7063 transitions. [2020-02-10 19:51:01,831 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7063 transitions. Word has length 28 [2020-02-10 19:51:01,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:01,831 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7063 transitions. [2020-02-10 19:51:01,831 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:51:01,831 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7063 transitions. [2020-02-10 19:51:01,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:51:01,833 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:01,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] [2020-02-10 19:51:01,833 INFO L427 AbstractCegarLoop]: === Iteration 517 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:01,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:01,834 INFO L82 PathProgramCache]: Analyzing trace with hash -883099262, now seen corresponding path program 509 times [2020-02-10 19:51:01,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:01,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833414609] [2020-02-10 19:51:01,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:01,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:02,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 19:51:02,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833414609] [2020-02-10 19:51:02,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:02,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:51:02,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677560953] [2020-02-10 19:51:02,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:51:02,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:02,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:51:02,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:02,385 INFO L87 Difference]: Start difference. First operand 1577 states and 7063 transitions. Second operand 11 states. [2020-02-10 19:51:02,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:02,608 INFO L93 Difference]: Finished difference Result 3003 states and 11853 transitions. [2020-02-10 19:51:02,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:51:02,608 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:51:02,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:02,616 INFO L225 Difference]: With dead ends: 3003 [2020-02-10 19:51:02,616 INFO L226 Difference]: Without dead ends: 2983 [2020-02-10 19:51:02,616 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:51:02,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2983 states. [2020-02-10 19:51:02,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2983 to 1587. [2020-02-10 19:51:02,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1587 states. [2020-02-10 19:51:02,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 7080 transitions. [2020-02-10 19:51:02,684 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 7080 transitions. Word has length 28 [2020-02-10 19:51:02,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:02,684 INFO L479 AbstractCegarLoop]: Abstraction has 1587 states and 7080 transitions. [2020-02-10 19:51:02,684 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:51:02,684 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 7080 transitions. [2020-02-10 19:51:02,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:51:02,686 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:02,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] [2020-02-10 19:51:02,686 INFO L427 AbstractCegarLoop]: === Iteration 518 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:02,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:02,687 INFO L82 PathProgramCache]: Analyzing trace with hash -138396764, now seen corresponding path program 510 times [2020-02-10 19:51:02,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:02,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295266430] [2020-02-10 19:51:02,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:02,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:03,126 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 30 [2020-02-10 19:51:03,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 19:51:03,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295266430] [2020-02-10 19:51:03,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:03,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:51:03,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002467388] [2020-02-10 19:51:03,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:51:03,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:03,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:51:03,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:03,247 INFO L87 Difference]: Start difference. First operand 1587 states and 7080 transitions. Second operand 11 states. [2020-02-10 19:51:03,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:03,489 INFO L93 Difference]: Finished difference Result 3001 states and 11841 transitions. [2020-02-10 19:51:03,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:51:03,489 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:51:03,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:03,497 INFO L225 Difference]: With dead ends: 3001 [2020-02-10 19:51:03,497 INFO L226 Difference]: Without dead ends: 2966 [2020-02-10 19:51:03,497 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:51:03,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2966 states. [2020-02-10 19:51:03,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2966 to 1570. [2020-02-10 19:51:03,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 19:51:03,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7043 transitions. [2020-02-10 19:51:03,564 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7043 transitions. Word has length 28 [2020-02-10 19:51:03,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:03,564 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7043 transitions. [2020-02-10 19:51:03,564 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:51:03,564 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7043 transitions. [2020-02-10 19:51:03,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:51:03,566 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:03,566 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:03,566 INFO L427 AbstractCegarLoop]: === Iteration 519 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:03,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:03,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1972352782, now seen corresponding path program 511 times [2020-02-10 19:51:03,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:03,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796776214] [2020-02-10 19:51:03,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:03,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:04,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 19:51:04,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796776214] [2020-02-10 19:51:04,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:04,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:51:04,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278419747] [2020-02-10 19:51:04,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:51:04,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:04,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:51:04,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:04,085 INFO L87 Difference]: Start difference. First operand 1570 states and 7043 transitions. Second operand 11 states. [2020-02-10 19:51:04,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:04,283 INFO L93 Difference]: Finished difference Result 2987 states and 11824 transitions. [2020-02-10 19:51:04,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:51:04,284 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:51:04,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:04,291 INFO L225 Difference]: With dead ends: 2987 [2020-02-10 19:51:04,292 INFO L226 Difference]: Without dead ends: 2972 [2020-02-10 19:51:04,292 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:51:04,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2972 states. [2020-02-10 19:51:04,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2972 to 1582. [2020-02-10 19:51:04,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2020-02-10 19:51:04,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 7076 transitions. [2020-02-10 19:51:04,359 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 7076 transitions. Word has length 28 [2020-02-10 19:51:04,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:04,359 INFO L479 AbstractCegarLoop]: Abstraction has 1582 states and 7076 transitions. [2020-02-10 19:51:04,359 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:51:04,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 7076 transitions. [2020-02-10 19:51:04,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:51:04,361 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:04,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] [2020-02-10 19:51:04,362 INFO L427 AbstractCegarLoop]: === Iteration 520 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:04,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:04,362 INFO L82 PathProgramCache]: Analyzing trace with hash -833209518, now seen corresponding path program 512 times [2020-02-10 19:51:04,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:04,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906422767] [2020-02-10 19:51:04,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:04,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:04,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:04,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906422767] [2020-02-10 19:51:04,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:04,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:51:04,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98988156] [2020-02-10 19:51:04,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:51:04,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:04,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:51:04,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:04,907 INFO L87 Difference]: Start difference. First operand 1582 states and 7076 transitions. Second operand 11 states. [2020-02-10 19:51:05,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:05,082 INFO L93 Difference]: Finished difference Result 2992 states and 11828 transitions. [2020-02-10 19:51:05,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:51:05,083 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:51:05,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:05,090 INFO L225 Difference]: With dead ends: 2992 [2020-02-10 19:51:05,091 INFO L226 Difference]: Without dead ends: 2966 [2020-02-10 19:51:05,091 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:51:05,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2966 states. [2020-02-10 19:51:05,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2966 to 1576. [2020-02-10 19:51:05,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 19:51:05,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7059 transitions. [2020-02-10 19:51:05,157 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7059 transitions. Word has length 28 [2020-02-10 19:51:05,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:05,158 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7059 transitions. [2020-02-10 19:51:05,158 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:51:05,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7059 transitions. [2020-02-10 19:51:05,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:51:05,160 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:05,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] [2020-02-10 19:51:05,160 INFO L427 AbstractCegarLoop]: === Iteration 521 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:05,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:05,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1246903358, now seen corresponding path program 513 times [2020-02-10 19:51:05,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:05,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085650854] [2020-02-10 19:51:05,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:05,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:05,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:05,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085650854] [2020-02-10 19:51:05,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:05,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:51:05,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154934797] [2020-02-10 19:51:05,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:51:05,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:05,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:51:05,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:05,687 INFO L87 Difference]: Start difference. First operand 1576 states and 7059 transitions. Second operand 11 states. [2020-02-10 19:51:05,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:05,870 INFO L93 Difference]: Finished difference Result 2983 states and 11811 transitions. [2020-02-10 19:51:05,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:51:05,870 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:51:05,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:05,877 INFO L225 Difference]: With dead ends: 2983 [2020-02-10 19:51:05,877 INFO L226 Difference]: Without dead ends: 2968 [2020-02-10 19:51:05,877 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:51:05,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2968 states. [2020-02-10 19:51:05,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2968 to 1581. [2020-02-10 19:51:05,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 19:51:05,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7068 transitions. [2020-02-10 19:51:05,944 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7068 transitions. Word has length 28 [2020-02-10 19:51:05,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:05,944 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7068 transitions. [2020-02-10 19:51:05,944 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:51:05,944 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7068 transitions. [2020-02-10 19:51:05,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:51:05,947 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:05,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] [2020-02-10 19:51:05,947 INFO L427 AbstractCegarLoop]: === Iteration 522 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:05,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:05,947 INFO L82 PathProgramCache]: Analyzing trace with hash 415749330, now seen corresponding path program 514 times [2020-02-10 19:51:05,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:05,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796678176] [2020-02-10 19:51:05,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:05,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:06,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:06,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796678176] [2020-02-10 19:51:06,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:06,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:51:06,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168880167] [2020-02-10 19:51:06,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:51:06,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:06,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:51:06,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:06,489 INFO L87 Difference]: Start difference. First operand 1581 states and 7068 transitions. Second operand 11 states. [2020-02-10 19:51:06,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:06,680 INFO L93 Difference]: Finished difference Result 2985 states and 11810 transitions. [2020-02-10 19:51:06,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:51:06,681 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:51:06,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:06,688 INFO L225 Difference]: With dead ends: 2985 [2020-02-10 19:51:06,688 INFO L226 Difference]: Without dead ends: 2963 [2020-02-10 19:51:06,688 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:51:06,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2963 states. [2020-02-10 19:51:06,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2963 to 1576. [2020-02-10 19:51:06,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 19:51:06,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7054 transitions. [2020-02-10 19:51:06,756 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7054 transitions. Word has length 28 [2020-02-10 19:51:06,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:06,756 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7054 transitions. [2020-02-10 19:51:06,756 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:51:06,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7054 transitions. [2020-02-10 19:51:06,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:51:06,758 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:06,758 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:06,758 INFO L427 AbstractCegarLoop]: === Iteration 523 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:06,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:06,758 INFO L82 PathProgramCache]: Analyzing trace with hash -830583742, now seen corresponding path program 515 times [2020-02-10 19:51:06,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:06,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484827005] [2020-02-10 19:51:06,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:06,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:07,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 19:51:07,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484827005] [2020-02-10 19:51:07,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:07,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:51:07,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890207851] [2020-02-10 19:51:07,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:51:07,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:07,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:51:07,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:07,292 INFO L87 Difference]: Start difference. First operand 1576 states and 7054 transitions. Second operand 11 states. [2020-02-10 19:51:07,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:07,470 INFO L93 Difference]: Finished difference Result 2996 states and 11832 transitions. [2020-02-10 19:51:07,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:51:07,470 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:51:07,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:07,478 INFO L225 Difference]: With dead ends: 2996 [2020-02-10 19:51:07,478 INFO L226 Difference]: Without dead ends: 2976 [2020-02-10 19:51:07,478 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:51:07,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2976 states. [2020-02-10 19:51:07,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2976 to 1584. [2020-02-10 19:51:07,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1584 states. [2020-02-10 19:51:07,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 7068 transitions. [2020-02-10 19:51:07,545 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 7068 transitions. Word has length 28 [2020-02-10 19:51:07,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:07,546 INFO L479 AbstractCegarLoop]: Abstraction has 1584 states and 7068 transitions. [2020-02-10 19:51:07,546 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:51:07,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 7068 transitions. [2020-02-10 19:51:07,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:51:07,548 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:07,548 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:07,548 INFO L427 AbstractCegarLoop]: === Iteration 524 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:07,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:07,548 INFO L82 PathProgramCache]: Analyzing trace with hash -657336050, now seen corresponding path program 516 times [2020-02-10 19:51:07,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:07,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945136531] [2020-02-10 19:51:07,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:07,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:08,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:08,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945136531] [2020-02-10 19:51:08,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:08,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:51:08,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580349228] [2020-02-10 19:51:08,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:51:08,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:08,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:51:08,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:08,070 INFO L87 Difference]: Start difference. First operand 1584 states and 7068 transitions. Second operand 11 states. [2020-02-10 19:51:08,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:08,308 INFO L93 Difference]: Finished difference Result 2993 states and 11819 transitions. [2020-02-10 19:51:08,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:51:08,308 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:51:08,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:08,316 INFO L225 Difference]: With dead ends: 2993 [2020-02-10 19:51:08,316 INFO L226 Difference]: Without dead ends: 2962 [2020-02-10 19:51:08,317 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:51:08,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2962 states. [2020-02-10 19:51:08,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2962 to 1570. [2020-02-10 19:51:08,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 19:51:08,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7037 transitions. [2020-02-10 19:51:08,384 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7037 transitions. Word has length 28 [2020-02-10 19:51:08,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:08,384 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7037 transitions. [2020-02-10 19:51:08,384 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:51:08,384 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7037 transitions. [2020-02-10 19:51:08,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:51:08,386 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:08,386 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:08,386 INFO L427 AbstractCegarLoop]: === Iteration 525 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:08,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:08,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1982855886, now seen corresponding path program 517 times [2020-02-10 19:51:08,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:08,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151881130] [2020-02-10 19:51:08,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:08,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:08,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 19:51:08,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151881130] [2020-02-10 19:51:08,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:08,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:51:08,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048515163] [2020-02-10 19:51:08,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:51:08,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:08,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:51:08,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:08,920 INFO L87 Difference]: Start difference. First operand 1570 states and 7037 transitions. Second operand 11 states. [2020-02-10 19:51:09,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:09,185 INFO L93 Difference]: Finished difference Result 2979 states and 11803 transitions. [2020-02-10 19:51:09,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:51:09,185 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:51:09,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:09,192 INFO L225 Difference]: With dead ends: 2979 [2020-02-10 19:51:09,192 INFO L226 Difference]: Without dead ends: 2964 [2020-02-10 19:51:09,192 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:51:09,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2964 states. [2020-02-10 19:51:09,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2964 to 1580. [2020-02-10 19:51:09,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 19:51:09,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7065 transitions. [2020-02-10 19:51:09,260 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7065 transitions. Word has length 28 [2020-02-10 19:51:09,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:09,260 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7065 transitions. [2020-02-10 19:51:09,260 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:51:09,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7065 transitions. [2020-02-10 19:51:09,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:51:09,262 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:09,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] [2020-02-10 19:51:09,262 INFO L427 AbstractCegarLoop]: === Iteration 526 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:09,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:09,262 INFO L82 PathProgramCache]: Analyzing trace with hash -78003916, now seen corresponding path program 518 times [2020-02-10 19:51:09,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:09,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838680108] [2020-02-10 19:51:09,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:09,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:09,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:09,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838680108] [2020-02-10 19:51:09,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:09,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:51:09,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204554616] [2020-02-10 19:51:09,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:51:09,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:09,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:51:09,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:09,807 INFO L87 Difference]: Start difference. First operand 1580 states and 7065 transitions. Second operand 11 states. [2020-02-10 19:51:09,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:09,974 INFO L93 Difference]: Finished difference Result 2982 states and 11804 transitions. [2020-02-10 19:51:09,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:51:09,974 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:51:09,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:09,981 INFO L225 Difference]: With dead ends: 2982 [2020-02-10 19:51:09,981 INFO L226 Difference]: Without dead ends: 2959 [2020-02-10 19:51:09,981 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:51:10,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2959 states. [2020-02-10 19:51:10,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2959 to 1575. [2020-02-10 19:51:10,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 19:51:10,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7051 transitions. [2020-02-10 19:51:10,049 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7051 transitions. Word has length 28 [2020-02-10 19:51:10,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:10,050 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7051 transitions. [2020-02-10 19:51:10,050 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:51:10,050 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7051 transitions. [2020-02-10 19:51:10,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:51:10,052 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:10,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] [2020-02-10 19:51:10,052 INFO L427 AbstractCegarLoop]: === Iteration 527 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:10,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:10,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1447626084, now seen corresponding path program 519 times [2020-02-10 19:51:10,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:10,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886423601] [2020-02-10 19:51:10,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:10,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:10,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:10,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886423601] [2020-02-10 19:51:10,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:10,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:51:10,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375478159] [2020-02-10 19:51:10,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:51:10,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:10,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:51:10,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:10,575 INFO L87 Difference]: Start difference. First operand 1575 states and 7051 transitions. Second operand 11 states. [2020-02-10 19:51:10,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:10,757 INFO L93 Difference]: Finished difference Result 2978 states and 11796 transitions. [2020-02-10 19:51:10,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:51:10,758 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:51:10,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:10,765 INFO L225 Difference]: With dead ends: 2978 [2020-02-10 19:51:10,765 INFO L226 Difference]: Without dead ends: 2963 [2020-02-10 19:51:10,765 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:51:10,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2963 states. [2020-02-10 19:51:10,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2963 to 1580. [2020-02-10 19:51:10,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 19:51:10,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7060 transitions. [2020-02-10 19:51:10,833 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7060 transitions. Word has length 28 [2020-02-10 19:51:10,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:10,833 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7060 transitions. [2020-02-10 19:51:10,833 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:51:10,833 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7060 transitions. [2020-02-10 19:51:10,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:51:10,835 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:10,835 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:10,835 INFO L427 AbstractCegarLoop]: === Iteration 528 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:10,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:10,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1184688524, now seen corresponding path program 520 times [2020-02-10 19:51:10,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:10,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122948818] [2020-02-10 19:51:10,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:10,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:11,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 19:51:11,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122948818] [2020-02-10 19:51:11,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:11,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:51:11,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950979653] [2020-02-10 19:51:11,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:51:11,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:11,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:51:11,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:11,363 INFO L87 Difference]: Start difference. First operand 1580 states and 7060 transitions. Second operand 11 states. [2020-02-10 19:51:11,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:11,545 INFO L93 Difference]: Finished difference Result 2980 states and 11795 transitions. [2020-02-10 19:51:11,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:51:11,546 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:51:11,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:11,553 INFO L225 Difference]: With dead ends: 2980 [2020-02-10 19:51:11,553 INFO L226 Difference]: Without dead ends: 2958 [2020-02-10 19:51:11,553 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:51:11,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2958 states. [2020-02-10 19:51:11,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2958 to 1575. [2020-02-10 19:51:11,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 19:51:11,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7046 transitions. [2020-02-10 19:51:11,620 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7046 transitions. Word has length 28 [2020-02-10 19:51:11,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:11,620 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7046 transitions. [2020-02-10 19:51:11,620 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:51:11,621 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7046 transitions. [2020-02-10 19:51:11,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:51:11,623 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:11,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] [2020-02-10 19:51:11,623 INFO L427 AbstractCegarLoop]: === Iteration 529 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:11,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:11,623 INFO L82 PathProgramCache]: Analyzing trace with hash -75378140, now seen corresponding path program 521 times [2020-02-10 19:51:11,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:11,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679975081] [2020-02-10 19:51:11,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:11,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:12,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:12,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679975081] [2020-02-10 19:51:12,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:12,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:51:12,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583813003] [2020-02-10 19:51:12,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:51:12,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:12,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:51:12,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:12,169 INFO L87 Difference]: Start difference. First operand 1575 states and 7046 transitions. Second operand 11 states. [2020-02-10 19:51:12,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:12,354 INFO L93 Difference]: Finished difference Result 2986 states and 11809 transitions. [2020-02-10 19:51:12,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:51:12,354 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:51:12,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:12,361 INFO L225 Difference]: With dead ends: 2986 [2020-02-10 19:51:12,361 INFO L226 Difference]: Without dead ends: 2968 [2020-02-10 19:51:12,361 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:51:12,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2968 states. [2020-02-10 19:51:12,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2968 to 1582. [2020-02-10 19:51:12,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2020-02-10 19:51:12,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 7059 transitions. [2020-02-10 19:51:12,429 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 7059 transitions. Word has length 28 [2020-02-10 19:51:12,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:12,429 INFO L479 AbstractCegarLoop]: Abstraction has 1582 states and 7059 transitions. [2020-02-10 19:51:12,429 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:51:12,429 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 7059 transitions. [2020-02-10 19:51:12,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:51:12,431 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:12,432 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:12,432 INFO L427 AbstractCegarLoop]: === Iteration 530 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:12,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:12,432 INFO L82 PathProgramCache]: Analyzing trace with hash -646832946, now seen corresponding path program 522 times [2020-02-10 19:51:12,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:12,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151532799] [2020-02-10 19:51:12,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:12,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:12,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 19:51:12,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151532799] [2020-02-10 19:51:12,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:12,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:51:12,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470147696] [2020-02-10 19:51:12,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:51:12,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:12,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:51:12,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:12,958 INFO L87 Difference]: Start difference. First operand 1582 states and 7059 transitions. Second operand 11 states. [2020-02-10 19:51:13,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:13,150 INFO L93 Difference]: Finished difference Result 2985 states and 11800 transitions. [2020-02-10 19:51:13,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:51:13,150 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:51:13,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:13,157 INFO L225 Difference]: With dead ends: 2985 [2020-02-10 19:51:13,157 INFO L226 Difference]: Without dead ends: 2956 [2020-02-10 19:51:13,157 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:51:13,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2020-02-10 19:51:13,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 1570. [2020-02-10 19:51:13,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 19:51:13,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7032 transitions. [2020-02-10 19:51:13,224 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7032 transitions. Word has length 28 [2020-02-10 19:51:13,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:13,224 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7032 transitions. [2020-02-10 19:51:13,225 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:51:13,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7032 transitions. [2020-02-10 19:51:13,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:51:13,227 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:13,227 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:13,227 INFO L427 AbstractCegarLoop]: === Iteration 531 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:13,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:13,227 INFO L82 PathProgramCache]: Analyzing trace with hash -801700206, now seen corresponding path program 523 times [2020-02-10 19:51:13,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:13,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682375438] [2020-02-10 19:51:13,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:13,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:13,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:13,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682375438] [2020-02-10 19:51:13,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:13,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:51:13,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310114184] [2020-02-10 19:51:13,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:51:13,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:13,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:51:13,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:13,780 INFO L87 Difference]: Start difference. First operand 1570 states and 7032 transitions. Second operand 11 states. [2020-02-10 19:51:13,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:13,921 INFO L93 Difference]: Finished difference Result 3012 states and 11871 transitions. [2020-02-10 19:51:13,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:51:13,922 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:51:13,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:13,929 INFO L225 Difference]: With dead ends: 3012 [2020-02-10 19:51:13,929 INFO L226 Difference]: Without dead ends: 2992 [2020-02-10 19:51:13,930 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:51:13,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2992 states. [2020-02-10 19:51:13,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2992 to 1590. [2020-02-10 19:51:13,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1590 states. [2020-02-10 19:51:13,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1590 states to 1590 states and 7082 transitions. [2020-02-10 19:51:13,997 INFO L78 Accepts]: Start accepts. Automaton has 1590 states and 7082 transitions. Word has length 28 [2020-02-10 19:51:13,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:13,997 INFO L479 AbstractCegarLoop]: Abstraction has 1590 states and 7082 transitions. [2020-02-10 19:51:13,998 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:51:13,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1590 states and 7082 transitions. [2020-02-10 19:51:14,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:51:14,000 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:14,000 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:14,000 INFO L427 AbstractCegarLoop]: === Iteration 532 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:14,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:14,000 INFO L82 PathProgramCache]: Analyzing trace with hash -56997708, now seen corresponding path program 524 times [2020-02-10 19:51:14,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:14,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591897748] [2020-02-10 19:51:14,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:14,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:14,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:14,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591897748] [2020-02-10 19:51:14,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:14,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:51:14,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215049122] [2020-02-10 19:51:14,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:51:14,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:14,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:51:14,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:14,545 INFO L87 Difference]: Start difference. First operand 1590 states and 7082 transitions. Second operand 11 states. [2020-02-10 19:51:14,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:14,723 INFO L93 Difference]: Finished difference Result 3010 states and 11859 transitions. [2020-02-10 19:51:14,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:51:14,723 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:51:14,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:14,731 INFO L225 Difference]: With dead ends: 3010 [2020-02-10 19:51:14,731 INFO L226 Difference]: Without dead ends: 2982 [2020-02-10 19:51:14,731 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:51:14,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2982 states. [2020-02-10 19:51:14,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2982 to 1580. [2020-02-10 19:51:14,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 19:51:14,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7056 transitions. [2020-02-10 19:51:14,798 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7056 transitions. Word has length 28 [2020-02-10 19:51:14,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:14,798 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7056 transitions. [2020-02-10 19:51:14,798 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:51:14,799 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7056 transitions. [2020-02-10 19:51:14,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:51:14,801 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:14,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] [2020-02-10 19:51:14,801 INFO L427 AbstractCegarLoop]: === Iteration 533 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:14,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:14,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1336930008, now seen corresponding path program 525 times [2020-02-10 19:51:14,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:14,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663868281] [2020-02-10 19:51:14,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:14,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:15,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:15,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663868281] [2020-02-10 19:51:15,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:15,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:51:15,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204446722] [2020-02-10 19:51:15,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:51:15,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:15,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:51:15,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:15,355 INFO L87 Difference]: Start difference. First operand 1580 states and 7056 transitions. Second operand 11 states. [2020-02-10 19:51:15,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:15,496 INFO L93 Difference]: Finished difference Result 3009 states and 11856 transitions. [2020-02-10 19:51:15,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:51:15,496 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:51:15,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:15,503 INFO L225 Difference]: With dead ends: 3009 [2020-02-10 19:51:15,503 INFO L226 Difference]: Without dead ends: 2989 [2020-02-10 19:51:15,503 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:51:15,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2989 states. [2020-02-10 19:51:15,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2989 to 1588. [2020-02-10 19:51:15,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1588 states. [2020-02-10 19:51:15,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 7070 transitions. [2020-02-10 19:51:15,579 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 7070 transitions. Word has length 28 [2020-02-10 19:51:15,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:15,579 INFO L479 AbstractCegarLoop]: Abstraction has 1588 states and 7070 transitions. [2020-02-10 19:51:15,579 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:51:15,580 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 7070 transitions. [2020-02-10 19:51:15,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:51:15,582 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:15,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] [2020-02-10 19:51:15,582 INFO L427 AbstractCegarLoop]: === Iteration 534 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:15,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:15,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1163682316, now seen corresponding path program 526 times [2020-02-10 19:51:15,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:15,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126931672] [2020-02-10 19:51:15,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:15,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:16,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:16,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126931672] [2020-02-10 19:51:16,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:16,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:51:16,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763626044] [2020-02-10 19:51:16,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:51:16,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:16,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:51:16,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:16,126 INFO L87 Difference]: Start difference. First operand 1588 states and 7070 transitions. Second operand 11 states. [2020-02-10 19:51:16,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:16,297 INFO L93 Difference]: Finished difference Result 3006 states and 11843 transitions. [2020-02-10 19:51:16,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:51:16,298 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:51:16,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:16,305 INFO L225 Difference]: With dead ends: 3006 [2020-02-10 19:51:16,305 INFO L226 Difference]: Without dead ends: 2981 [2020-02-10 19:51:16,306 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:51:16,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2981 states. [2020-02-10 19:51:16,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2981 to 1580. [2020-02-10 19:51:16,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 19:51:16,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7048 transitions. [2020-02-10 19:51:16,373 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7048 transitions. Word has length 28 [2020-02-10 19:51:16,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:16,373 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7048 transitions. [2020-02-10 19:51:16,373 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:51:16,373 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7048 transitions. [2020-02-10 19:51:16,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:51:16,375 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:16,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] [2020-02-10 19:51:16,375 INFO L427 AbstractCegarLoop]: === Iteration 535 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:16,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:16,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1018713448, now seen corresponding path program 527 times [2020-02-10 19:51:16,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:16,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633780187] [2020-02-10 19:51:16,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:16,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:16,921 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 19:51:16,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:16,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633780187] [2020-02-10 19:51:16,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:16,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:51:16,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276102845] [2020-02-10 19:51:16,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:51:16,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:16,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:51:16,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:16,929 INFO L87 Difference]: Start difference. First operand 1580 states and 7048 transitions. Second operand 11 states. [2020-02-10 19:51:17,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:17,112 INFO L93 Difference]: Finished difference Result 3004 states and 11840 transitions. [2020-02-10 19:51:17,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:51:17,113 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:51:17,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:17,120 INFO L225 Difference]: With dead ends: 3004 [2020-02-10 19:51:17,120 INFO L226 Difference]: Without dead ends: 2986 [2020-02-10 19:51:17,121 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:51:17,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2986 states. [2020-02-10 19:51:17,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2986 to 1587. [2020-02-10 19:51:17,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1587 states. [2020-02-10 19:51:17,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 7061 transitions. [2020-02-10 19:51:17,188 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 7061 transitions. Word has length 28 [2020-02-10 19:51:17,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:17,188 INFO L479 AbstractCegarLoop]: Abstraction has 1587 states and 7061 transitions. [2020-02-10 19:51:17,188 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:51:17,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 7061 transitions. [2020-02-10 19:51:17,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:51:17,191 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51: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] [2020-02-10 19:51:17,191 INFO L427 AbstractCegarLoop]: === Iteration 536 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:17,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:17,191 INFO L82 PathProgramCache]: Analyzing trace with hash 447258642, now seen corresponding path program 528 times [2020-02-10 19:51:17,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:17,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810841570] [2020-02-10 19:51:17,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:17,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:17,741 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 31 [2020-02-10 19:51:17,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 19:51:17,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810841570] [2020-02-10 19:51:17,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:17,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:51:17,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703157789] [2020-02-10 19:51:17,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:51:17,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:17,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:51:17,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:17,749 INFO L87 Difference]: Start difference. First operand 1587 states and 7061 transitions. Second operand 11 states. [2020-02-10 19:51:17,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:17,923 INFO L93 Difference]: Finished difference Result 3003 states and 11831 transitions. [2020-02-10 19:51:17,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:51:17,923 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:51:17,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:17,930 INFO L225 Difference]: With dead ends: 3003 [2020-02-10 19:51:17,931 INFO L226 Difference]: Without dead ends: 2961 [2020-02-10 19:51:17,931 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:51:17,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2961 states. [2020-02-10 19:51:17,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2961 to 1562. [2020-02-10 19:51:17,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1562 states. [2020-02-10 19:51:17,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1562 states to 1562 states and 7010 transitions. [2020-02-10 19:51:17,999 INFO L78 Accepts]: Start accepts. Automaton has 1562 states and 7010 transitions. Word has length 28 [2020-02-10 19:51:17,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:17,999 INFO L479 AbstractCegarLoop]: Abstraction has 1562 states and 7010 transitions. [2020-02-10 19:51:17,999 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:51:17,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1562 states and 7010 transitions. [2020-02-10 19:51:18,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:51:18,001 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:18,001 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:18,002 INFO L427 AbstractCegarLoop]: === Iteration 537 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:18,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:18,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1933571164, now seen corresponding path program 529 times [2020-02-10 19:51:18,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:18,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73543948] [2020-02-10 19:51:18,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:18,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:18,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:18,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73543948] [2020-02-10 19:51:18,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:18,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:51:18,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708279629] [2020-02-10 19:51:18,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:51:18,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:18,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:51:18,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:18,519 INFO L87 Difference]: Start difference. First operand 1562 states and 7010 transitions. Second operand 11 states. [2020-02-10 19:51:18,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:18,718 INFO L93 Difference]: Finished difference Result 2955 states and 11734 transitions. [2020-02-10 19:51:18,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:51:18,719 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:51:18,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:18,726 INFO L225 Difference]: With dead ends: 2955 [2020-02-10 19:51:18,726 INFO L226 Difference]: Without dead ends: 2940 [2020-02-10 19:51:18,726 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:51:18,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2940 states. [2020-02-10 19:51:18,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2940 to 1578. [2020-02-10 19:51:18,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 19:51:18,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7062 transitions. [2020-02-10 19:51:18,794 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7062 transitions. Word has length 28 [2020-02-10 19:51:18,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:18,794 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7062 transitions. [2020-02-10 19:51:18,795 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:51:18,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7062 transitions. [2020-02-10 19:51:18,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:51:18,797 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:18,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] [2020-02-10 19:51:18,797 INFO L427 AbstractCegarLoop]: === Iteration 538 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:18,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:18,797 INFO L82 PathProgramCache]: Analyzing trace with hash -444166168, now seen corresponding path program 530 times [2020-02-10 19:51:18,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:18,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338955457] [2020-02-10 19:51:18,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:18,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:19,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 19:51:19,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338955457] [2020-02-10 19:51:19,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:19,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:51:19,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997693799] [2020-02-10 19:51:19,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:51:19,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:19,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:51:19,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:19,316 INFO L87 Difference]: Start difference. First operand 1578 states and 7062 transitions. Second operand 11 states. [2020-02-10 19:51:19,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:19,478 INFO L93 Difference]: Finished difference Result 2960 states and 11738 transitions. [2020-02-10 19:51:19,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:51:19,479 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:51:19,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:19,486 INFO L225 Difference]: With dead ends: 2960 [2020-02-10 19:51:19,487 INFO L226 Difference]: Without dead ends: 2934 [2020-02-10 19:51:19,487 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:51:19,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2934 states. [2020-02-10 19:51:19,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2934 to 1572. [2020-02-10 19:51:19,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 19:51:19,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7046 transitions. [2020-02-10 19:51:19,555 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7046 transitions. Word has length 28 [2020-02-10 19:51:19,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:19,555 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7046 transitions. [2020-02-10 19:51:19,555 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:51:19,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7046 transitions. [2020-02-10 19:51:19,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:51:19,557 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:19,557 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:19,557 INFO L427 AbstractCegarLoop]: === Iteration 539 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:19,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:19,558 INFO L82 PathProgramCache]: Analyzing trace with hash 215225372, now seen corresponding path program 531 times [2020-02-10 19:51:19,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:19,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346504886] [2020-02-10 19:51:19,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:19,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:20,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 19:51:20,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346504886] [2020-02-10 19:51:20,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:20,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:51:20,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997023245] [2020-02-10 19:51:20,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:51:20,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:20,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:51:20,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:20,079 INFO L87 Difference]: Start difference. First operand 1572 states and 7046 transitions. Second operand 11 states. [2020-02-10 19:51:20,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:20,264 INFO L93 Difference]: Finished difference Result 2947 states and 11713 transitions. [2020-02-10 19:51:20,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:51:20,265 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:51:20,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:20,272 INFO L225 Difference]: With dead ends: 2947 [2020-02-10 19:51:20,272 INFO L226 Difference]: Without dead ends: 2932 [2020-02-10 19:51:20,272 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:51:20,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2932 states. [2020-02-10 19:51:20,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2932 to 1576. [2020-02-10 19:51:20,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 19:51:20,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7053 transitions. [2020-02-10 19:51:20,340 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7053 transitions. Word has length 28 [2020-02-10 19:51:20,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:20,340 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7053 transitions. [2020-02-10 19:51:20,340 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:51:20,340 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7053 transitions. [2020-02-10 19:51:20,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:51:20,343 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:20,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] [2020-02-10 19:51:20,343 INFO L427 AbstractCegarLoop]: === Iteration 540 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:20,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:20,343 INFO L82 PathProgramCache]: Analyzing trace with hash 388473064, now seen corresponding path program 532 times [2020-02-10 19:51:20,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:20,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050780304] [2020-02-10 19:51:20,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:20,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:20,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:20,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050780304] [2020-02-10 19:51:20,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:20,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:51:20,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700538270] [2020-02-10 19:51:20,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:51:20,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:20,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:51:20,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:20,860 INFO L87 Difference]: Start difference. First operand 1576 states and 7053 transitions. Second operand 11 states. [2020-02-10 19:51:21,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:21,056 INFO L93 Difference]: Finished difference Result 2946 states and 11707 transitions. [2020-02-10 19:51:21,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:51:21,057 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:51:21,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:21,064 INFO L225 Difference]: With dead ends: 2946 [2020-02-10 19:51:21,064 INFO L226 Difference]: Without dead ends: 2928 [2020-02-10 19:51:21,064 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:51:21,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2928 states. [2020-02-10 19:51:21,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2928 to 1572. [2020-02-10 19:51:21,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 19:51:21,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7042 transitions. [2020-02-10 19:51:21,131 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7042 transitions. Word has length 28 [2020-02-10 19:51:21,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:21,131 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7042 transitions. [2020-02-10 19:51:21,131 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:51:21,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7042 transitions. [2020-02-10 19:51:21,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:51:21,133 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:21,133 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:21,134 INFO L427 AbstractCegarLoop]: === Iteration 541 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:21,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:21,134 INFO L82 PathProgramCache]: Analyzing trace with hash 631544988, now seen corresponding path program 533 times [2020-02-10 19:51:21,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:21,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464898766] [2020-02-10 19:51:21,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:21,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:21,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:21,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464898766] [2020-02-10 19:51:21,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:21,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:51:21,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124064965] [2020-02-10 19:51:21,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:51:21,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:21,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:51:21,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:21,651 INFO L87 Difference]: Start difference. First operand 1572 states and 7042 transitions. Second operand 11 states. [2020-02-10 19:51:21,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:21,811 INFO L93 Difference]: Finished difference Result 2958 states and 11729 transitions. [2020-02-10 19:51:21,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:51:21,811 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:51:21,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:21,819 INFO L225 Difference]: With dead ends: 2958 [2020-02-10 19:51:21,819 INFO L226 Difference]: Without dead ends: 2938 [2020-02-10 19:51:21,819 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:51:21,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2938 states. [2020-02-10 19:51:21,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2938 to 1577. [2020-02-10 19:51:21,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 19:51:21,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7050 transitions. [2020-02-10 19:51:21,886 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7050 transitions. Word has length 28 [2020-02-10 19:51:21,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:21,886 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7050 transitions. [2020-02-10 19:51:21,886 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:51:21,886 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7050 transitions. [2020-02-10 19:51:21,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:51:21,888 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:21,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] [2020-02-10 19:51:21,889 INFO L427 AbstractCegarLoop]: === Iteration 542 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:21,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:21,889 INFO L82 PathProgramCache]: Analyzing trace with hash -684612316, now seen corresponding path program 534 times [2020-02-10 19:51:21,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:21,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924829537] [2020-02-10 19:51:21,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:21,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:22,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:22,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924829537] [2020-02-10 19:51:22,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:22,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:51:22,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354831688] [2020-02-10 19:51:22,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:51:22,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:22,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:51:22,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:22,404 INFO L87 Difference]: Start difference. First operand 1577 states and 7050 transitions. Second operand 11 states. [2020-02-10 19:51:22,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:22,594 INFO L93 Difference]: Finished difference Result 2952 states and 11713 transitions. [2020-02-10 19:51:22,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:51:22,594 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:51:22,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:22,602 INFO L225 Difference]: With dead ends: 2952 [2020-02-10 19:51:22,602 INFO L226 Difference]: Without dead ends: 2928 [2020-02-10 19:51:22,602 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:51:22,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2928 states. [2020-02-10 19:51:22,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2928 to 1567. [2020-02-10 19:51:22,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 19:51:22,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7028 transitions. [2020-02-10 19:51:22,671 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7028 transitions. Word has length 28 [2020-02-10 19:51:22,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:22,671 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7028 transitions. [2020-02-10 19:51:22,671 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:51:22,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7028 transitions. [2020-02-10 19:51:22,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:51:22,674 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:22,674 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:22,674 INFO L427 AbstractCegarLoop]: === Iteration 543 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:22,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:22,674 INFO L82 PathProgramCache]: Analyzing trace with hash -839479576, now seen corresponding path program 535 times [2020-02-10 19:51:22,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:22,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054622708] [2020-02-10 19:51:22,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:22,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:23,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:23,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054622708] [2020-02-10 19:51:23,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:23,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:51:23,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902676348] [2020-02-10 19:51:23,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:51:23,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:23,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:51:23,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:23,222 INFO L87 Difference]: Start difference. First operand 1567 states and 7028 transitions. Second operand 11 states. [2020-02-10 19:51:23,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:23,439 INFO L93 Difference]: Finished difference Result 2963 states and 11751 transitions. [2020-02-10 19:51:23,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:51:23,440 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:51:23,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:23,446 INFO L225 Difference]: With dead ends: 2963 [2020-02-10 19:51:23,446 INFO L226 Difference]: Without dead ends: 2948 [2020-02-10 19:51:23,447 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:51:23,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2948 states. [2020-02-10 19:51:23,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2948 to 1579. [2020-02-10 19:51:23,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 19:51:23,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7061 transitions. [2020-02-10 19:51:23,513 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7061 transitions. Word has length 28 [2020-02-10 19:51:23,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:23,513 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7061 transitions. [2020-02-10 19:51:23,513 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:51:23,513 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7061 transitions. [2020-02-10 19:51:23,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:51:23,515 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:23,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] [2020-02-10 19:51:23,515 INFO L427 AbstractCegarLoop]: === Iteration 544 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:23,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:23,516 INFO L82 PathProgramCache]: Analyzing trace with hash 649925420, now seen corresponding path program 536 times [2020-02-10 19:51:23,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:23,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509777048] [2020-02-10 19:51:23,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:23,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:24,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 19:51:24,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509777048] [2020-02-10 19:51:24,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:24,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:51:24,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139115212] [2020-02-10 19:51:24,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:51:24,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:24,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:51:24,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:24,045 INFO L87 Difference]: Start difference. First operand 1579 states and 7061 transitions. Second operand 11 states. [2020-02-10 19:51:24,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:24,249 INFO L93 Difference]: Finished difference Result 2968 states and 11755 transitions. [2020-02-10 19:51:24,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:51:24,249 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:51:24,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:24,257 INFO L225 Difference]: With dead ends: 2968 [2020-02-10 19:51:24,257 INFO L226 Difference]: Without dead ends: 2942 [2020-02-10 19:51:24,257 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:51:24,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2942 states. [2020-02-10 19:51:24,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2942 to 1573. [2020-02-10 19:51:24,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 19:51:24,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7044 transitions. [2020-02-10 19:51:24,324 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7044 transitions. Word has length 28 [2020-02-10 19:51:24,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:24,324 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7044 transitions. [2020-02-10 19:51:24,324 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:51:24,324 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7044 transitions. [2020-02-10 19:51:24,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:51:24,326 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:24,326 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:24,327 INFO L427 AbstractCegarLoop]: === Iteration 545 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:24,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:24,327 INFO L82 PathProgramCache]: Analyzing trace with hash 236231580, now seen corresponding path program 537 times [2020-02-10 19:51:24,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:24,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264039035] [2020-02-10 19:51:24,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:24,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:24,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:24,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264039035] [2020-02-10 19:51:24,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:24,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:51:24,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299395307] [2020-02-10 19:51:24,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:51:24,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:24,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:51:24,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:24,846 INFO L87 Difference]: Start difference. First operand 1573 states and 7044 transitions. Second operand 11 states. [2020-02-10 19:51:25,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:25,069 INFO L93 Difference]: Finished difference Result 2959 states and 11738 transitions. [2020-02-10 19:51:25,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:51:25,070 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:51:25,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:25,078 INFO L225 Difference]: With dead ends: 2959 [2020-02-10 19:51:25,078 INFO L226 Difference]: Without dead ends: 2944 [2020-02-10 19:51:25,078 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:51:25,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2944 states. [2020-02-10 19:51:25,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2944 to 1578. [2020-02-10 19:51:25,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 19:51:25,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7053 transitions. [2020-02-10 19:51:25,146 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7053 transitions. Word has length 28 [2020-02-10 19:51:25,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:25,147 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7053 transitions. [2020-02-10 19:51:25,147 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:51:25,147 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7053 transitions. [2020-02-10 19:51:25,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:51:25,149 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:25,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] [2020-02-10 19:51:25,149 INFO L427 AbstractCegarLoop]: === Iteration 546 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:25,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:25,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1898884268, now seen corresponding path program 538 times [2020-02-10 19:51:25,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:25,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556102707] [2020-02-10 19:51:25,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:25,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:25,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 19:51:25,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556102707] [2020-02-10 19:51:25,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:25,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:51:25,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048632628] [2020-02-10 19:51:25,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:51:25,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:25,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:51:25,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:25,663 INFO L87 Difference]: Start difference. First operand 1578 states and 7053 transitions. Second operand 11 states. [2020-02-10 19:51:25,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:25,885 INFO L93 Difference]: Finished difference Result 2961 states and 11737 transitions. [2020-02-10 19:51:25,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:51:25,885 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:51:25,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:25,892 INFO L225 Difference]: With dead ends: 2961 [2020-02-10 19:51:25,893 INFO L226 Difference]: Without dead ends: 2939 [2020-02-10 19:51:25,893 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:51:25,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2939 states. [2020-02-10 19:51:25,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2939 to 1573. [2020-02-10 19:51:25,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 19:51:25,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7039 transitions. [2020-02-10 19:51:25,962 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7039 transitions. Word has length 28 [2020-02-10 19:51:25,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:25,962 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7039 transitions. [2020-02-10 19:51:25,962 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:51:25,962 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7039 transitions. [2020-02-10 19:51:25,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:51:25,964 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:25,964 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:25,964 INFO L427 AbstractCegarLoop]: === Iteration 547 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:25,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:25,965 INFO L82 PathProgramCache]: Analyzing trace with hash 652551196, now seen corresponding path program 539 times [2020-02-10 19:51:25,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:25,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874930586] [2020-02-10 19:51:25,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:25,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:26,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 19:51:26,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874930586] [2020-02-10 19:51:26,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:26,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:51:26,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745571813] [2020-02-10 19:51:26,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:51:26,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:26,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:51:26,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:26,495 INFO L87 Difference]: Start difference. First operand 1573 states and 7039 transitions. Second operand 11 states. [2020-02-10 19:51:26,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:26,646 INFO L93 Difference]: Finished difference Result 2972 states and 11759 transitions. [2020-02-10 19:51:26,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:51:26,646 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:51:26,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:26,653 INFO L225 Difference]: With dead ends: 2972 [2020-02-10 19:51:26,653 INFO L226 Difference]: Without dead ends: 2952 [2020-02-10 19:51:26,653 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:51:26,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2952 states. [2020-02-10 19:51:26,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2952 to 1581. [2020-02-10 19:51:26,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 19:51:26,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7053 transitions. [2020-02-10 19:51:26,722 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7053 transitions. Word has length 28 [2020-02-10 19:51:26,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:26,722 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7053 transitions. [2020-02-10 19:51:26,722 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:51:26,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7053 transitions. [2020-02-10 19:51:26,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:51:26,724 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:26,724 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:26,724 INFO L427 AbstractCegarLoop]: === Iteration 548 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:26,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:26,725 INFO L82 PathProgramCache]: Analyzing trace with hash 825798888, now seen corresponding path program 540 times [2020-02-10 19:51:26,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:26,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641319791] [2020-02-10 19:51:26,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:26,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:27,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:27,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641319791] [2020-02-10 19:51:27,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:27,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:51:27,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423044757] [2020-02-10 19:51:27,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:51:27,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:27,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:51:27,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:27,250 INFO L87 Difference]: Start difference. First operand 1581 states and 7053 transitions. Second operand 11 states. [2020-02-10 19:51:27,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:27,459 INFO L93 Difference]: Finished difference Result 2969 states and 11746 transitions. [2020-02-10 19:51:27,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:51:27,459 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:51:27,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:27,466 INFO L225 Difference]: With dead ends: 2969 [2020-02-10 19:51:27,466 INFO L226 Difference]: Without dead ends: 2938 [2020-02-10 19:51:27,467 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:51:27,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2938 states. [2020-02-10 19:51:27,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2938 to 1567. [2020-02-10 19:51:27,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 19:51:27,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7023 transitions. [2020-02-10 19:51:27,535 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7023 transitions. Word has length 28 [2020-02-10 19:51:27,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:27,535 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7023 transitions. [2020-02-10 19:51:27,535 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:51:27,535 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7023 transitions. [2020-02-10 19:51:27,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:51:27,537 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:27,537 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:27,537 INFO L427 AbstractCegarLoop]: === Iteration 549 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:27,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:27,538 INFO L82 PathProgramCache]: Analyzing trace with hash -797467160, now seen corresponding path program 541 times [2020-02-10 19:51:27,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:27,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424821329] [2020-02-10 19:51:27,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:27,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:28,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 19:51:28,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424821329] [2020-02-10 19:51:28,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:28,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:51:28,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072656070] [2020-02-10 19:51:28,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:51:28,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:28,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:51:28,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:28,059 INFO L87 Difference]: Start difference. First operand 1567 states and 7023 transitions. Second operand 11 states. [2020-02-10 19:51:28,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:28,267 INFO L93 Difference]: Finished difference Result 2941 states and 11696 transitions. [2020-02-10 19:51:28,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:51:28,268 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:51:28,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:28,275 INFO L225 Difference]: With dead ends: 2941 [2020-02-10 19:51:28,275 INFO L226 Difference]: Without dead ends: 2926 [2020-02-10 19:51:28,275 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:51:28,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2926 states. [2020-02-10 19:51:28,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2926 to 1575. [2020-02-10 19:51:28,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 19:51:28,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7045 transitions. [2020-02-10 19:51:28,342 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7045 transitions. Word has length 28 [2020-02-10 19:51:28,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:28,342 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7045 transitions. [2020-02-10 19:51:28,342 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:51:28,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7045 transitions. [2020-02-10 19:51:28,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:51:28,345 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:28,345 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:28,345 INFO L427 AbstractCegarLoop]: === Iteration 550 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:28,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:28,345 INFO L82 PathProgramCache]: Analyzing trace with hash -624219468, now seen corresponding path program 542 times [2020-02-10 19:51:28,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:28,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857862788] [2020-02-10 19:51:28,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:28,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:28,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:28,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857862788] [2020-02-10 19:51:28,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:28,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:51:28,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155383847] [2020-02-10 19:51:28,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:51:28,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:28,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:51:28,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:28,862 INFO L87 Difference]: Start difference. First operand 1575 states and 7045 transitions. Second operand 11 states. [2020-02-10 19:51:29,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:29,043 INFO L93 Difference]: Finished difference Result 2940 states and 11690 transitions. [2020-02-10 19:51:29,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:51:29,043 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:51:29,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:29,050 INFO L225 Difference]: With dead ends: 2940 [2020-02-10 19:51:29,050 INFO L226 Difference]: Without dead ends: 2922 [2020-02-10 19:51:29,050 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:51:29,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2922 states. [2020-02-10 19:51:29,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2922 to 1571. [2020-02-10 19:51:29,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 19:51:29,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7034 transitions. [2020-02-10 19:51:29,117 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7034 transitions. Word has length 28 [2020-02-10 19:51:29,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:29,117 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7034 transitions. [2020-02-10 19:51:29,117 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:51:29,117 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7034 transitions. [2020-02-10 19:51:29,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:51:29,141 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:29,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] [2020-02-10 19:51:29,141 INFO L427 AbstractCegarLoop]: === Iteration 551 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:29,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:29,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1870552540, now seen corresponding path program 543 times [2020-02-10 19:51:29,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:29,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494000342] [2020-02-10 19:51:29,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:29,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:29,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:29,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494000342] [2020-02-10 19:51:29,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:29,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:51:29,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847430786] [2020-02-10 19:51:29,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:51:29,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:29,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:51:29,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:29,652 INFO L87 Difference]: Start difference. First operand 1571 states and 7034 transitions. Second operand 11 states. [2020-02-10 19:51:29,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:29,834 INFO L93 Difference]: Finished difference Result 2945 states and 11701 transitions. [2020-02-10 19:51:29,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:51:29,834 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:51:29,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:29,842 INFO L225 Difference]: With dead ends: 2945 [2020-02-10 19:51:29,842 INFO L226 Difference]: Without dead ends: 2930 [2020-02-10 19:51:29,842 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:51:29,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2020-02-10 19:51:29,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 1576. [2020-02-10 19:51:29,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 19:51:29,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7043 transitions. [2020-02-10 19:51:29,910 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7043 transitions. Word has length 28 [2020-02-10 19:51:29,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:29,910 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7043 transitions. [2020-02-10 19:51:29,910 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:51:29,910 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7043 transitions. [2020-02-10 19:51:29,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:51:29,912 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:29,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] [2020-02-10 19:51:29,912 INFO L427 AbstractCegarLoop]: === Iteration 552 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:29,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:29,913 INFO L82 PathProgramCache]: Analyzing trace with hash -207899852, now seen corresponding path program 544 times [2020-02-10 19:51:29,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:29,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204814936] [2020-02-10 19:51:29,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:29,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:30,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 19:51:30,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204814936] [2020-02-10 19:51:30,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:30,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:51:30,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805962408] [2020-02-10 19:51:30,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:51:30,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:30,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:51:30,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:30,421 INFO L87 Difference]: Start difference. First operand 1576 states and 7043 transitions. Second operand 11 states. [2020-02-10 19:51:30,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:30,610 INFO L93 Difference]: Finished difference Result 2947 states and 11700 transitions. [2020-02-10 19:51:30,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:51:30,611 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:51:30,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:30,618 INFO L225 Difference]: With dead ends: 2947 [2020-02-10 19:51:30,618 INFO L226 Difference]: Without dead ends: 2925 [2020-02-10 19:51:30,618 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:51:30,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2925 states. [2020-02-10 19:51:30,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2925 to 1571. [2020-02-10 19:51:30,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 19:51:30,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7030 transitions. [2020-02-10 19:51:30,686 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7030 transitions. Word has length 28 [2020-02-10 19:51:30,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:30,686 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7030 transitions. [2020-02-10 19:51:30,686 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:51:30,687 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7030 transitions. [2020-02-10 19:51:30,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:51:30,689 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:30,689 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:30,689 INFO L427 AbstractCegarLoop]: === Iteration 553 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:30,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:30,689 INFO L82 PathProgramCache]: Analyzing trace with hash -621593692, now seen corresponding path program 545 times [2020-02-10 19:51:30,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:30,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919756116] [2020-02-10 19:51:30,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:30,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:31,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:31,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919756116] [2020-02-10 19:51:31,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:31,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:51:31,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510860919] [2020-02-10 19:51:31,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:51:31,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:31,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:51:31,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:31,207 INFO L87 Difference]: Start difference. First operand 1571 states and 7030 transitions. Second operand 11 states. [2020-02-10 19:51:31,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:31,419 INFO L93 Difference]: Finished difference Result 2942 states and 11690 transitions. [2020-02-10 19:51:31,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:51:31,419 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:51:31,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:31,426 INFO L225 Difference]: With dead ends: 2942 [2020-02-10 19:51:31,426 INFO L226 Difference]: Without dead ends: 2928 [2020-02-10 19:51:31,426 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:51:31,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2928 states. [2020-02-10 19:51:31,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2928 to 1575. [2020-02-10 19:51:31,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 19:51:31,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7037 transitions. [2020-02-10 19:51:31,497 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7037 transitions. Word has length 28 [2020-02-10 19:51:31,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:31,497 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7037 transitions. [2020-02-10 19:51:31,497 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:51:31,497 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7037 transitions. [2020-02-10 19:51:31,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:51:31,500 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:31,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] [2020-02-10 19:51:31,500 INFO L427 AbstractCegarLoop]: === Iteration 554 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:31,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:31,500 INFO L82 PathProgramCache]: Analyzing trace with hash 867811304, now seen corresponding path program 546 times [2020-02-10 19:51:31,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:31,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089923226] [2020-02-10 19:51:31,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:31,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:32,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:32,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089923226] [2020-02-10 19:51:32,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:32,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:51:32,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984549176] [2020-02-10 19:51:32,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:51:32,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:32,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:51:32,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:32,023 INFO L87 Difference]: Start difference. First operand 1575 states and 7037 transitions. Second operand 11 states. [2020-02-10 19:51:32,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:32,235 INFO L93 Difference]: Finished difference Result 2945 states and 11692 transitions. [2020-02-10 19:51:32,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:51:32,235 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:51:32,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:32,242 INFO L225 Difference]: With dead ends: 2945 [2020-02-10 19:51:32,243 INFO L226 Difference]: Without dead ends: 2920 [2020-02-10 19:51:32,243 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:51:32,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2920 states. [2020-02-10 19:51:32,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2920 to 1567. [2020-02-10 19:51:32,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 19:51:32,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7019 transitions. [2020-02-10 19:51:32,311 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7019 transitions. Word has length 28 [2020-02-10 19:51:32,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:32,312 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7019 transitions. [2020-02-10 19:51:32,312 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:51:32,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7019 transitions. [2020-02-10 19:51:32,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:51:32,314 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:32,314 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:32,314 INFO L427 AbstractCegarLoop]: === Iteration 555 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:32,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:32,314 INFO L82 PathProgramCache]: Analyzing trace with hash 712944044, now seen corresponding path program 547 times [2020-02-10 19:51:32,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:32,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137731917] [2020-02-10 19:51:32,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:32,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:32,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 19:51:32,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137731917] [2020-02-10 19:51:32,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:32,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:51:32,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274647770] [2020-02-10 19:51:32,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:51:32,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:32,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:51:32,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:32,837 INFO L87 Difference]: Start difference. First operand 1567 states and 7019 transitions. Second operand 11 states. [2020-02-10 19:51:33,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:33,004 INFO L93 Difference]: Finished difference Result 2962 states and 11734 transitions. [2020-02-10 19:51:33,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:51:33,005 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:51:33,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:33,012 INFO L225 Difference]: With dead ends: 2962 [2020-02-10 19:51:33,012 INFO L226 Difference]: Without dead ends: 2942 [2020-02-10 19:51:33,012 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:51:33,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2942 states. [2020-02-10 19:51:33,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2942 to 1577. [2020-02-10 19:51:33,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 19:51:33,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7045 transitions. [2020-02-10 19:51:33,081 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7045 transitions. Word has length 28 [2020-02-10 19:51:33,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:33,081 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7045 transitions. [2020-02-10 19:51:33,081 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:51:33,082 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7045 transitions. [2020-02-10 19:51:33,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:51:33,084 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:33,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] [2020-02-10 19:51:33,084 INFO L427 AbstractCegarLoop]: === Iteration 556 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:33,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:33,084 INFO L82 PathProgramCache]: Analyzing trace with hash -603213260, now seen corresponding path program 548 times [2020-02-10 19:51:33,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:33,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492473843] [2020-02-10 19:51:33,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:33,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:33,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:33,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492473843] [2020-02-10 19:51:33,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:33,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:51:33,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720824820] [2020-02-10 19:51:33,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:51:33,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:33,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:51:33,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:33,599 INFO L87 Difference]: Start difference. First operand 1577 states and 7045 transitions. Second operand 11 states. [2020-02-10 19:51:33,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:33,813 INFO L93 Difference]: Finished difference Result 2956 states and 11718 transitions. [2020-02-10 19:51:33,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:51:33,814 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:51:33,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:33,821 INFO L225 Difference]: With dead ends: 2956 [2020-02-10 19:51:33,821 INFO L226 Difference]: Without dead ends: 2937 [2020-02-10 19:51:33,821 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:51:33,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2937 states. [2020-02-10 19:51:33,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2937 to 1572. [2020-02-10 19:51:33,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 19:51:33,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7032 transitions. [2020-02-10 19:51:33,889 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7032 transitions. Word has length 28 [2020-02-10 19:51:33,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:33,889 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7032 transitions. [2020-02-10 19:51:33,889 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:51:33,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7032 transitions. [2020-02-10 19:51:33,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:51:33,891 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:33,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] [2020-02-10 19:51:33,891 INFO L427 AbstractCegarLoop]: === Iteration 557 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:33,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:33,891 INFO L82 PathProgramCache]: Analyzing trace with hash -360141336, now seen corresponding path program 549 times [2020-02-10 19:51:33,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:33,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692083085] [2020-02-10 19:51:33,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:33,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:34,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:34,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692083085] [2020-02-10 19:51:34,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:34,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:51:34,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382777877] [2020-02-10 19:51:34,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:51:34,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:34,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:51:34,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:34,433 INFO L87 Difference]: Start difference. First operand 1572 states and 7032 transitions. Second operand 11 states. [2020-02-10 19:51:34,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:34,602 INFO L93 Difference]: Finished difference Result 2968 states and 11744 transitions. [2020-02-10 19:51:34,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:51:34,602 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:51:34,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:34,610 INFO L225 Difference]: With dead ends: 2968 [2020-02-10 19:51:34,610 INFO L226 Difference]: Without dead ends: 2948 [2020-02-10 19:51:34,610 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:51:34,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2948 states. [2020-02-10 19:51:34,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2948 to 1580. [2020-02-10 19:51:34,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 19:51:34,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7046 transitions. [2020-02-10 19:51:34,679 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7046 transitions. Word has length 28 [2020-02-10 19:51:34,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:34,679 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7046 transitions. [2020-02-10 19:51:34,679 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:51:34,679 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7046 transitions. [2020-02-10 19:51:34,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:51:34,681 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51: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] [2020-02-10 19:51:34,681 INFO L427 AbstractCegarLoop]: === Iteration 558 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:34,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:34,681 INFO L82 PathProgramCache]: Analyzing trace with hash -186893644, now seen corresponding path program 550 times [2020-02-10 19:51:34,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:34,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520102529] [2020-02-10 19:51:34,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:34,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:35,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 19:51:35,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520102529] [2020-02-10 19:51:35,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:35,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:51:35,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695195998] [2020-02-10 19:51:35,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:51:35,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:35,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:51:35,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:35,232 INFO L87 Difference]: Start difference. First operand 1580 states and 7046 transitions. Second operand 11 states. [2020-02-10 19:51:35,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:35,493 INFO L93 Difference]: Finished difference Result 2965 states and 11731 transitions. [2020-02-10 19:51:35,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:51:35,493 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:51:35,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:35,500 INFO L225 Difference]: With dead ends: 2965 [2020-02-10 19:51:35,501 INFO L226 Difference]: Without dead ends: 2940 [2020-02-10 19:51:35,501 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:51:35,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2940 states. [2020-02-10 19:51:35,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2940 to 1572. [2020-02-10 19:51:35,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 19:51:35,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7027 transitions. [2020-02-10 19:51:35,567 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7027 transitions. Word has length 28 [2020-02-10 19:51:35,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:35,568 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7027 transitions. [2020-02-10 19:51:35,568 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:51:35,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7027 transitions. [2020-02-10 19:51:35,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:51:35,570 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:35,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] [2020-02-10 19:51:35,570 INFO L427 AbstractCegarLoop]: === Iteration 559 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:35,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:35,570 INFO L82 PathProgramCache]: Analyzing trace with hash 472497896, now seen corresponding path program 551 times [2020-02-10 19:51:35,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:35,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962224461] [2020-02-10 19:51:35,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:35,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:36,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:36,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962224461] [2020-02-10 19:51:36,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:36,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:51:36,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872981095] [2020-02-10 19:51:36,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:51:36,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:36,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:51:36,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:36,085 INFO L87 Difference]: Start difference. First operand 1572 states and 7027 transitions. Second operand 11 states. [2020-02-10 19:51:36,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:36,281 INFO L93 Difference]: Finished difference Result 2952 states and 11706 transitions. [2020-02-10 19:51:36,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:51:36,282 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:51:36,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:36,289 INFO L225 Difference]: With dead ends: 2952 [2020-02-10 19:51:36,289 INFO L226 Difference]: Without dead ends: 2938 [2020-02-10 19:51:36,289 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:51:36,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2938 states. [2020-02-10 19:51:36,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2938 to 1576. [2020-02-10 19:51:36,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 19:51:36,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7034 transitions. [2020-02-10 19:51:36,358 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7034 transitions. Word has length 28 [2020-02-10 19:51:36,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:36,358 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7034 transitions. [2020-02-10 19:51:36,358 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:51:36,358 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7034 transitions. [2020-02-10 19:51:36,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:51:36,361 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:36,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] [2020-02-10 19:51:36,361 INFO L427 AbstractCegarLoop]: === Iteration 560 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:36,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:36,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1961902892, now seen corresponding path program 552 times [2020-02-10 19:51:36,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:36,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032167472] [2020-02-10 19:51:36,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:36,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:36,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:36,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032167472] [2020-02-10 19:51:36,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:36,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:51:36,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727593013] [2020-02-10 19:51:36,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:51:36,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:36,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:51:36,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:36,874 INFO L87 Difference]: Start difference. First operand 1576 states and 7034 transitions. Second operand 11 states. [2020-02-10 19:51:37,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:37,139 INFO L93 Difference]: Finished difference Result 2955 states and 11708 transitions. [2020-02-10 19:51:37,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:51:37,139 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:51:37,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:37,146 INFO L225 Difference]: With dead ends: 2955 [2020-02-10 19:51:37,147 INFO L226 Difference]: Without dead ends: 2924 [2020-02-10 19:51:37,147 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:51:37,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2924 states. [2020-02-10 19:51:37,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2924 to 1562. [2020-02-10 19:51:37,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1562 states. [2020-02-10 19:51:37,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1562 states to 1562 states and 7005 transitions. [2020-02-10 19:51:37,213 INFO L78 Accepts]: Start accepts. Automaton has 1562 states and 7005 transitions. Word has length 28 [2020-02-10 19:51:37,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:37,214 INFO L479 AbstractCegarLoop]: Abstraction has 1562 states and 7005 transitions. [2020-02-10 19:51:37,214 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:51:37,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1562 states and 7005 transitions. [2020-02-10 19:51:37,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:51:37,216 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:37,216 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:37,216 INFO L427 AbstractCegarLoop]: === Iteration 561 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:37,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:37,216 INFO L82 PathProgramCache]: Analyzing trace with hash 2966018, now seen corresponding path program 553 times [2020-02-10 19:51:37,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:37,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780611624] [2020-02-10 19:51:37,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:37,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:37,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 19:51:37,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780611624] [2020-02-10 19:51:37,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:37,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:51:37,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100003961] [2020-02-10 19:51:37,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:51:37,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:37,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:51:37,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:37,750 INFO L87 Difference]: Start difference. First operand 1562 states and 7005 transitions. Second operand 11 states. [2020-02-10 19:51:37,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:37,973 INFO L93 Difference]: Finished difference Result 2938 states and 11692 transitions. [2020-02-10 19:51:37,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:51:37,974 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:51:37,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:37,981 INFO L225 Difference]: With dead ends: 2938 [2020-02-10 19:51:37,981 INFO L226 Difference]: Without dead ends: 2923 [2020-02-10 19:51:37,982 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:51:38,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2923 states. [2020-02-10 19:51:38,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2923 to 1575. [2020-02-10 19:51:38,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 19:51:38,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7048 transitions. [2020-02-10 19:51:38,048 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7048 transitions. Word has length 28 [2020-02-10 19:51:38,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:38,048 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7048 transitions. [2020-02-10 19:51:38,048 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:51:38,049 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7048 transitions. [2020-02-10 19:51:38,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:51:38,051 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:38,051 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:38,051 INFO L427 AbstractCegarLoop]: === Iteration 562 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:38,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:38,051 INFO L82 PathProgramCache]: Analyzing trace with hash -2057893784, now seen corresponding path program 554 times [2020-02-10 19:51:38,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:38,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574948326] [2020-02-10 19:51:38,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:38,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:38,567 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 19:51:38,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:38,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574948326] [2020-02-10 19:51:38,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:38,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:51:38,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278604838] [2020-02-10 19:51:38,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:51:38,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:38,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:51:38,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:38,575 INFO L87 Difference]: Start difference. First operand 1575 states and 7048 transitions. Second operand 11 states. [2020-02-10 19:51:38,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:38,836 INFO L93 Difference]: Finished difference Result 2941 states and 11693 transitions. [2020-02-10 19:51:38,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:51:38,836 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:51:38,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:38,843 INFO L225 Difference]: With dead ends: 2941 [2020-02-10 19:51:38,843 INFO L226 Difference]: Without dead ends: 2918 [2020-02-10 19:51:38,843 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:51:38,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2918 states. [2020-02-10 19:51:38,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2918 to 1570. [2020-02-10 19:51:38,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 19:51:38,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7035 transitions. [2020-02-10 19:51:38,910 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7035 transitions. Word has length 28 [2020-02-10 19:51:38,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:38,910 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7035 transitions. [2020-02-10 19:51:38,910 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:51:38,910 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7035 transitions. [2020-02-10 19:51:38,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:51:38,912 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:38,913 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:38,913 INFO L427 AbstractCegarLoop]: === Iteration 563 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:38,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:38,913 INFO L82 PathProgramCache]: Analyzing trace with hash 540821596, now seen corresponding path program 555 times [2020-02-10 19:51:38,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:38,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390139408] [2020-02-10 19:51:38,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:38,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:39,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 19:51:39,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390139408] [2020-02-10 19:51:39,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:39,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:51:39,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314760454] [2020-02-10 19:51:39,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:51:39,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:39,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:51:39,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:39,440 INFO L87 Difference]: Start difference. First operand 1570 states and 7035 transitions. Second operand 11 states. [2020-02-10 19:51:39,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:39,704 INFO L93 Difference]: Finished difference Result 2933 states and 11677 transitions. [2020-02-10 19:51:39,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:51:39,705 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:51:39,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:39,712 INFO L225 Difference]: With dead ends: 2933 [2020-02-10 19:51:39,712 INFO L226 Difference]: Without dead ends: 2918 [2020-02-10 19:51:39,712 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:51:39,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2918 states. [2020-02-10 19:51:39,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2918 to 1574. [2020-02-10 19:51:39,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 19:51:39,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7042 transitions. [2020-02-10 19:51:39,779 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7042 transitions. Word has length 28 [2020-02-10 19:51:39,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:39,779 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7042 transitions. [2020-02-10 19:51:39,779 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:51:39,779 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7042 transitions. [2020-02-10 19:51:39,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:51:39,782 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:39,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] [2020-02-10 19:51:39,782 INFO L427 AbstractCegarLoop]: === Iteration 564 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:39,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:39,782 INFO L82 PathProgramCache]: Analyzing trace with hash 714069288, now seen corresponding path program 556 times [2020-02-10 19:51:39,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:39,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592995568] [2020-02-10 19:51:39,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:39,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:40,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 19:51:40,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592995568] [2020-02-10 19:51:40,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:40,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:51:40,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775340029] [2020-02-10 19:51:40,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:51:40,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:40,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:51:40,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:40,303 INFO L87 Difference]: Start difference. First operand 1574 states and 7042 transitions. Second operand 11 states. [2020-02-10 19:51:40,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:40,548 INFO L93 Difference]: Finished difference Result 2932 states and 11671 transitions. [2020-02-10 19:51:40,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:51:40,548 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:51:40,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:40,555 INFO L225 Difference]: With dead ends: 2932 [2020-02-10 19:51:40,555 INFO L226 Difference]: Without dead ends: 2914 [2020-02-10 19:51:40,556 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:51:40,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2914 states. [2020-02-10 19:51:40,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2914 to 1570. [2020-02-10 19:51:40,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 19:51:40,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7031 transitions. [2020-02-10 19:51:40,622 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7031 transitions. Word has length 28 [2020-02-10 19:51:40,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:40,622 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7031 transitions. [2020-02-10 19:51:40,622 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:51:40,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7031 transitions. [2020-02-10 19:51:40,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:51:40,625 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:40,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] [2020-02-10 19:51:40,625 INFO L427 AbstractCegarLoop]: === Iteration 565 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:40,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:40,625 INFO L82 PathProgramCache]: Analyzing trace with hash -982182628, now seen corresponding path program 557 times [2020-02-10 19:51:40,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:40,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904511581] [2020-02-10 19:51:40,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:40,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:41,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:41,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904511581] [2020-02-10 19:51:41,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:41,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:51:41,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707775491] [2020-02-10 19:51:41,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:51:41,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:41,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:51:41,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:41,157 INFO L87 Difference]: Start difference. First operand 1570 states and 7031 transitions. Second operand 11 states. [2020-02-10 19:51:41,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:41,421 INFO L93 Difference]: Finished difference Result 2939 states and 11685 transitions. [2020-02-10 19:51:41,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:51:41,421 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:51:41,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:41,428 INFO L225 Difference]: With dead ends: 2939 [2020-02-10 19:51:41,428 INFO L226 Difference]: Without dead ends: 2921 [2020-02-10 19:51:41,428 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:51:41,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2921 states. [2020-02-10 19:51:41,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2921 to 1574. [2020-02-10 19:51:41,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 19:51:41,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7038 transitions. [2020-02-10 19:51:41,498 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7038 transitions. Word has length 28 [2020-02-10 19:51:41,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:41,498 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7038 transitions. [2020-02-10 19:51:41,498 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:51:41,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7038 transitions. [2020-02-10 19:51:41,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:51:41,500 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:41,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] [2020-02-10 19:51:41,500 INFO L427 AbstractCegarLoop]: === Iteration 566 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:41,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:41,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1251924866, now seen corresponding path program 558 times [2020-02-10 19:51:41,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:41,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252285640] [2020-02-10 19:51:41,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:41,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:42,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:42,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252285640] [2020-02-10 19:51:42,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:42,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:51:42,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858341633] [2020-02-10 19:51:42,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:51:42,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:42,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:51:42,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:42,013 INFO L87 Difference]: Start difference. First operand 1574 states and 7038 transitions. Second operand 11 states. [2020-02-10 19:51:42,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:42,277 INFO L93 Difference]: Finished difference Result 2935 states and 11673 transitions. [2020-02-10 19:51:42,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:51:42,277 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:51:42,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:42,284 INFO L225 Difference]: With dead ends: 2935 [2020-02-10 19:51:42,284 INFO L226 Difference]: Without dead ends: 2913 [2020-02-10 19:51:42,284 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:51:42,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2913 states. [2020-02-10 19:51:42,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2913 to 1566. [2020-02-10 19:51:42,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1566 states. [2020-02-10 19:51:42,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 7020 transitions. [2020-02-10 19:51:42,352 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 7020 transitions. Word has length 28 [2020-02-10 19:51:42,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:42,352 INFO L479 AbstractCegarLoop]: Abstraction has 1566 states and 7020 transitions. [2020-02-10 19:51:42,352 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:51:42,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 7020 transitions. [2020-02-10 19:51:42,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:51:42,355 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:42,355 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:42,355 INFO L427 AbstractCegarLoop]: === Iteration 567 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:42,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:42,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1097057606, now seen corresponding path program 559 times [2020-02-10 19:51:42,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:42,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935445197] [2020-02-10 19:51:42,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:42,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:42,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:42,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935445197] [2020-02-10 19:51:42,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:42,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:51:42,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900112653] [2020-02-10 19:51:42,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:51:42,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:42,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:51:42,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:42,878 INFO L87 Difference]: Start difference. First operand 1566 states and 7020 transitions. Second operand 11 states. [2020-02-10 19:51:43,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:43,146 INFO L93 Difference]: Finished difference Result 2946 states and 11710 transitions. [2020-02-10 19:51:43,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:51:43,147 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:51:43,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:43,154 INFO L225 Difference]: With dead ends: 2946 [2020-02-10 19:51:43,154 INFO L226 Difference]: Without dead ends: 2931 [2020-02-10 19:51:43,155 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:51:43,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2931 states. [2020-02-10 19:51:43,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2931 to 1576. [2020-02-10 19:51:43,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 19:51:43,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7048 transitions. [2020-02-10 19:51:43,221 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7048 transitions. Word has length 28 [2020-02-10 19:51:43,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:43,221 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7048 transitions. [2020-02-10 19:51:43,221 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:51:43,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7048 transitions. [2020-02-10 19:51:43,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:51:43,224 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:43,224 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:43,224 INFO L427 AbstractCegarLoop]: === Iteration 568 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:43,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:43,224 INFO L82 PathProgramCache]: Analyzing trace with hash -963802196, now seen corresponding path program 560 times [2020-02-10 19:51:43,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:43,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528802600] [2020-02-10 19:51:43,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:43,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:43,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:43,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528802600] [2020-02-10 19:51:43,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:43,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:51:43,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620919237] [2020-02-10 19:51:43,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:51:43,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:43,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:51:43,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:43,743 INFO L87 Difference]: Start difference. First operand 1576 states and 7048 transitions. Second operand 11 states. [2020-02-10 19:51:44,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:44,005 INFO L93 Difference]: Finished difference Result 2949 states and 11711 transitions. [2020-02-10 19:51:44,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:51:44,006 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:51:44,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:44,014 INFO L225 Difference]: With dead ends: 2949 [2020-02-10 19:51:44,014 INFO L226 Difference]: Without dead ends: 2926 [2020-02-10 19:51:44,014 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:51:44,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2926 states. [2020-02-10 19:51:44,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2926 to 1571. [2020-02-10 19:51:44,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 19:51:44,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7034 transitions. [2020-02-10 19:51:44,081 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7034 transitions. Word has length 28 [2020-02-10 19:51:44,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:44,081 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7034 transitions. [2020-02-10 19:51:44,081 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:51:44,081 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7034 transitions. [2020-02-10 19:51:44,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:51:44,083 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:44,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] [2020-02-10 19:51:44,083 INFO L427 AbstractCegarLoop]: === Iteration 569 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:44,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:44,084 INFO L82 PathProgramCache]: Analyzing trace with hash 561827804, now seen corresponding path program 561 times [2020-02-10 19:51:44,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:44,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837712277] [2020-02-10 19:51:44,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:44,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:44,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 19:51:44,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837712277] [2020-02-10 19:51:44,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:44,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:51:44,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214070504] [2020-02-10 19:51:44,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:51:44,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:44,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:51:44,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:44,601 INFO L87 Difference]: Start difference. First operand 1571 states and 7034 transitions. Second operand 11 states. [2020-02-10 19:51:44,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:44,773 INFO L93 Difference]: Finished difference Result 2945 states and 11703 transitions. [2020-02-10 19:51:44,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:51:44,773 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:51:44,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:44,781 INFO L225 Difference]: With dead ends: 2945 [2020-02-10 19:51:44,781 INFO L226 Difference]: Without dead ends: 2930 [2020-02-10 19:51:44,781 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:51:44,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2020-02-10 19:51:44,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 1576. [2020-02-10 19:51:44,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 19:51:44,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7043 transitions. [2020-02-10 19:51:44,850 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7043 transitions. Word has length 28 [2020-02-10 19:51:44,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:44,850 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7043 transitions. [2020-02-10 19:51:44,850 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:51:44,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7043 transitions. [2020-02-10 19:51:44,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:51:44,853 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:44,853 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:44,853 INFO L427 AbstractCegarLoop]: === Iteration 570 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:44,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:44,853 INFO L82 PathProgramCache]: Analyzing trace with hash -2070486804, now seen corresponding path program 562 times [2020-02-10 19:51:44,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:44,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117549780] [2020-02-10 19:51:44,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:44,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51: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 19:51:45,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117549780] [2020-02-10 19:51:45,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:45,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:51:45,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501892197] [2020-02-10 19:51:45,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:51:45,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:45,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:51:45,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:45,370 INFO L87 Difference]: Start difference. First operand 1576 states and 7043 transitions. Second operand 11 states. [2020-02-10 19:51:45,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:45,547 INFO L93 Difference]: Finished difference Result 2947 states and 11702 transitions. [2020-02-10 19:51:45,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:51:45,548 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:51:45,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:45,555 INFO L225 Difference]: With dead ends: 2947 [2020-02-10 19:51:45,555 INFO L226 Difference]: Without dead ends: 2925 [2020-02-10 19:51:45,556 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:51:45,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2925 states. [2020-02-10 19:51:45,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2925 to 1571. [2020-02-10 19:51:45,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 19:51:45,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7029 transitions. [2020-02-10 19:51:45,622 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7029 transitions. Word has length 28 [2020-02-10 19:51:45,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:45,622 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7029 transitions. [2020-02-10 19:51:45,622 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:51:45,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7029 transitions. [2020-02-10 19:51:45,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:51:45,625 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:45,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] [2020-02-10 19:51:45,625 INFO L427 AbstractCegarLoop]: === Iteration 571 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:45,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:45,625 INFO L82 PathProgramCache]: Analyzing trace with hash -961176420, now seen corresponding path program 563 times [2020-02-10 19:51:45,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:45,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916339491] [2020-02-10 19:51:45,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:45,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:46,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 19:51:46,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916339491] [2020-02-10 19:51:46,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:46,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:51:46,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024193157] [2020-02-10 19:51:46,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:51:46,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:46,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:51:46,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:46,150 INFO L87 Difference]: Start difference. First operand 1571 states and 7029 transitions. Second operand 11 states. [2020-02-10 19:51:46,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:46,323 INFO L93 Difference]: Finished difference Result 2953 states and 11716 transitions. [2020-02-10 19:51:46,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:51:46,323 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:51:46,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:46,331 INFO L225 Difference]: With dead ends: 2953 [2020-02-10 19:51:46,331 INFO L226 Difference]: Without dead ends: 2935 [2020-02-10 19:51:46,331 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:51:46,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2935 states. [2020-02-10 19:51:46,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2935 to 1578. [2020-02-10 19:51:46,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 19:51:46,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7042 transitions. [2020-02-10 19:51:46,403 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7042 transitions. Word has length 28 [2020-02-10 19:51:46,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:46,403 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7042 transitions. [2020-02-10 19:51:46,403 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:51:46,403 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7042 transitions. [2020-02-10 19:51:46,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:51:46,406 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:46,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] [2020-02-10 19:51:46,406 INFO L427 AbstractCegarLoop]: === Iteration 572 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:46,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:46,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1532631226, now seen corresponding path program 564 times [2020-02-10 19:51:46,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:46,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993854094] [2020-02-10 19:51:46,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:46,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:46,950 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 31 [2020-02-10 19:51:46,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 19:51:46,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993854094] [2020-02-10 19:51:46,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:46,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:51:46,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993290447] [2020-02-10 19:51:46,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:51:46,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:46,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:51:46,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:46,958 INFO L87 Difference]: Start difference. First operand 1578 states and 7042 transitions. Second operand 11 states. [2020-02-10 19:51:47,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:47,135 INFO L93 Difference]: Finished difference Result 2952 states and 11707 transitions. [2020-02-10 19:51:47,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:51:47,136 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:51:47,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:47,143 INFO L225 Difference]: With dead ends: 2952 [2020-02-10 19:51:47,143 INFO L226 Difference]: Without dead ends: 2923 [2020-02-10 19:51:47,143 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:51:47,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2923 states. [2020-02-10 19:51:47,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2923 to 1566. [2020-02-10 19:51:47,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1566 states. [2020-02-10 19:51:47,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 7016 transitions. [2020-02-10 19:51:47,210 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 7016 transitions. Word has length 28 [2020-02-10 19:51:47,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:47,210 INFO L479 AbstractCegarLoop]: Abstraction has 1566 states and 7016 transitions. [2020-02-10 19:51:47,210 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:51:47,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 7016 transitions. [2020-02-10 19:51:47,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:51:47,212 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:47,212 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:47,213 INFO L427 AbstractCegarLoop]: === Iteration 573 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:47,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:47,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1128566918, now seen corresponding path program 565 times [2020-02-10 19:51:47,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:47,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62250244] [2020-02-10 19:51:47,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:47,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:47,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:47,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62250244] [2020-02-10 19:51:47,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:47,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:51:47,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625513753] [2020-02-10 19:51:47,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:51:47,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:47,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:51:47,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:47,735 INFO L87 Difference]: Start difference. First operand 1566 states and 7016 transitions. Second operand 11 states. [2020-02-10 19:51:47,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:47,907 INFO L93 Difference]: Finished difference Result 2932 states and 11671 transitions. [2020-02-10 19:51:47,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:51:47,907 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:51:47,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:47,914 INFO L225 Difference]: With dead ends: 2932 [2020-02-10 19:51:47,914 INFO L226 Difference]: Without dead ends: 2917 [2020-02-10 19:51:47,914 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:51:47,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2917 states. [2020-02-10 19:51:47,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2917 to 1574. [2020-02-10 19:51:47,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 19:51:47,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7038 transitions. [2020-02-10 19:51:47,982 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7038 transitions. Word has length 28 [2020-02-10 19:51:47,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:47,982 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7038 transitions. [2020-02-10 19:51:47,982 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:51:47,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7038 transitions. [2020-02-10 19:51:47,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:51:47,984 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:47,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] [2020-02-10 19:51:47,984 INFO L427 AbstractCegarLoop]: === Iteration 574 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:47,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:47,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1301814610, now seen corresponding path program 566 times [2020-02-10 19:51:47,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:47,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104948013] [2020-02-10 19:51:47,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:47,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:48,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:48,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104948013] [2020-02-10 19:51:48,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:48,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:51:48,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181935612] [2020-02-10 19:51:48,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:51:48,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:48,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:51:48,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:48,514 INFO L87 Difference]: Start difference. First operand 1574 states and 7038 transitions. Second operand 11 states. [2020-02-10 19:51:48,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:48,700 INFO L93 Difference]: Finished difference Result 2931 states and 11665 transitions. [2020-02-10 19:51:48,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:51:48,701 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:51:48,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:48,708 INFO L225 Difference]: With dead ends: 2931 [2020-02-10 19:51:48,708 INFO L226 Difference]: Without dead ends: 2913 [2020-02-10 19:51:48,708 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:51:48,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2913 states. [2020-02-10 19:51:48,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2913 to 1570. [2020-02-10 19:51:48,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 19:51:48,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7027 transitions. [2020-02-10 19:51:48,775 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7027 transitions. Word has length 28 [2020-02-10 19:51:48,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:48,775 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7027 transitions. [2020-02-10 19:51:48,775 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:51:48,775 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7027 transitions. [2020-02-10 19:51:48,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:51:48,779 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:48,779 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:48,779 INFO L427 AbstractCegarLoop]: === Iteration 575 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:48,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:48,779 INFO L82 PathProgramCache]: Analyzing trace with hash 55481538, now seen corresponding path program 567 times [2020-02-10 19:51:48,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:48,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824008530] [2020-02-10 19:51:48,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:48,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:49,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 19:51:49,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824008530] [2020-02-10 19:51:49,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:49,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:51:49,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768104715] [2020-02-10 19:51:49,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:51:49,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:49,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:51:49,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:49,298 INFO L87 Difference]: Start difference. First operand 1570 states and 7027 transitions. Second operand 11 states. [2020-02-10 19:51:49,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:49,466 INFO L93 Difference]: Finished difference Result 2936 states and 11676 transitions. [2020-02-10 19:51:49,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:51:49,466 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:51:49,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:49,474 INFO L225 Difference]: With dead ends: 2936 [2020-02-10 19:51:49,474 INFO L226 Difference]: Without dead ends: 2921 [2020-02-10 19:51:49,474 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:51:49,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2921 states. [2020-02-10 19:51:49,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2921 to 1575. [2020-02-10 19:51:49,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 19:51:49,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7036 transitions. [2020-02-10 19:51:49,541 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7036 transitions. Word has length 28 [2020-02-10 19:51:49,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:49,541 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7036 transitions. [2020-02-10 19:51:49,541 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:51:49,541 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7036 transitions. [2020-02-10 19:51:49,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:51:49,544 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:49,544 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:49,544 INFO L427 AbstractCegarLoop]: === Iteration 576 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:49,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:49,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1718134226, now seen corresponding path program 568 times [2020-02-10 19:51:49,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:49,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963945151] [2020-02-10 19:51:49,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:49,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:50,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:50,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963945151] [2020-02-10 19:51:50,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:50,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:51:50,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632507200] [2020-02-10 19:51:50,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:51:50,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:50,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:51:50,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:50,062 INFO L87 Difference]: Start difference. First operand 1575 states and 7036 transitions. Second operand 11 states. [2020-02-10 19:51:50,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:50,235 INFO L93 Difference]: Finished difference Result 2938 states and 11675 transitions. [2020-02-10 19:51:50,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:51:50,236 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:51:50,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:50,243 INFO L225 Difference]: With dead ends: 2938 [2020-02-10 19:51:50,243 INFO L226 Difference]: Without dead ends: 2916 [2020-02-10 19:51:50,243 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:51:50,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2916 states. [2020-02-10 19:51:50,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2916 to 1570. [2020-02-10 19:51:50,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 19:51:50,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7023 transitions. [2020-02-10 19:51:50,312 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7023 transitions. Word has length 28 [2020-02-10 19:51:50,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:50,312 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7023 transitions. [2020-02-10 19:51:50,312 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:51:50,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7023 transitions. [2020-02-10 19:51:50,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:51:50,315 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:50,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] [2020-02-10 19:51:50,315 INFO L427 AbstractCegarLoop]: === Iteration 577 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:50,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:50,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1304440386, now seen corresponding path program 569 times [2020-02-10 19:51:50,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:50,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503341331] [2020-02-10 19:51:50,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:50,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:50,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:50,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503341331] [2020-02-10 19:51:50,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:50,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:51:50,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748681737] [2020-02-10 19:51:50,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:51:50,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:50,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:51:50,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:50,835 INFO L87 Difference]: Start difference. First operand 1570 states and 7023 transitions. Second operand 11 states. [2020-02-10 19:51:51,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:51,017 INFO L93 Difference]: Finished difference Result 2933 states and 11665 transitions. [2020-02-10 19:51:51,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:51:51,018 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:51:51,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:51,025 INFO L225 Difference]: With dead ends: 2933 [2020-02-10 19:51:51,025 INFO L226 Difference]: Without dead ends: 2919 [2020-02-10 19:51:51,025 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:51:51,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2919 states. [2020-02-10 19:51:51,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2919 to 1574. [2020-02-10 19:51:51,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 19:51:51,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7030 transitions. [2020-02-10 19:51:51,092 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7030 transitions. Word has length 28 [2020-02-10 19:51:51,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:51,093 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7030 transitions. [2020-02-10 19:51:51,093 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:51:51,093 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7030 transitions. [2020-02-10 19:51:51,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:51:51,095 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:51,095 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:51,095 INFO L427 AbstractCegarLoop]: === Iteration 578 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:51,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:51,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1501121914, now seen corresponding path program 570 times [2020-02-10 19:51:51,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:51,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529204951] [2020-02-10 19:51:51,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:51,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:51,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:51,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529204951] [2020-02-10 19:51:51,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:51,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:51:51,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611387931] [2020-02-10 19:51:51,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:51:51,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:51,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:51:51,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:51,608 INFO L87 Difference]: Start difference. First operand 1574 states and 7030 transitions. Second operand 11 states. [2020-02-10 19:51:51,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:51,799 INFO L93 Difference]: Finished difference Result 2936 states and 11667 transitions. [2020-02-10 19:51:51,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:51:51,800 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:51:51,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:51,806 INFO L225 Difference]: With dead ends: 2936 [2020-02-10 19:51:51,806 INFO L226 Difference]: Without dead ends: 2911 [2020-02-10 19:51:51,807 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:51:51,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2911 states. [2020-02-10 19:51:51,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2911 to 1566. [2020-02-10 19:51:51,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1566 states. [2020-02-10 19:51:51,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 7012 transitions. [2020-02-10 19:51:51,875 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 7012 transitions. Word has length 28 [2020-02-10 19:51:51,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:51,875 INFO L479 AbstractCegarLoop]: Abstraction has 1566 states and 7012 transitions. [2020-02-10 19:51:51,875 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:51:51,875 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 7012 transitions. [2020-02-10 19:51:51,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:51:51,878 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:51,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] [2020-02-10 19:51:51,878 INFO L427 AbstractCegarLoop]: === Iteration 579 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:51,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:51,878 INFO L82 PathProgramCache]: Analyzing trace with hash -900783572, now seen corresponding path program 571 times [2020-02-10 19:51:51,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:51,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618670852] [2020-02-10 19:51:51,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:51,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:52,391 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 19:51:52,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:52,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618670852] [2020-02-10 19:51:52,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:52,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:51:52,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208952853] [2020-02-10 19:51:52,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:51:52,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:52,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:51:52,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:52,399 INFO L87 Difference]: Start difference. First operand 1566 states and 7012 transitions. Second operand 11 states. [2020-02-10 19:51:52,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:52,576 INFO L93 Difference]: Finished difference Result 2943 states and 11691 transitions. [2020-02-10 19:51:52,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:51:52,576 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:51:52,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:52,584 INFO L225 Difference]: With dead ends: 2943 [2020-02-10 19:51:52,584 INFO L226 Difference]: Without dead ends: 2925 [2020-02-10 19:51:52,584 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:51:52,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2925 states. [2020-02-10 19:51:52,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2925 to 1574. [2020-02-10 19:51:52,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 19:51:52,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7034 transitions. [2020-02-10 19:51:52,674 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7034 transitions. Word has length 28 [2020-02-10 19:51:52,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:52,675 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7034 transitions. [2020-02-10 19:51:52,675 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:51:52,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7034 transitions. [2020-02-10 19:51:52,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:51:52,677 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:52,677 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:52,677 INFO L427 AbstractCegarLoop]: === Iteration 580 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:52,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:52,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1333323922, now seen corresponding path program 572 times [2020-02-10 19:51:52,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:52,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293739881] [2020-02-10 19:51:52,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:52,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:53,180 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 19:51:53,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 19:51:53,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293739881] [2020-02-10 19:51:53,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:53,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:51:53,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500924735] [2020-02-10 19:51:53,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:51:53,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:53,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:51:53,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:53,188 INFO L87 Difference]: Start difference. First operand 1574 states and 7034 transitions. Second operand 11 states. [2020-02-10 19:51:53,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:53,364 INFO L93 Difference]: Finished difference Result 2939 states and 11679 transitions. [2020-02-10 19:51:53,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:51:53,365 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:51:53,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:53,372 INFO L225 Difference]: With dead ends: 2939 [2020-02-10 19:51:53,372 INFO L226 Difference]: Without dead ends: 2921 [2020-02-10 19:51:53,372 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:51:53,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2921 states. [2020-02-10 19:51:53,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2921 to 1570. [2020-02-10 19:51:53,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 19:51:53,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7023 transitions. [2020-02-10 19:51:53,439 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7023 transitions. Word has length 28 [2020-02-10 19:51:53,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:53,439 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7023 transitions. [2020-02-10 19:51:53,439 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:51:53,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7023 transitions. [2020-02-10 19:51:53,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:51:53,442 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:53,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] [2020-02-10 19:51:53,442 INFO L427 AbstractCegarLoop]: === Iteration 581 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:53,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:53,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1973868952, now seen corresponding path program 573 times [2020-02-10 19:51:53,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:53,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847033254] [2020-02-10 19:51:53,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:53,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:53,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:53,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847033254] [2020-02-10 19:51:53,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:53,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:51:53,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14989910] [2020-02-10 19:51:53,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:51:53,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:53,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:51:53,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:53,972 INFO L87 Difference]: Start difference. First operand 1570 states and 7023 transitions. Second operand 11 states. [2020-02-10 19:51:54,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:54,155 INFO L93 Difference]: Finished difference Result 2949 states and 11702 transitions. [2020-02-10 19:51:54,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:51:54,155 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:51:54,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:54,162 INFO L225 Difference]: With dead ends: 2949 [2020-02-10 19:51:54,163 INFO L226 Difference]: Without dead ends: 2931 [2020-02-10 19:51:54,163 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:51:54,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2931 states. [2020-02-10 19:51:54,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2931 to 1577. [2020-02-10 19:51:54,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 19:51:54,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7036 transitions. [2020-02-10 19:51:54,230 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7036 transitions. Word has length 28 [2020-02-10 19:51:54,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:54,230 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7036 transitions. [2020-02-10 19:51:54,230 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:51:54,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7036 transitions. [2020-02-10 19:51:54,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:51:54,232 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:54,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] [2020-02-10 19:51:54,232 INFO L427 AbstractCegarLoop]: === Iteration 582 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:54,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:54,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1749643538, now seen corresponding path program 574 times [2020-02-10 19:51:54,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:54,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959407112] [2020-02-10 19:51:54,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:54,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:54,749 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 19:51:54,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:54,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959407112] [2020-02-10 19:51:54,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:54,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:51:54,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135328250] [2020-02-10 19:51:54,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:51:54,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:54,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:51:54,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:54,757 INFO L87 Difference]: Start difference. First operand 1577 states and 7036 transitions. Second operand 11 states. [2020-02-10 19:51:54,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:54,933 INFO L93 Difference]: Finished difference Result 2948 states and 11693 transitions. [2020-02-10 19:51:54,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:51:54,933 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:51:54,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:54,940 INFO L225 Difference]: With dead ends: 2948 [2020-02-10 19:51:54,940 INFO L226 Difference]: Without dead ends: 2924 [2020-02-10 19:51:54,940 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:51:54,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2924 states. [2020-02-10 19:51:55,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2924 to 1570. [2020-02-10 19:51:55,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 19:51:55,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7019 transitions. [2020-02-10 19:51:55,009 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7019 transitions. Word has length 28 [2020-02-10 19:51:55,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:55,009 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7019 transitions. [2020-02-10 19:51:55,009 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:51:55,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7019 transitions. [2020-02-10 19:51:55,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:51:55,012 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:55,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] [2020-02-10 19:51:55,012 INFO L427 AbstractCegarLoop]: === Iteration 583 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:55,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:55,012 INFO L82 PathProgramCache]: Analyzing trace with hash 798094120, now seen corresponding path program 575 times [2020-02-10 19:51:55,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:55,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178175295] [2020-02-10 19:51:55,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:55,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:55,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:55,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178175295] [2020-02-10 19:51:55,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:55,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:51:55,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725077023] [2020-02-10 19:51:55,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:51:55,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:55,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:51:55,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:55,531 INFO L87 Difference]: Start difference. First operand 1570 states and 7019 transitions. Second operand 11 states. [2020-02-10 19:51:55,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:55,736 INFO L93 Difference]: Finished difference Result 2938 states and 11673 transitions. [2020-02-10 19:51:55,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:51:55,737 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:51:55,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:55,744 INFO L225 Difference]: With dead ends: 2938 [2020-02-10 19:51:55,744 INFO L226 Difference]: Without dead ends: 2924 [2020-02-10 19:51:55,744 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:51:55,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2924 states. [2020-02-10 19:51:55,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2924 to 1574. [2020-02-10 19:51:55,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 19:51:55,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7026 transitions. [2020-02-10 19:51:55,813 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7026 transitions. Word has length 28 [2020-02-10 19:51:55,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:55,813 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7026 transitions. [2020-02-10 19:51:55,813 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:51:55,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7026 transitions. [2020-02-10 19:51:55,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:51:55,815 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:55,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] [2020-02-10 19:51:55,815 INFO L427 AbstractCegarLoop]: === Iteration 584 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:55,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:55,816 INFO L82 PathProgramCache]: Analyzing trace with hash -2007468180, now seen corresponding path program 576 times [2020-02-10 19:51:55,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:55,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156698624] [2020-02-10 19:51:55,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:55,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:56,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:56,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156698624] [2020-02-10 19:51:56,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:56,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:51:56,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752032062] [2020-02-10 19:51:56,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:51:56,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:56,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:51:56,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:56,327 INFO L87 Difference]: Start difference. First operand 1574 states and 7026 transitions. Second operand 11 states. [2020-02-10 19:51:56,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:56,531 INFO L93 Difference]: Finished difference Result 2941 states and 11675 transitions. [2020-02-10 19:51:56,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:51:56,532 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:51:56,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:56,539 INFO L225 Difference]: With dead ends: 2941 [2020-02-10 19:51:56,539 INFO L226 Difference]: Without dead ends: 2912 [2020-02-10 19:51:56,539 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:51:56,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2912 states. [2020-02-10 19:51:56,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2912 to 1562. [2020-02-10 19:51:56,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1562 states. [2020-02-10 19:51:56,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1562 states to 1562 states and 7001 transitions. [2020-02-10 19:51:56,608 INFO L78 Accepts]: Start accepts. Automaton has 1562 states and 7001 transitions. Word has length 28 [2020-02-10 19:51:56,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:56,608 INFO L479 AbstractCegarLoop]: Abstraction has 1562 states and 7001 transitions. [2020-02-10 19:51:56,609 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:51:56,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1562 states and 7001 transitions. [2020-02-10 19:51:56,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:51:56,611 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:56,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] [2020-02-10 19:51:56,611 INFO L427 AbstractCegarLoop]: === Iteration 585 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:56,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:56,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1070478082, now seen corresponding path program 577 times [2020-02-10 19:51:56,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:56,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479217922] [2020-02-10 19:51:56,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:56,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:57,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:51:57,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479217922] [2020-02-10 19:51:57,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:57,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:51:57,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067345370] [2020-02-10 19:51:57,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:51:57,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:57,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:51:57,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:57,148 INFO L87 Difference]: Start difference. First operand 1562 states and 7001 transitions. Second operand 11 states. [2020-02-10 19:51:57,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:57,346 INFO L93 Difference]: Finished difference Result 2991 states and 11808 transitions. [2020-02-10 19:51:57,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:51:57,346 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:51:57,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:57,354 INFO L225 Difference]: With dead ends: 2991 [2020-02-10 19:51:57,354 INFO L226 Difference]: Without dead ends: 2971 [2020-02-10 19:51:57,354 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:51:57,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2971 states. [2020-02-10 19:51:57,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2971 to 1585. [2020-02-10 19:51:57,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1585 states. [2020-02-10 19:51:57,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 7066 transitions. [2020-02-10 19:51:57,425 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 7066 transitions. Word has length 28 [2020-02-10 19:51:57,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:57,425 INFO L479 AbstractCegarLoop]: Abstraction has 1585 states and 7066 transitions. [2020-02-10 19:51:57,425 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:51:57,425 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 7066 transitions. [2020-02-10 19:51:57,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:51:57,428 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:57,428 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:57,428 INFO L427 AbstractCegarLoop]: === Iteration 586 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:57,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:57,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1815180580, now seen corresponding path program 578 times [2020-02-10 19:51:57,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:57,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856257120] [2020-02-10 19:51:57,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:57,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:57,977 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 19:51:57,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 19:51:57,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856257120] [2020-02-10 19:51:57,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:57,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:51:57,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639852528] [2020-02-10 19:51:57,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:51:57,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:57,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:51:57,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:57,985 INFO L87 Difference]: Start difference. First operand 1585 states and 7066 transitions. Second operand 11 states. [2020-02-10 19:51:58,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:58,168 INFO L93 Difference]: Finished difference Result 2989 states and 11796 transitions. [2020-02-10 19:51:58,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:51:58,168 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:51:58,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:58,175 INFO L225 Difference]: With dead ends: 2989 [2020-02-10 19:51:58,175 INFO L226 Difference]: Without dead ends: 2961 [2020-02-10 19:51:58,176 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:51:58,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2961 states. [2020-02-10 19:51:58,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2961 to 1575. [2020-02-10 19:51:58,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 19:51:58,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7043 transitions. [2020-02-10 19:51:58,243 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7043 transitions. Word has length 28 [2020-02-10 19:51:58,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:58,244 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7043 transitions. [2020-02-10 19:51:58,244 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:51:58,244 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7043 transitions. [2020-02-10 19:51:58,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:51:58,246 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:58,246 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:58,246 INFO L427 AbstractCegarLoop]: === Iteration 587 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:58,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:58,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1608333660, now seen corresponding path program 579 times [2020-02-10 19:51:58,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:58,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856405803] [2020-02-10 19:51:58,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:58,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:58,793 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 19:51:58,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 19:51:58,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856405803] [2020-02-10 19:51:58,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:58,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:51:58,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217492203] [2020-02-10 19:51:58,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:51:58,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:58,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:51:58,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:58,801 INFO L87 Difference]: Start difference. First operand 1575 states and 7043 transitions. Second operand 11 states. [2020-02-10 19:51:58,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:58,941 INFO L93 Difference]: Finished difference Result 2982 states and 11781 transitions. [2020-02-10 19:51:58,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:51:58,942 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:51:58,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:58,949 INFO L225 Difference]: With dead ends: 2982 [2020-02-10 19:51:58,949 INFO L226 Difference]: Without dead ends: 2962 [2020-02-10 19:51:58,950 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:51:58,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2962 states. [2020-02-10 19:51:59,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2962 to 1580. [2020-02-10 19:51:59,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 19:51:59,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7051 transitions. [2020-02-10 19:51:59,017 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7051 transitions. Word has length 28 [2020-02-10 19:51:59,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:59,017 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7051 transitions. [2020-02-10 19:51:59,017 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:51:59,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7051 transitions. [2020-02-10 19:51:59,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:51:59,019 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:59,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] [2020-02-10 19:51:59,019 INFO L427 AbstractCegarLoop]: === Iteration 588 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:59,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:59,020 INFO L82 PathProgramCache]: Analyzing trace with hash 292176356, now seen corresponding path program 580 times [2020-02-10 19:51:59,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:59,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362688950] [2020-02-10 19:51:59,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:59,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:51:59,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 19:51:59,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362688950] [2020-02-10 19:51:59,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:51:59,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:51:59,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794392485] [2020-02-10 19:51:59,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:51:59,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:51:59,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:51:59,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:51:59,540 INFO L87 Difference]: Start difference. First operand 1580 states and 7051 transitions. Second operand 11 states. [2020-02-10 19:51:59,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:51:59,754 INFO L93 Difference]: Finished difference Result 2976 states and 11765 transitions. [2020-02-10 19:51:59,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:51:59,755 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:51:59,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:51:59,762 INFO L225 Difference]: With dead ends: 2976 [2020-02-10 19:51:59,762 INFO L226 Difference]: Without dead ends: 2957 [2020-02-10 19:51:59,762 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:51:59,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2957 states. [2020-02-10 19:51:59,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2957 to 1575. [2020-02-10 19:51:59,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 19:51:59,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7038 transitions. [2020-02-10 19:51:59,829 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7038 transitions. Word has length 28 [2020-02-10 19:51:59,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:51:59,829 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7038 transitions. [2020-02-10 19:51:59,829 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:51:59,830 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7038 transitions. [2020-02-10 19:51:59,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:51:59,832 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:51:59,832 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:51:59,832 INFO L427 AbstractCegarLoop]: === Iteration 589 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:51:59,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:51:59,832 INFO L82 PathProgramCache]: Analyzing trace with hash -330990180, now seen corresponding path program 581 times [2020-02-10 19:51:59,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:51:59,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741007141] [2020-02-10 19:51:59,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:51:59,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:00,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 19:52:00,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741007141] [2020-02-10 19:52:00,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:00,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:52:00,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610278686] [2020-02-10 19:52:00,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:52:00,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:00,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:52:00,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:00,358 INFO L87 Difference]: Start difference. First operand 1575 states and 7038 transitions. Second operand 11 states. [2020-02-10 19:52:00,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:00,556 INFO L93 Difference]: Finished difference Result 2977 states and 11768 transitions. [2020-02-10 19:52:00,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:52:00,556 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:52:00,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:00,563 INFO L225 Difference]: With dead ends: 2977 [2020-02-10 19:52:00,563 INFO L226 Difference]: Without dead ends: 2959 [2020-02-10 19:52:00,563 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:52:00,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2959 states. [2020-02-10 19:52:00,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2959 to 1579. [2020-02-10 19:52:00,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 19:52:00,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7045 transitions. [2020-02-10 19:52:00,632 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7045 transitions. Word has length 28 [2020-02-10 19:52:00,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:00,632 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7045 transitions. [2020-02-10 19:52:00,632 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:52:00,633 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7045 transitions. [2020-02-10 19:52:00,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:52:00,635 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:00,635 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:00,635 INFO L427 AbstractCegarLoop]: === Iteration 590 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:00,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:00,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1903117314, now seen corresponding path program 582 times [2020-02-10 19:52:00,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:00,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308825809] [2020-02-10 19:52:00,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:00,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:01,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:01,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308825809] [2020-02-10 19:52:01,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:01,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:52:01,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396021480] [2020-02-10 19:52:01,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:52:01,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:01,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:52:01,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:01,143 INFO L87 Difference]: Start difference. First operand 1579 states and 7045 transitions. Second operand 11 states. [2020-02-10 19:52:01,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:01,337 INFO L93 Difference]: Finished difference Result 2973 states and 11756 transitions. [2020-02-10 19:52:01,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:52:01,338 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:52:01,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:01,345 INFO L225 Difference]: With dead ends: 2973 [2020-02-10 19:52:01,345 INFO L226 Difference]: Without dead ends: 2949 [2020-02-10 19:52:01,345 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:52:01,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2949 states. [2020-02-10 19:52:01,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2949 to 1569. [2020-02-10 19:52:01,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 19:52:01,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7023 transitions. [2020-02-10 19:52:01,414 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7023 transitions. Word has length 28 [2020-02-10 19:52:01,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:01,414 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7023 transitions. [2020-02-10 19:52:01,414 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:52:01,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7023 transitions. [2020-02-10 19:52:01,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:52:01,417 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:01,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] [2020-02-10 19:52:01,417 INFO L427 AbstractCegarLoop]: === Iteration 591 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:01,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:01,417 INFO L82 PathProgramCache]: Analyzing trace with hash -2130397626, now seen corresponding path program 583 times [2020-02-10 19:52:01,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:01,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254123721] [2020-02-10 19:52:01,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:01,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52: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 19:52:01,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254123721] [2020-02-10 19:52:01,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:01,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:52:01,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241648311] [2020-02-10 19:52:01,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:52:01,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:01,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:52:01,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:01,975 INFO L87 Difference]: Start difference. First operand 1569 states and 7023 transitions. Second operand 11 states. [2020-02-10 19:52:02,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:02,115 INFO L93 Difference]: Finished difference Result 3004 states and 11839 transitions. [2020-02-10 19:52:02,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:52:02,116 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:52:02,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:02,123 INFO L225 Difference]: With dead ends: 3004 [2020-02-10 19:52:02,124 INFO L226 Difference]: Without dead ends: 2984 [2020-02-10 19:52:02,124 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:52:02,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2984 states. [2020-02-10 19:52:02,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2984 to 1589. [2020-02-10 19:52:02,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1589 states. [2020-02-10 19:52:02,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1589 states and 7073 transitions. [2020-02-10 19:52:02,194 INFO L78 Accepts]: Start accepts. Automaton has 1589 states and 7073 transitions. Word has length 28 [2020-02-10 19:52:02,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:02,194 INFO L479 AbstractCegarLoop]: Abstraction has 1589 states and 7073 transitions. [2020-02-10 19:52:02,194 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:52:02,194 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 7073 transitions. [2020-02-10 19:52:02,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:52:02,196 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:02,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] [2020-02-10 19:52:02,196 INFO L427 AbstractCegarLoop]: === Iteration 592 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:02,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:02,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1385695128, now seen corresponding path program 584 times [2020-02-10 19:52:02,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:02,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279215907] [2020-02-10 19:52:02,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:02,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:02,744 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 19:52:02,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:02,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279215907] [2020-02-10 19:52:02,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:02,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:52:02,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764047904] [2020-02-10 19:52:02,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:52:02,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:02,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:52:02,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:02,752 INFO L87 Difference]: Start difference. First operand 1589 states and 7073 transitions. Second operand 11 states. [2020-02-10 19:52:02,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:02,957 INFO L93 Difference]: Finished difference Result 3002 states and 11827 transitions. [2020-02-10 19:52:02,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:52:02,957 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:52:02,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:02,964 INFO L225 Difference]: With dead ends: 3002 [2020-02-10 19:52:02,964 INFO L226 Difference]: Without dead ends: 2974 [2020-02-10 19:52:02,964 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:52:03,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2974 states. [2020-02-10 19:52:03,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2974 to 1579. [2020-02-10 19:52:03,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 19:52:03,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7047 transitions. [2020-02-10 19:52:03,032 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7047 transitions. Word has length 28 [2020-02-10 19:52:03,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:03,032 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7047 transitions. [2020-02-10 19:52:03,032 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:52:03,032 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7047 transitions. [2020-02-10 19:52:03,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:52:03,034 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:03,034 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:03,034 INFO L427 AbstractCegarLoop]: === Iteration 593 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:03,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:03,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1629339868, now seen corresponding path program 585 times [2020-02-10 19:52:03,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:03,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868829504] [2020-02-10 19:52:03,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:03,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:03,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 19:52:03,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868829504] [2020-02-10 19:52:03,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:03,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:52:03,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386283987] [2020-02-10 19:52:03,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:52:03,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:03,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:52:03,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:03,573 INFO L87 Difference]: Start difference. First operand 1579 states and 7047 transitions. Second operand 11 states. [2020-02-10 19:52:03,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:03,709 INFO L93 Difference]: Finished difference Result 3001 states and 11824 transitions. [2020-02-10 19:52:03,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:52:03,709 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:52:03,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:03,717 INFO L225 Difference]: With dead ends: 3001 [2020-02-10 19:52:03,717 INFO L226 Difference]: Without dead ends: 2981 [2020-02-10 19:52:03,717 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:52:03,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2981 states. [2020-02-10 19:52:03,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2981 to 1587. [2020-02-10 19:52:03,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1587 states. [2020-02-10 19:52:03,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 7061 transitions. [2020-02-10 19:52:03,784 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 7061 transitions. Word has length 28 [2020-02-10 19:52:03,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:03,784 INFO L479 AbstractCegarLoop]: Abstraction has 1587 states and 7061 transitions. [2020-02-10 19:52:03,784 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:52:03,784 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 7061 transitions. [2020-02-10 19:52:03,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:52:03,787 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:03,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] [2020-02-10 19:52:03,787 INFO L427 AbstractCegarLoop]: === Iteration 594 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:03,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:03,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1802587560, now seen corresponding path program 586 times [2020-02-10 19:52:03,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:03,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901507790] [2020-02-10 19:52:03,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:03,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:04,324 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 19:52:04,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 19:52:04,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901507790] [2020-02-10 19:52:04,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:04,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:52:04,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479455971] [2020-02-10 19:52:04,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:52:04,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:04,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:52:04,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:04,332 INFO L87 Difference]: Start difference. First operand 1587 states and 7061 transitions. Second operand 11 states. [2020-02-10 19:52:04,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:04,521 INFO L93 Difference]: Finished difference Result 2998 states and 11811 transitions. [2020-02-10 19:52:04,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:52:04,522 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:52:04,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:04,529 INFO L225 Difference]: With dead ends: 2998 [2020-02-10 19:52:04,529 INFO L226 Difference]: Without dead ends: 2973 [2020-02-10 19:52:04,529 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:52:04,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2973 states. [2020-02-10 19:52:04,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2973 to 1579. [2020-02-10 19:52:04,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 19:52:04,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7039 transitions. [2020-02-10 19:52:04,598 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7039 transitions. Word has length 28 [2020-02-10 19:52:04,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:04,598 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7039 transitions. [2020-02-10 19:52:04,598 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:52:04,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7039 transitions. [2020-02-10 19:52:04,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:52:04,601 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:04,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] [2020-02-10 19:52:04,601 INFO L427 AbstractCegarLoop]: === Iteration 595 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:04,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:04,601 INFO L82 PathProgramCache]: Analyzing trace with hash -309983972, now seen corresponding path program 587 times [2020-02-10 19:52:04,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:04,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338233275] [2020-02-10 19:52:04,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:04,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:05,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:05,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338233275] [2020-02-10 19:52:05,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:05,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:52:05,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491838475] [2020-02-10 19:52:05,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:52:05,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:05,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:52:05,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:05,143 INFO L87 Difference]: Start difference. First operand 1579 states and 7039 transitions. Second operand 11 states. [2020-02-10 19:52:05,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:05,371 INFO L93 Difference]: Finished difference Result 2996 states and 11808 transitions. [2020-02-10 19:52:05,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:52:05,371 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:52:05,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:05,379 INFO L225 Difference]: With dead ends: 2996 [2020-02-10 19:52:05,379 INFO L226 Difference]: Without dead ends: 2978 [2020-02-10 19:52:05,379 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:52:05,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2978 states. [2020-02-10 19:52:05,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2978 to 1586. [2020-02-10 19:52:05,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1586 states. [2020-02-10 19:52:05,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1586 states and 7052 transitions. [2020-02-10 19:52:05,448 INFO L78 Accepts]: Start accepts. Automaton has 1586 states and 7052 transitions. Word has length 28 [2020-02-10 19:52:05,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:05,448 INFO L479 AbstractCegarLoop]: Abstraction has 1586 states and 7052 transitions. [2020-02-10 19:52:05,448 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:52:05,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1586 states and 7052 transitions. [2020-02-10 19:52:05,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:52:05,450 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:05,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] [2020-02-10 19:52:05,450 INFO L427 AbstractCegarLoop]: === Iteration 596 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:05,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:05,450 INFO L82 PathProgramCache]: Analyzing trace with hash -881438778, now seen corresponding path program 588 times [2020-02-10 19:52:05,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:05,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929903753] [2020-02-10 19:52:05,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:05,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:05,987 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 19:52:05,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 19:52:05,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929903753] [2020-02-10 19:52:05,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:05,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:52:05,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751256537] [2020-02-10 19:52:05,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:52:05,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:05,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:52:05,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:05,996 INFO L87 Difference]: Start difference. First operand 1586 states and 7052 transitions. Second operand 11 states. [2020-02-10 19:52:06,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:06,175 INFO L93 Difference]: Finished difference Result 2995 states and 11799 transitions. [2020-02-10 19:52:06,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:52:06,176 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:52:06,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:06,183 INFO L225 Difference]: With dead ends: 2995 [2020-02-10 19:52:06,183 INFO L226 Difference]: Without dead ends: 2961 [2020-02-10 19:52:06,183 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:52:06,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2961 states. [2020-02-10 19:52:06,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2961 to 1569. [2020-02-10 19:52:06,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 19:52:06,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7016 transitions. [2020-02-10 19:52:06,250 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7016 transitions. Word has length 28 [2020-02-10 19:52:06,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:06,250 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7016 transitions. [2020-02-10 19:52:06,250 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:52:06,250 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7016 transitions. [2020-02-10 19:52:06,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:52:06,253 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:06,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] [2020-02-10 19:52:06,253 INFO L427 AbstractCegarLoop]: === Iteration 597 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:06,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:06,253 INFO L82 PathProgramCache]: Analyzing trace with hash -2098888314, now seen corresponding path program 589 times [2020-02-10 19:52:06,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:06,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629658205] [2020-02-10 19:52:06,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:06,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:06,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:06,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629658205] [2020-02-10 19:52:06,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:06,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:52:06,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683172591] [2020-02-10 19:52:06,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:52:06,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:06,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:52:06,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:06,785 INFO L87 Difference]: Start difference. First operand 1569 states and 7016 transitions. Second operand 11 states. [2020-02-10 19:52:06,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:06,925 INFO L93 Difference]: Finished difference Result 2978 states and 11766 transitions. [2020-02-10 19:52:06,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:52:06,926 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:52:06,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:06,933 INFO L225 Difference]: With dead ends: 2978 [2020-02-10 19:52:06,934 INFO L226 Difference]: Without dead ends: 2958 [2020-02-10 19:52:06,934 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:52:06,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2958 states. [2020-02-10 19:52:06,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2958 to 1579. [2020-02-10 19:52:06,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 19:52:07,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7042 transitions. [2020-02-10 19:52:07,003 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7042 transitions. Word has length 28 [2020-02-10 19:52:07,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:07,003 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7042 transitions. [2020-02-10 19:52:07,003 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:52:07,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7042 transitions. [2020-02-10 19:52:07,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:52:07,006 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:07,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] [2020-02-10 19:52:07,006 INFO L427 AbstractCegarLoop]: === Iteration 598 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:07,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:07,006 INFO L82 PathProgramCache]: Analyzing trace with hash 879921678, now seen corresponding path program 590 times [2020-02-10 19:52:07,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:07,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591435201] [2020-02-10 19:52:07,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:07,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:07,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:07,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591435201] [2020-02-10 19:52:07,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:07,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:52:07,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788541978] [2020-02-10 19:52:07,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:52:07,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:07,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:52:07,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:07,530 INFO L87 Difference]: Start difference. First operand 1579 states and 7042 transitions. Second operand 11 states. [2020-02-10 19:52:07,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:07,715 INFO L93 Difference]: Finished difference Result 2972 states and 11750 transitions. [2020-02-10 19:52:07,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:52:07,715 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:52:07,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:07,723 INFO L225 Difference]: With dead ends: 2972 [2020-02-10 19:52:07,723 INFO L226 Difference]: Without dead ends: 2953 [2020-02-10 19:52:07,723 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:52:07,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2953 states. [2020-02-10 19:52:07,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2953 to 1574. [2020-02-10 19:52:07,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 19:52:07,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7029 transitions. [2020-02-10 19:52:07,805 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7029 transitions. Word has length 28 [2020-02-10 19:52:07,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:07,805 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7029 transitions. [2020-02-10 19:52:07,805 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:52:07,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7029 transitions. [2020-02-10 19:52:07,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:52:07,807 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:07,807 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:07,808 INFO L427 AbstractCegarLoop]: === Iteration 599 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:07,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:07,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1122993602, now seen corresponding path program 591 times [2020-02-10 19:52:07,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:07,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965896146] [2020-02-10 19:52:07,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:07,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:08,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:08,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965896146] [2020-02-10 19:52:08,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:08,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:52:08,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633937448] [2020-02-10 19:52:08,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:52:08,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:08,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:52:08,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:08,352 INFO L87 Difference]: Start difference. First operand 1574 states and 7029 transitions. Second operand 11 states. [2020-02-10 19:52:08,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:08,530 INFO L93 Difference]: Finished difference Result 2984 states and 11776 transitions. [2020-02-10 19:52:08,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:52:08,531 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:52:08,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:08,539 INFO L225 Difference]: With dead ends: 2984 [2020-02-10 19:52:08,539 INFO L226 Difference]: Without dead ends: 2964 [2020-02-10 19:52:08,539 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:52:08,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2964 states. [2020-02-10 19:52:08,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2964 to 1582. [2020-02-10 19:52:08,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2020-02-10 19:52:08,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 7043 transitions. [2020-02-10 19:52:08,615 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 7043 transitions. Word has length 28 [2020-02-10 19:52:08,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:08,615 INFO L479 AbstractCegarLoop]: Abstraction has 1582 states and 7043 transitions. [2020-02-10 19:52:08,615 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:52:08,615 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 7043 transitions. [2020-02-10 19:52:08,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:52:08,617 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:08,618 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:08,618 INFO L427 AbstractCegarLoop]: === Iteration 600 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:08,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:08,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1296241294, now seen corresponding path program 592 times [2020-02-10 19:52:08,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:08,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33907244] [2020-02-10 19:52:08,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:08,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:09,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:09,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33907244] [2020-02-10 19:52:09,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:09,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:52:09,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82930944] [2020-02-10 19:52:09,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:52:09,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:09,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:52:09,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:09,151 INFO L87 Difference]: Start difference. First operand 1582 states and 7043 transitions. Second operand 11 states. [2020-02-10 19:52:09,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:09,354 INFO L93 Difference]: Finished difference Result 2981 states and 11763 transitions. [2020-02-10 19:52:09,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:52:09,355 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:52:09,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:09,362 INFO L225 Difference]: With dead ends: 2981 [2020-02-10 19:52:09,362 INFO L226 Difference]: Without dead ends: 2956 [2020-02-10 19:52:09,362 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:52:09,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2020-02-10 19:52:09,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 1574. [2020-02-10 19:52:09,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 19:52:09,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7024 transitions. [2020-02-10 19:52:09,430 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7024 transitions. Word has length 28 [2020-02-10 19:52:09,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:09,430 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7024 transitions. [2020-02-10 19:52:09,430 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:52:09,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7024 transitions. [2020-02-10 19:52:09,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:52:09,432 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:09,433 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:09,433 INFO L427 AbstractCegarLoop]: === Iteration 601 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:09,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:09,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1955632834, now seen corresponding path program 593 times [2020-02-10 19:52:09,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:09,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159757745] [2020-02-10 19:52:09,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:09,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:09,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 19:52:09,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159757745] [2020-02-10 19:52:09,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:09,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:52:09,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784391739] [2020-02-10 19:52:09,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:52:09,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:09,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:52:09,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:09,964 INFO L87 Difference]: Start difference. First operand 1574 states and 7024 transitions. Second operand 11 states. [2020-02-10 19:52:10,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:10,221 INFO L93 Difference]: Finished difference Result 2968 states and 11738 transitions. [2020-02-10 19:52:10,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:52:10,221 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:52:10,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:10,229 INFO L225 Difference]: With dead ends: 2968 [2020-02-10 19:52:10,229 INFO L226 Difference]: Without dead ends: 2954 [2020-02-10 19:52:10,229 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:52:10,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2020-02-10 19:52:10,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 1578. [2020-02-10 19:52:10,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 19:52:10,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7031 transitions. [2020-02-10 19:52:10,317 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7031 transitions. Word has length 28 [2020-02-10 19:52:10,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:10,317 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7031 transitions. [2020-02-10 19:52:10,317 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:52:10,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7031 transitions. [2020-02-10 19:52:10,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:52:10,320 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:10,320 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:10,320 INFO L427 AbstractCegarLoop]: === Iteration 602 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:10,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:10,320 INFO L82 PathProgramCache]: Analyzing trace with hash -849929466, now seen corresponding path program 594 times [2020-02-10 19:52:10,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:10,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764902179] [2020-02-10 19:52:10,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:10,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:10,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 19:52:10,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764902179] [2020-02-10 19:52:10,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:10,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:52:10,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771180661] [2020-02-10 19:52:10,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:52:10,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:10,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:52:10,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:10,852 INFO L87 Difference]: Start difference. First operand 1578 states and 7031 transitions. Second operand 11 states. [2020-02-10 19:52:11,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:11,045 INFO L93 Difference]: Finished difference Result 2971 states and 11740 transitions. [2020-02-10 19:52:11,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:52:11,046 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:52:11,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:11,053 INFO L225 Difference]: With dead ends: 2971 [2020-02-10 19:52:11,053 INFO L226 Difference]: Without dead ends: 2945 [2020-02-10 19:52:11,054 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:52:11,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2945 states. [2020-02-10 19:52:11,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2945 to 1569. [2020-02-10 19:52:11,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 19:52:11,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7011 transitions. [2020-02-10 19:52:11,122 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7011 transitions. Word has length 28 [2020-02-10 19:52:11,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:11,122 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7011 transitions. [2020-02-10 19:52:11,122 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:52:11,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7011 transitions. [2020-02-10 19:52:11,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:52:11,125 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:11,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] [2020-02-10 19:52:11,125 INFO L427 AbstractCegarLoop]: === Iteration 603 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:11,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:11,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1343682712, now seen corresponding path program 595 times [2020-02-10 19:52:11,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:11,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713583927] [2020-02-10 19:52:11,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:11,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:11,646 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 19:52:11,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:11,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713583927] [2020-02-10 19:52:11,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:11,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:52:11,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99687264] [2020-02-10 19:52:11,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:52:11,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:11,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:52:11,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:11,654 INFO L87 Difference]: Start difference. First operand 1569 states and 7011 transitions. Second operand 11 states. [2020-02-10 19:52:11,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:11,869 INFO L93 Difference]: Finished difference Result 2968 states and 11743 transitions. [2020-02-10 19:52:11,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:52:11,870 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:52:11,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:11,877 INFO L225 Difference]: With dead ends: 2968 [2020-02-10 19:52:11,877 INFO L226 Difference]: Without dead ends: 2950 [2020-02-10 19:52:11,877 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:52:11,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2020-02-10 19:52:11,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 1577. [2020-02-10 19:52:11,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 19:52:11,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7033 transitions. [2020-02-10 19:52:11,947 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7033 transitions. Word has length 28 [2020-02-10 19:52:11,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:11,947 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7033 transitions. [2020-02-10 19:52:11,947 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:52:11,947 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7033 transitions. [2020-02-10 19:52:11,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:52:11,949 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:11,949 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:11,950 INFO L427 AbstractCegarLoop]: === Iteration 604 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:11,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:11,950 INFO L82 PathProgramCache]: Analyzing trace with hash 890424782, now seen corresponding path program 596 times [2020-02-10 19:52:11,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:11,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881538241] [2020-02-10 19:52:11,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:11,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:12,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 19:52:12,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881538241] [2020-02-10 19:52:12,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:12,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:52:12,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704582770] [2020-02-10 19:52:12,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:52:12,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:12,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:52:12,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:12,477 INFO L87 Difference]: Start difference. First operand 1577 states and 7033 transitions. Second operand 11 states. [2020-02-10 19:52:12,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:12,674 INFO L93 Difference]: Finished difference Result 2964 states and 11731 transitions. [2020-02-10 19:52:12,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:52:12,675 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:52:12,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:12,682 INFO L225 Difference]: With dead ends: 2964 [2020-02-10 19:52:12,682 INFO L226 Difference]: Without dead ends: 2946 [2020-02-10 19:52:12,682 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:52:12,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2946 states. [2020-02-10 19:52:12,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2946 to 1573. [2020-02-10 19:52:12,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 19:52:12,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7022 transitions. [2020-02-10 19:52:12,749 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7022 transitions. Word has length 28 [2020-02-10 19:52:12,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:12,749 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7022 transitions. [2020-02-10 19:52:12,750 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:52:12,750 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7022 transitions. [2020-02-10 19:52:12,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:52:12,752 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:12,752 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:12,752 INFO L427 AbstractCegarLoop]: === Iteration 605 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:12,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:12,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1878199204, now seen corresponding path program 597 times [2020-02-10 19:52:12,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:12,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484623965] [2020-02-10 19:52:12,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:12,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:13,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 19:52:13,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484623965] [2020-02-10 19:52:13,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:13,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:52:13,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377255287] [2020-02-10 19:52:13,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:52:13,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:13,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:52:13,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:13,285 INFO L87 Difference]: Start difference. First operand 1573 states and 7022 transitions. Second operand 11 states. [2020-02-10 19:52:13,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:13,482 INFO L93 Difference]: Finished difference Result 2974 states and 11754 transitions. [2020-02-10 19:52:13,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:52:13,483 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:52:13,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:13,490 INFO L225 Difference]: With dead ends: 2974 [2020-02-10 19:52:13,490 INFO L226 Difference]: Without dead ends: 2956 [2020-02-10 19:52:13,490 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:52:13,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2020-02-10 19:52:13,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 1580. [2020-02-10 19:52:13,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 19:52:13,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7035 transitions. [2020-02-10 19:52:13,559 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7035 transitions. Word has length 28 [2020-02-10 19:52:13,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:13,559 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7035 transitions. [2020-02-10 19:52:13,559 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:52:13,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7035 transitions. [2020-02-10 19:52:13,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:52:13,562 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:13,562 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:13,562 INFO L427 AbstractCegarLoop]: === Iteration 606 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:13,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:13,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1306744398, now seen corresponding path program 598 times [2020-02-10 19:52:13,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:13,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197552810] [2020-02-10 19:52:13,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:13,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:14,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 19:52:14,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197552810] [2020-02-10 19:52:14,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:14,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:52:14,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886099721] [2020-02-10 19:52:14,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:52:14,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:14,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:52:14,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:14,094 INFO L87 Difference]: Start difference. First operand 1580 states and 7035 transitions. Second operand 11 states. [2020-02-10 19:52:14,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:14,288 INFO L93 Difference]: Finished difference Result 2973 states and 11745 transitions. [2020-02-10 19:52:14,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:52:14,289 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:52:14,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:14,296 INFO L225 Difference]: With dead ends: 2973 [2020-02-10 19:52:14,296 INFO L226 Difference]: Without dead ends: 2949 [2020-02-10 19:52:14,296 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:52:14,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2949 states. [2020-02-10 19:52:14,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2949 to 1573. [2020-02-10 19:52:14,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 19:52:14,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7018 transitions. [2020-02-10 19:52:14,365 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7018 transitions. Word has length 28 [2020-02-10 19:52:14,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:14,365 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7018 transitions. [2020-02-10 19:52:14,365 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:52:14,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7018 transitions. [2020-02-10 19:52:14,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:52:14,367 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:14,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] [2020-02-10 19:52:14,368 INFO L427 AbstractCegarLoop]: === Iteration 607 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:14,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:14,368 INFO L82 PathProgramCache]: Analyzing trace with hash 355194980, now seen corresponding path program 599 times [2020-02-10 19:52:14,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:14,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465903597] [2020-02-10 19:52:14,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:14,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:14,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:14,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465903597] [2020-02-10 19:52:14,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:14,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:52:14,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955767722] [2020-02-10 19:52:14,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:52:14,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:14,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:52:14,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:14,893 INFO L87 Difference]: Start difference. First operand 1573 states and 7018 transitions. Second operand 11 states. [2020-02-10 19:52:15,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:15,093 INFO L93 Difference]: Finished difference Result 2963 states and 11725 transitions. [2020-02-10 19:52:15,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:52:15,094 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:52:15,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:15,101 INFO L225 Difference]: With dead ends: 2963 [2020-02-10 19:52:15,101 INFO L226 Difference]: Without dead ends: 2949 [2020-02-10 19:52:15,101 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:52:15,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2949 states. [2020-02-10 19:52:15,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2949 to 1577. [2020-02-10 19:52:15,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 19:52:15,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7025 transitions. [2020-02-10 19:52:15,169 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7025 transitions. Word has length 28 [2020-02-10 19:52:15,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:15,169 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7025 transitions. [2020-02-10 19:52:15,169 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:52:15,169 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7025 transitions. [2020-02-10 19:52:15,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:52:15,171 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:15,171 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:15,171 INFO L427 AbstractCegarLoop]: === Iteration 608 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:15,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:15,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1844599976, now seen corresponding path program 600 times [2020-02-10 19:52:15,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:15,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621279473] [2020-02-10 19:52:15,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:15,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:15,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:15,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621279473] [2020-02-10 19:52:15,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:15,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:52:15,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201229578] [2020-02-10 19:52:15,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:52:15,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:15,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:52:15,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:15,691 INFO L87 Difference]: Start difference. First operand 1577 states and 7025 transitions. Second operand 11 states. [2020-02-10 19:52:15,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:15,922 INFO L93 Difference]: Finished difference Result 2966 states and 11727 transitions. [2020-02-10 19:52:15,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:52:15,922 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:52:15,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:15,929 INFO L225 Difference]: With dead ends: 2966 [2020-02-10 19:52:15,929 INFO L226 Difference]: Without dead ends: 2927 [2020-02-10 19:52:15,929 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:52:15,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2927 states. [2020-02-10 19:52:15,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2927 to 1555. [2020-02-10 19:52:15,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1555 states. [2020-02-10 19:52:15,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 6981 transitions. [2020-02-10 19:52:15,998 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 6981 transitions. Word has length 28 [2020-02-10 19:52:15,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:15,998 INFO L479 AbstractCegarLoop]: Abstraction has 1555 states and 6981 transitions. [2020-02-10 19:52:15,998 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:52:15,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 6981 transitions. [2020-02-10 19:52:16,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:52:16,000 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:16,000 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:16,000 INFO L427 AbstractCegarLoop]: === Iteration 609 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:16,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:16,000 INFO L82 PathProgramCache]: Analyzing trace with hash -208706742, now seen corresponding path program 601 times [2020-02-10 19:52:16,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:16,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461381578] [2020-02-10 19:52:16,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:16,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:16,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:16,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461381578] [2020-02-10 19:52:16,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:16,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:52:16,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854674771] [2020-02-10 19:52:16,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:52:16,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:16,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:52:16,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:16,566 INFO L87 Difference]: Start difference. First operand 1555 states and 6981 transitions. Second operand 11 states. [2020-02-10 19:52:16,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:16,749 INFO L93 Difference]: Finished difference Result 2994 states and 11845 transitions. [2020-02-10 19:52:16,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:52:16,749 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:52:16,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:16,756 INFO L225 Difference]: With dead ends: 2994 [2020-02-10 19:52:16,757 INFO L226 Difference]: Without dead ends: 2978 [2020-02-10 19:52:16,757 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:52:16,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2978 states. [2020-02-10 19:52:16,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2978 to 1584. [2020-02-10 19:52:16,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1584 states. [2020-02-10 19:52:16,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 7085 transitions. [2020-02-10 19:52:16,824 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 7085 transitions. Word has length 28 [2020-02-10 19:52:16,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:16,824 INFO L479 AbstractCegarLoop]: Abstraction has 1584 states and 7085 transitions. [2020-02-10 19:52:16,825 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:52:16,825 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 7085 transitions. [2020-02-10 19:52:16,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:52:16,827 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:16,827 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:16,827 INFO L427 AbstractCegarLoop]: === Iteration 610 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:16,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:16,827 INFO L82 PathProgramCache]: Analyzing trace with hash 535995756, now seen corresponding path program 602 times [2020-02-10 19:52:16,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:16,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431604597] [2020-02-10 19:52:16,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:16,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:17,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:17,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431604597] [2020-02-10 19:52:17,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:17,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:52:17,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155620908] [2020-02-10 19:52:17,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:52:17,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:17,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:52:17,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:17,364 INFO L87 Difference]: Start difference. First operand 1584 states and 7085 transitions. Second operand 11 states. [2020-02-10 19:52:17,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:17,510 INFO L93 Difference]: Finished difference Result 2998 states and 11846 transitions. [2020-02-10 19:52:17,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:52:17,510 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:52:17,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:17,518 INFO L225 Difference]: With dead ends: 2998 [2020-02-10 19:52:17,518 INFO L226 Difference]: Without dead ends: 2971 [2020-02-10 19:52:17,518 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:52:17,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2971 states. [2020-02-10 19:52:17,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2971 to 1577. [2020-02-10 19:52:17,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 19:52:17,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7065 transitions. [2020-02-10 19:52:17,586 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7065 transitions. Word has length 28 [2020-02-10 19:52:17,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:17,586 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7065 transitions. [2020-02-10 19:52:17,586 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:52:17,586 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7065 transitions. [2020-02-10 19:52:17,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:52:17,589 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:17,589 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:17,589 INFO L427 AbstractCegarLoop]: === Iteration 611 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:17,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:17,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1402234216, now seen corresponding path program 603 times [2020-02-10 19:52:17,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:17,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012096060] [2020-02-10 19:52:17,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:17,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:18,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 19:52:18,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012096060] [2020-02-10 19:52:18,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:18,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:52:18,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803352135] [2020-02-10 19:52:18,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:52:18,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:18,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:52:18,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:18,123 INFO L87 Difference]: Start difference. First operand 1577 states and 7065 transitions. Second operand 11 states. [2020-02-10 19:52:18,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:18,307 INFO L93 Difference]: Finished difference Result 2991 states and 11833 transitions. [2020-02-10 19:52:18,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:52:18,308 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:52:18,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:18,315 INFO L225 Difference]: With dead ends: 2991 [2020-02-10 19:52:18,316 INFO L226 Difference]: Without dead ends: 2975 [2020-02-10 19:52:18,316 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:52:18,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2975 states. [2020-02-10 19:52:18,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2975 to 1583. [2020-02-10 19:52:18,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 19:52:18,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7076 transitions. [2020-02-10 19:52:18,385 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7076 transitions. Word has length 28 [2020-02-10 19:52:18,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:18,385 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7076 transitions. [2020-02-10 19:52:18,385 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:52:18,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7076 transitions. [2020-02-10 19:52:18,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:52:18,387 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:18,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] [2020-02-10 19:52:18,387 INFO L427 AbstractCegarLoop]: === Iteration 612 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:18,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:18,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1403328084, now seen corresponding path program 604 times [2020-02-10 19:52:18,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:18,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786638918] [2020-02-10 19:52:18,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:18,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:18,916 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 19:52:18,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 19:52:18,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786638918] [2020-02-10 19:52:18,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:18,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:52:18,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092069904] [2020-02-10 19:52:18,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:52:18,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:18,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:52:18,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:18,924 INFO L87 Difference]: Start difference. First operand 1583 states and 7076 transitions. Second operand 11 states. [2020-02-10 19:52:19,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:19,113 INFO L93 Difference]: Finished difference Result 2993 states and 11831 transitions. [2020-02-10 19:52:19,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:52:19,113 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:52:19,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:19,120 INFO L225 Difference]: With dead ends: 2993 [2020-02-10 19:52:19,120 INFO L226 Difference]: Without dead ends: 2969 [2020-02-10 19:52:19,120 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:52:19,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2969 states. [2020-02-10 19:52:19,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2969 to 1577. [2020-02-10 19:52:19,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 19:52:19,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7059 transitions. [2020-02-10 19:52:19,188 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7059 transitions. Word has length 28 [2020-02-10 19:52:19,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:19,189 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7059 transitions. [2020-02-10 19:52:19,189 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:52:19,189 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7059 transitions. [2020-02-10 19:52:19,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:52:19,191 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:19,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] [2020-02-10 19:52:19,191 INFO L427 AbstractCegarLoop]: === Iteration 613 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:19,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:19,191 INFO L82 PathProgramCache]: Analyzing trace with hash -537089624, now seen corresponding path program 605 times [2020-02-10 19:52:19,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:19,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90259377] [2020-02-10 19:52:19,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:19,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:19,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 19:52:19,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90259377] [2020-02-10 19:52:19,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:19,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:52:19,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867357378] [2020-02-10 19:52:19,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:52:19,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:19,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:52:19,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:19,737 INFO L87 Difference]: Start difference. First operand 1577 states and 7059 transitions. Second operand 11 states. [2020-02-10 19:52:19,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:19,882 INFO L93 Difference]: Finished difference Result 3003 states and 11850 transitions. [2020-02-10 19:52:19,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:52:19,882 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:52:19,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:19,890 INFO L225 Difference]: With dead ends: 3003 [2020-02-10 19:52:19,890 INFO L226 Difference]: Without dead ends: 2983 [2020-02-10 19:52:19,890 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:52:19,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2983 states. [2020-02-10 19:52:19,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2983 to 1587. [2020-02-10 19:52:19,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1587 states. [2020-02-10 19:52:19,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 7076 transitions. [2020-02-10 19:52:19,958 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 7076 transitions. Word has length 28 [2020-02-10 19:52:19,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:19,958 INFO L479 AbstractCegarLoop]: Abstraction has 1587 states and 7076 transitions. [2020-02-10 19:52:19,958 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:52:19,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 7076 transitions. [2020-02-10 19:52:19,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:52:19,960 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:19,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] [2020-02-10 19:52:19,960 INFO L427 AbstractCegarLoop]: === Iteration 614 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:19,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:19,961 INFO L82 PathProgramCache]: Analyzing trace with hash 207612874, now seen corresponding path program 606 times [2020-02-10 19:52:19,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:19,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417878824] [2020-02-10 19:52:19,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:19,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:20,504 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 19:52:20,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:20,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417878824] [2020-02-10 19:52:20,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:20,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:52:20,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054290658] [2020-02-10 19:52:20,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:52:20,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:20,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:52:20,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:20,511 INFO L87 Difference]: Start difference. First operand 1587 states and 7076 transitions. Second operand 11 states. [2020-02-10 19:52:20,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:20,702 INFO L93 Difference]: Finished difference Result 3001 states and 11838 transitions. [2020-02-10 19:52:20,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:52:20,702 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:52:20,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:20,710 INFO L225 Difference]: With dead ends: 3001 [2020-02-10 19:52:20,710 INFO L226 Difference]: Without dead ends: 2965 [2020-02-10 19:52:20,710 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:52:20,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2965 states. [2020-02-10 19:52:20,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2965 to 1569. [2020-02-10 19:52:20,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 19:52:20,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7038 transitions. [2020-02-10 19:52:20,778 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7038 transitions. Word has length 28 [2020-02-10 19:52:20,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:20,778 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7038 transitions. [2020-02-10 19:52:20,778 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:52:20,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7038 transitions. [2020-02-10 19:52:20,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:52:20,780 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:20,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] [2020-02-10 19:52:20,780 INFO L427 AbstractCegarLoop]: === Iteration 615 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:20,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:20,780 INFO L82 PathProgramCache]: Analyzing trace with hash -715053008, now seen corresponding path program 607 times [2020-02-10 19:52:20,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:20,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097306255] [2020-02-10 19:52:20,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:20,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:21,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 19:52:21,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097306255] [2020-02-10 19:52:21,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:21,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:52:21,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493294818] [2020-02-10 19:52:21,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:52:21,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:21,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:52:21,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:21,316 INFO L87 Difference]: Start difference. First operand 1569 states and 7038 transitions. Second operand 11 states. [2020-02-10 19:52:21,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:21,491 INFO L93 Difference]: Finished difference Result 2980 states and 11802 transitions. [2020-02-10 19:52:21,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:52:21,492 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:52:21,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:21,499 INFO L225 Difference]: With dead ends: 2980 [2020-02-10 19:52:21,499 INFO L226 Difference]: Without dead ends: 2964 [2020-02-10 19:52:21,500 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:52:21,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2964 states. [2020-02-10 19:52:21,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2964 to 1581. [2020-02-10 19:52:21,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 19:52:21,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7069 transitions. [2020-02-10 19:52:21,567 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7069 transitions. Word has length 28 [2020-02-10 19:52:21,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:21,567 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7069 transitions. [2020-02-10 19:52:21,567 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:52:21,567 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7069 transitions. [2020-02-10 19:52:21,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:52:21,569 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:21,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] [2020-02-10 19:52:21,569 INFO L427 AbstractCegarLoop]: === Iteration 616 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:21,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:21,569 INFO L82 PathProgramCache]: Analyzing trace with hash 29649490, now seen corresponding path program 608 times [2020-02-10 19:52:21,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:21,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517893548] [2020-02-10 19:52:21,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:21,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:22,122 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 19:52:22,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:22,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517893548] [2020-02-10 19:52:22,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:22,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:52:22,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528272741] [2020-02-10 19:52:22,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:52:22,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:22,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:52:22,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:22,131 INFO L87 Difference]: Start difference. First operand 1581 states and 7069 transitions. Second operand 11 states. [2020-02-10 19:52:22,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:22,287 INFO L93 Difference]: Finished difference Result 2984 states and 11803 transitions. [2020-02-10 19:52:22,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:52:22,287 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:52:22,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:22,295 INFO L225 Difference]: With dead ends: 2984 [2020-02-10 19:52:22,296 INFO L226 Difference]: Without dead ends: 2957 [2020-02-10 19:52:22,296 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:52:22,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2957 states. [2020-02-10 19:52:22,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2957 to 1574. [2020-02-10 19:52:22,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 19:52:22,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7051 transitions. [2020-02-10 19:52:22,363 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7051 transitions. Word has length 28 [2020-02-10 19:52:22,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:22,363 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7051 transitions. [2020-02-10 19:52:22,363 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:52:22,363 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7051 transitions. [2020-02-10 19:52:22,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:52:22,366 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:22,366 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:22,366 INFO L427 AbstractCegarLoop]: === Iteration 617 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:22,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:22,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1433743528, now seen corresponding path program 609 times [2020-02-10 19:52:22,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:22,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935987154] [2020-02-10 19:52:22,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:22,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:22,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:22,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935987154] [2020-02-10 19:52:22,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:22,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:52:22,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772108913] [2020-02-10 19:52:22,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:52:22,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:22,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:52:22,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:22,881 INFO L87 Difference]: Start difference. First operand 1574 states and 7051 transitions. Second operand 11 states. [2020-02-10 19:52:23,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:23,056 INFO L93 Difference]: Finished difference Result 2971 states and 11778 transitions. [2020-02-10 19:52:23,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:52:23,057 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:52:23,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:23,063 INFO L225 Difference]: With dead ends: 2971 [2020-02-10 19:52:23,064 INFO L226 Difference]: Without dead ends: 2955 [2020-02-10 19:52:23,064 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:52:23,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2955 states. [2020-02-10 19:52:23,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2955 to 1578. [2020-02-10 19:52:23,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 19:52:23,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7058 transitions. [2020-02-10 19:52:23,131 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7058 transitions. Word has length 28 [2020-02-10 19:52:23,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:23,131 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7058 transitions. [2020-02-10 19:52:23,132 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:52:23,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7058 transitions. [2020-02-10 19:52:23,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:52:23,134 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:23,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] [2020-02-10 19:52:23,134 INFO L427 AbstractCegarLoop]: === Iteration 618 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:23,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:23,134 INFO L82 PathProgramCache]: Analyzing trace with hash 862288722, now seen corresponding path program 610 times [2020-02-10 19:52:23,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:23,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168805490] [2020-02-10 19:52:23,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:23,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:23,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 19:52:23,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168805490] [2020-02-10 19:52:23,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:23,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:52:23,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677399639] [2020-02-10 19:52:23,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:52:23,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:23,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:52:23,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:23,668 INFO L87 Difference]: Start difference. First operand 1578 states and 7058 transitions. Second operand 11 states. [2020-02-10 19:52:23,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:23,863 INFO L93 Difference]: Finished difference Result 2969 states and 11770 transitions. [2020-02-10 19:52:23,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:52:23,864 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:52:23,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:23,871 INFO L225 Difference]: With dead ends: 2969 [2020-02-10 19:52:23,871 INFO L226 Difference]: Without dead ends: 2951 [2020-02-10 19:52:23,871 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:52:23,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2020-02-10 19:52:23,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 1574. [2020-02-10 19:52:23,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 19:52:23,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7047 transitions. [2020-02-10 19:52:23,938 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7047 transitions. Word has length 28 [2020-02-10 19:52:23,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:23,938 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7047 transitions. [2020-02-10 19:52:23,938 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:52:23,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7047 transitions. [2020-02-10 19:52:23,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:52:23,941 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:23,941 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:23,941 INFO L427 AbstractCegarLoop]: === Iteration 619 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:23,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:23,941 INFO L82 PathProgramCache]: Analyzing trace with hash -505580312, now seen corresponding path program 611 times [2020-02-10 19:52:23,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:23,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258367633] [2020-02-10 19:52:23,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:23,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:24,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 19:52:24,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258367633] [2020-02-10 19:52:24,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:24,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:52:24,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392361065] [2020-02-10 19:52:24,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:52:24,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:24,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:52:24,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:24,477 INFO L87 Difference]: Start difference. First operand 1574 states and 7047 transitions. Second operand 11 states. [2020-02-10 19:52:24,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:24,617 INFO L93 Difference]: Finished difference Result 2980 states and 11790 transitions. [2020-02-10 19:52:24,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:52:24,617 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:52:24,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:24,624 INFO L225 Difference]: With dead ends: 2980 [2020-02-10 19:52:24,624 INFO L226 Difference]: Without dead ends: 2960 [2020-02-10 19:52:24,625 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:52:24,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2960 states. [2020-02-10 19:52:24,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2960 to 1579. [2020-02-10 19:52:24,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 19:52:24,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7055 transitions. [2020-02-10 19:52:24,691 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7055 transitions. Word has length 28 [2020-02-10 19:52:24,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:24,692 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7055 transitions. [2020-02-10 19:52:24,692 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:52:24,692 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7055 transitions. [2020-02-10 19:52:24,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:52:24,694 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:24,694 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:24,694 INFO L427 AbstractCegarLoop]: === Iteration 620 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:24,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:24,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1821737616, now seen corresponding path program 612 times [2020-02-10 19:52:24,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:24,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789273979] [2020-02-10 19:52:24,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:24,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:25,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 19:52:25,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789273979] [2020-02-10 19:52:25,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:25,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:52:25,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891706701] [2020-02-10 19:52:25,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:52:25,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:25,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:52:25,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:25,229 INFO L87 Difference]: Start difference. First operand 1579 states and 7055 transitions. Second operand 11 states. [2020-02-10 19:52:25,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:25,408 INFO L93 Difference]: Finished difference Result 2974 states and 11774 transitions. [2020-02-10 19:52:25,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:52:25,408 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:52:25,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:25,416 INFO L225 Difference]: With dead ends: 2974 [2020-02-10 19:52:25,416 INFO L226 Difference]: Without dead ends: 2950 [2020-02-10 19:52:25,416 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:52:25,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2020-02-10 19:52:25,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 1569. [2020-02-10 19:52:25,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 19:52:25,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7033 transitions. [2020-02-10 19:52:25,483 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7033 transitions. Word has length 28 [2020-02-10 19:52:25,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:25,483 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7033 transitions. [2020-02-10 19:52:25,483 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:52:25,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7033 transitions. [2020-02-10 19:52:25,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:52:25,485 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:25,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] [2020-02-10 19:52:25,486 INFO L427 AbstractCegarLoop]: === Iteration 621 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:25,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:25,486 INFO L82 PathProgramCache]: Analyzing trace with hash -704549904, now seen corresponding path program 613 times [2020-02-10 19:52:25,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:25,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582057840] [2020-02-10 19:52:25,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:25,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:26,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 19:52:26,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582057840] [2020-02-10 19:52:26,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:26,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:52:26,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695982470] [2020-02-10 19:52:26,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:52:26,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:26,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:52:26,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:26,010 INFO L87 Difference]: Start difference. First operand 1569 states and 7033 transitions. Second operand 11 states. [2020-02-10 19:52:26,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:26,186 INFO L93 Difference]: Finished difference Result 2972 states and 11782 transitions. [2020-02-10 19:52:26,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:52:26,186 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:52:26,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:26,194 INFO L225 Difference]: With dead ends: 2972 [2020-02-10 19:52:26,194 INFO L226 Difference]: Without dead ends: 2956 [2020-02-10 19:52:26,194 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:52:26,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2020-02-10 19:52:26,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 1579. [2020-02-10 19:52:26,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 19:52:26,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7059 transitions. [2020-02-10 19:52:26,262 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7059 transitions. Word has length 28 [2020-02-10 19:52:26,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:26,262 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7059 transitions. [2020-02-10 19:52:26,262 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:52:26,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7059 transitions. [2020-02-10 19:52:26,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:52:26,264 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:26,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] [2020-02-10 19:52:26,264 INFO L427 AbstractCegarLoop]: === Iteration 622 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:26,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:26,264 INFO L82 PathProgramCache]: Analyzing trace with hash 784855092, now seen corresponding path program 614 times [2020-02-10 19:52:26,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:26,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864209773] [2020-02-10 19:52:26,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:26,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:26,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:26,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864209773] [2020-02-10 19:52:26,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:26,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:52:26,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121129648] [2020-02-10 19:52:26,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:52:26,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:26,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:52:26,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:26,789 INFO L87 Difference]: Start difference. First operand 1579 states and 7059 transitions. Second operand 11 states. [2020-02-10 19:52:26,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:26,972 INFO L93 Difference]: Finished difference Result 2974 states and 11780 transitions. [2020-02-10 19:52:26,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:52:26,972 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:52:26,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:26,979 INFO L225 Difference]: With dead ends: 2974 [2020-02-10 19:52:26,980 INFO L226 Difference]: Without dead ends: 2950 [2020-02-10 19:52:26,980 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:52:27,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2020-02-10 19:52:27,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 1573. [2020-02-10 19:52:27,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 19:52:27,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7044 transitions. [2020-02-10 19:52:27,047 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7044 transitions. Word has length 28 [2020-02-10 19:52:27,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:27,047 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7044 transitions. [2020-02-10 19:52:27,047 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:52:27,047 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7044 transitions. [2020-02-10 19:52:27,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:52:27,049 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52: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] [2020-02-10 19:52:27,049 INFO L427 AbstractCegarLoop]: === Iteration 623 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:27,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:27,049 INFO L82 PathProgramCache]: Analyzing trace with hash -166694326, now seen corresponding path program 615 times [2020-02-10 19:52:27,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:27,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119654670] [2020-02-10 19:52:27,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:27,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:27,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:27,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119654670] [2020-02-10 19:52:27,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:27,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:52:27,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626662859] [2020-02-10 19:52:27,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:52:27,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:27,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:52:27,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:27,590 INFO L87 Difference]: Start difference. First operand 1573 states and 7044 transitions. Second operand 11 states. [2020-02-10 19:52:27,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:27,787 INFO L93 Difference]: Finished difference Result 2966 states and 11764 transitions. [2020-02-10 19:52:27,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:52:27,787 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:52:27,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:27,794 INFO L225 Difference]: With dead ends: 2966 [2020-02-10 19:52:27,794 INFO L226 Difference]: Without dead ends: 2950 [2020-02-10 19:52:27,794 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:52:27,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2020-02-10 19:52:27,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 1577. [2020-02-10 19:52:27,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 19:52:27,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7051 transitions. [2020-02-10 19:52:27,863 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7051 transitions. Word has length 28 [2020-02-10 19:52:27,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:27,863 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7051 transitions. [2020-02-10 19:52:27,863 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:52:27,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7051 transitions. [2020-02-10 19:52:27,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:52:27,865 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:27,865 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:27,865 INFO L427 AbstractCegarLoop]: === Iteration 624 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:27,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:27,865 INFO L82 PathProgramCache]: Analyzing trace with hash -738149132, now seen corresponding path program 616 times [2020-02-10 19:52:27,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:27,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452853399] [2020-02-10 19:52:27,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:27,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:28,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 19:52:28,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452853399] [2020-02-10 19:52:28,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:28,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:52:28,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535478085] [2020-02-10 19:52:28,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:52:28,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:28,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:52:28,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:28,401 INFO L87 Difference]: Start difference. First operand 1577 states and 7051 transitions. Second operand 11 states. [2020-02-10 19:52:28,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:28,624 INFO L93 Difference]: Finished difference Result 2964 states and 11756 transitions. [2020-02-10 19:52:28,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:52:28,624 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:52:28,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:28,631 INFO L225 Difference]: With dead ends: 2964 [2020-02-10 19:52:28,631 INFO L226 Difference]: Without dead ends: 2946 [2020-02-10 19:52:28,632 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:52:28,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2946 states. [2020-02-10 19:52:28,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2946 to 1573. [2020-02-10 19:52:28,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 19:52:28,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7040 transitions. [2020-02-10 19:52:28,699 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7040 transitions. Word has length 28 [2020-02-10 19:52:28,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:28,699 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7040 transitions. [2020-02-10 19:52:28,699 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:52:28,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7040 transitions. [2020-02-10 19:52:28,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:52:28,701 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:28,701 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:28,701 INFO L427 AbstractCegarLoop]: === Iteration 625 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:28,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:28,702 INFO L82 PathProgramCache]: Analyzing trace with hash 249625290, now seen corresponding path program 617 times [2020-02-10 19:52:28,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:28,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232366121] [2020-02-10 19:52:28,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:28,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:29,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 19:52:29,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232366121] [2020-02-10 19:52:29,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:29,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:52:29,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505896186] [2020-02-10 19:52:29,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:52:29,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:29,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:52:29,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:29,219 INFO L87 Difference]: Start difference. First operand 1573 states and 7040 transitions. Second operand 11 states. [2020-02-10 19:52:29,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:29,417 INFO L93 Difference]: Finished difference Result 2970 states and 11768 transitions. [2020-02-10 19:52:29,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:52:29,417 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:52:29,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:29,425 INFO L225 Difference]: With dead ends: 2970 [2020-02-10 19:52:29,425 INFO L226 Difference]: Without dead ends: 2952 [2020-02-10 19:52:29,425 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:52:29,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2952 states. [2020-02-10 19:52:29,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2952 to 1577. [2020-02-10 19:52:29,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 19:52:29,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7047 transitions. [2020-02-10 19:52:29,492 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7047 transitions. Word has length 28 [2020-02-10 19:52:29,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:29,492 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7047 transitions. [2020-02-10 19:52:29,492 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:52:29,492 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7047 transitions. [2020-02-10 19:52:29,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:52:29,494 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:29,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] [2020-02-10 19:52:29,494 INFO L427 AbstractCegarLoop]: === Iteration 626 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:29,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:29,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1811234512, now seen corresponding path program 618 times [2020-02-10 19:52:29,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:29,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133851568] [2020-02-10 19:52:29,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:29,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:30,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:30,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133851568] [2020-02-10 19:52:30,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:30,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:52:30,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873890813] [2020-02-10 19:52:30,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:52:30,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:30,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:52:30,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:30,014 INFO L87 Difference]: Start difference. First operand 1577 states and 7047 transitions. Second operand 11 states. [2020-02-10 19:52:30,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:30,209 INFO L93 Difference]: Finished difference Result 2966 states and 11756 transitions. [2020-02-10 19:52:30,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:52:30,209 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:52:30,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:30,216 INFO L225 Difference]: With dead ends: 2966 [2020-02-10 19:52:30,216 INFO L226 Difference]: Without dead ends: 2944 [2020-02-10 19:52:30,216 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:52:30,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2944 states. [2020-02-10 19:52:30,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2944 to 1569. [2020-02-10 19:52:30,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 19:52:30,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7029 transitions. [2020-02-10 19:52:30,284 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7029 transitions. Word has length 28 [2020-02-10 19:52:30,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:30,284 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7029 transitions. [2020-02-10 19:52:30,284 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:52:30,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7029 transitions. [2020-02-10 19:52:30,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:52:30,286 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:30,286 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:30,286 INFO L427 AbstractCegarLoop]: === Iteration 627 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:30,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:30,286 INFO L82 PathProgramCache]: Analyzing trace with hash 50655698, now seen corresponding path program 619 times [2020-02-10 19:52:30,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:30,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261476938] [2020-02-10 19:52:30,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:30,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:30,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 19:52:30,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261476938] [2020-02-10 19:52:30,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:30,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:52:30,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427603027] [2020-02-10 19:52:30,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:52:30,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:30,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:52:30,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:30,826 INFO L87 Difference]: Start difference. First operand 1569 states and 7029 transitions. Second operand 11 states. [2020-02-10 19:52:30,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:30,990 INFO L93 Difference]: Finished difference Result 2995 states and 11824 transitions. [2020-02-10 19:52:30,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:52:30,991 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:52:30,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:30,998 INFO L225 Difference]: With dead ends: 2995 [2020-02-10 19:52:30,998 INFO L226 Difference]: Without dead ends: 2975 [2020-02-10 19:52:30,999 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:52:31,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2975 states. [2020-02-10 19:52:31,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2975 to 1585. [2020-02-10 19:52:31,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1585 states. [2020-02-10 19:52:31,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 7066 transitions. [2020-02-10 19:52:31,066 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 7066 transitions. Word has length 28 [2020-02-10 19:52:31,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:31,066 INFO L479 AbstractCegarLoop]: Abstraction has 1585 states and 7066 transitions. [2020-02-10 19:52:31,067 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:52:31,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 7066 transitions. [2020-02-10 19:52:31,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:52:31,069 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:31,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] [2020-02-10 19:52:31,069 INFO L427 AbstractCegarLoop]: === Iteration 628 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:31,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:31,069 INFO L82 PathProgramCache]: Analyzing trace with hash 795358196, now seen corresponding path program 620 times [2020-02-10 19:52:31,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:31,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457450993] [2020-02-10 19:52:31,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:31,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:31,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:31,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457450993] [2020-02-10 19:52:31,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:31,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:52:31,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783049695] [2020-02-10 19:52:31,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:52:31,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:31,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:52:31,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:31,606 INFO L87 Difference]: Start difference. First operand 1585 states and 7066 transitions. Second operand 11 states. [2020-02-10 19:52:31,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:31,797 INFO L93 Difference]: Finished difference Result 2993 states and 11812 transitions. [2020-02-10 19:52:31,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:52:31,798 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:52:31,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:31,806 INFO L225 Difference]: With dead ends: 2993 [2020-02-10 19:52:31,806 INFO L226 Difference]: Without dead ends: 2965 [2020-02-10 19:52:31,806 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:52:31,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2965 states. [2020-02-10 19:52:31,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2965 to 1575. [2020-02-10 19:52:31,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 19:52:31,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7043 transitions. [2020-02-10 19:52:31,875 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7043 transitions. Word has length 28 [2020-02-10 19:52:31,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:31,875 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7043 transitions. [2020-02-10 19:52:31,875 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:52:31,875 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7043 transitions. [2020-02-10 19:52:31,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:52:31,877 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:31,877 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:31,877 INFO L427 AbstractCegarLoop]: === Iteration 629 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:31,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:31,878 INFO L82 PathProgramCache]: Analyzing trace with hash 588511276, now seen corresponding path program 621 times [2020-02-10 19:52:31,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:31,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154119765] [2020-02-10 19:52:31,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:31,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:32,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 19:52:32,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154119765] [2020-02-10 19:52:32,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:32,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:52:32,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107605774] [2020-02-10 19:52:32,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:52:32,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:32,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:52:32,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:32,401 INFO L87 Difference]: Start difference. First operand 1575 states and 7043 transitions. Second operand 11 states. [2020-02-10 19:52:32,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:32,539 INFO L93 Difference]: Finished difference Result 2986 states and 11797 transitions. [2020-02-10 19:52:32,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:52:32,539 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:52:32,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:32,547 INFO L225 Difference]: With dead ends: 2986 [2020-02-10 19:52:32,547 INFO L226 Difference]: Without dead ends: 2966 [2020-02-10 19:52:32,547 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:52:32,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2966 states. [2020-02-10 19:52:32,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2966 to 1580. [2020-02-10 19:52:32,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 19:52:32,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7051 transitions. [2020-02-10 19:52:32,618 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7051 transitions. Word has length 28 [2020-02-10 19:52:32,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:32,618 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7051 transitions. [2020-02-10 19:52:32,618 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:52:32,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7051 transitions. [2020-02-10 19:52:32,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:52:32,620 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:32,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] [2020-02-10 19:52:32,620 INFO L427 AbstractCegarLoop]: === Iteration 630 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:32,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:32,621 INFO L82 PathProgramCache]: Analyzing trace with hash -727646028, now seen corresponding path program 622 times [2020-02-10 19:52:32,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:32,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277786068] [2020-02-10 19:52:32,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:32,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:33,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:33,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277786068] [2020-02-10 19:52:33,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:33,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:52:33,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568164180] [2020-02-10 19:52:33,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:52:33,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:33,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:52:33,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:33,149 INFO L87 Difference]: Start difference. First operand 1580 states and 7051 transitions. Second operand 11 states. [2020-02-10 19:52:33,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:33,322 INFO L93 Difference]: Finished difference Result 2980 states and 11781 transitions. [2020-02-10 19:52:33,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:52:33,323 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:52:33,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:33,330 INFO L225 Difference]: With dead ends: 2980 [2020-02-10 19:52:33,330 INFO L226 Difference]: Without dead ends: 2961 [2020-02-10 19:52:33,331 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:52:33,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2961 states. [2020-02-10 19:52:33,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2961 to 1575. [2020-02-10 19:52:33,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 19:52:33,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7038 transitions. [2020-02-10 19:52:33,398 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7038 transitions. Word has length 28 [2020-02-10 19:52:33,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:33,398 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7038 transitions. [2020-02-10 19:52:33,398 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:52:33,398 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7038 transitions. [2020-02-10 19:52:33,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:52:33,401 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:33,401 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:33,401 INFO L427 AbstractCegarLoop]: === Iteration 631 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:33,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:33,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1350812564, now seen corresponding path program 623 times [2020-02-10 19:52:33,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:33,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794581739] [2020-02-10 19:52:33,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:33,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:33,928 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 19:52:33,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 19:52:33,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794581739] [2020-02-10 19:52:33,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:33,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:52:33,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579214158] [2020-02-10 19:52:33,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:52:33,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:33,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:52:33,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:33,937 INFO L87 Difference]: Start difference. First operand 1575 states and 7038 transitions. Second operand 11 states. [2020-02-10 19:52:34,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:34,128 INFO L93 Difference]: Finished difference Result 2981 states and 11784 transitions. [2020-02-10 19:52:34,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:52:34,128 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:52:34,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:34,136 INFO L225 Difference]: With dead ends: 2981 [2020-02-10 19:52:34,136 INFO L226 Difference]: Without dead ends: 2963 [2020-02-10 19:52:34,136 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:52:34,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2963 states. [2020-02-10 19:52:34,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2963 to 1579. [2020-02-10 19:52:34,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 19:52:34,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7045 transitions. [2020-02-10 19:52:34,203 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7045 transitions. Word has length 28 [2020-02-10 19:52:34,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:34,203 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7045 transitions. [2020-02-10 19:52:34,203 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:52:34,203 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7045 transitions. [2020-02-10 19:52:34,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:52:34,205 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:34,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] [2020-02-10 19:52:34,205 INFO L427 AbstractCegarLoop]: === Iteration 632 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:34,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:34,205 INFO L82 PathProgramCache]: Analyzing trace with hash 883294930, now seen corresponding path program 624 times [2020-02-10 19:52:34,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:34,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886587966] [2020-02-10 19:52:34,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:34,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:34,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:34,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886587966] [2020-02-10 19:52:34,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:34,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:52:34,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551913928] [2020-02-10 19:52:34,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:52:34,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:34,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:52:34,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:34,737 INFO L87 Difference]: Start difference. First operand 1579 states and 7045 transitions. Second operand 11 states. [2020-02-10 19:52:34,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:34,973 INFO L93 Difference]: Finished difference Result 2977 states and 11772 transitions. [2020-02-10 19:52:34,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:52:34,973 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:52:34,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:34,980 INFO L225 Difference]: With dead ends: 2977 [2020-02-10 19:52:34,980 INFO L226 Difference]: Without dead ends: 2947 [2020-02-10 19:52:34,981 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:52:35,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2947 states. [2020-02-10 19:52:35,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2947 to 1563. [2020-02-10 19:52:35,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2020-02-10 19:52:35,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 7012 transitions. [2020-02-10 19:52:35,048 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 7012 transitions. Word has length 28 [2020-02-10 19:52:35,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:35,048 INFO L479 AbstractCegarLoop]: Abstraction has 1563 states and 7012 transitions. [2020-02-10 19:52:35,048 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:52:35,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 7012 transitions. [2020-02-10 19:52:35,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:52:35,051 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:35,051 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:35,051 INFO L427 AbstractCegarLoop]: === Iteration 633 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:35,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:35,051 INFO L82 PathProgramCache]: Analyzing trace with hash -651605882, now seen corresponding path program 625 times [2020-02-10 19:52:35,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:35,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935306684] [2020-02-10 19:52:35,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:35,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:35,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:35,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935306684] [2020-02-10 19:52:35,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:35,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:52:35,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907702158] [2020-02-10 19:52:35,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:52:35,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:35,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:52:35,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:35,587 INFO L87 Difference]: Start difference. First operand 1563 states and 7012 transitions. Second operand 11 states. [2020-02-10 19:52:35,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:35,792 INFO L93 Difference]: Finished difference Result 3017 states and 11911 transitions. [2020-02-10 19:52:35,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:52:35,793 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:52:35,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:35,800 INFO L225 Difference]: With dead ends: 3017 [2020-02-10 19:52:35,800 INFO L226 Difference]: Without dead ends: 3001 [2020-02-10 19:52:35,800 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:52:35,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3001 states. [2020-02-10 19:52:35,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3001 to 1588. [2020-02-10 19:52:35,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1588 states. [2020-02-10 19:52:35,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 7092 transitions. [2020-02-10 19:52:35,871 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 7092 transitions. Word has length 28 [2020-02-10 19:52:35,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:35,871 INFO L479 AbstractCegarLoop]: Abstraction has 1588 states and 7092 transitions. [2020-02-10 19:52:35,871 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:52:35,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 7092 transitions. [2020-02-10 19:52:35,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:52:35,874 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:35,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] [2020-02-10 19:52:35,874 INFO L427 AbstractCegarLoop]: === Iteration 634 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:35,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:35,874 INFO L82 PathProgramCache]: Analyzing trace with hash 93096616, now seen corresponding path program 626 times [2020-02-10 19:52:35,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:35,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038033027] [2020-02-10 19:52:35,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:35,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:36,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 19:52:36,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038033027] [2020-02-10 19:52:36,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:36,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:52:36,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495222618] [2020-02-10 19:52:36,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:52:36,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:36,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:52:36,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:36,431 INFO L87 Difference]: Start difference. First operand 1588 states and 7092 transitions. Second operand 11 states. [2020-02-10 19:52:36,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:36,602 INFO L93 Difference]: Finished difference Result 3021 states and 11912 transitions. [2020-02-10 19:52:36,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:52:36,603 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:52:36,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:36,610 INFO L225 Difference]: With dead ends: 3021 [2020-02-10 19:52:36,611 INFO L226 Difference]: Without dead ends: 2994 [2020-02-10 19:52:36,611 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:52:36,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2994 states. [2020-02-10 19:52:36,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2994 to 1581. [2020-02-10 19:52:36,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 19:52:36,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7072 transitions. [2020-02-10 19:52:36,678 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7072 transitions. Word has length 28 [2020-02-10 19:52:36,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:36,678 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7072 transitions. [2020-02-10 19:52:36,678 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:52:36,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7072 transitions. [2020-02-10 19:52:36,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:52:36,680 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:36,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] [2020-02-10 19:52:36,681 INFO L427 AbstractCegarLoop]: === Iteration 635 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:36,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:36,681 INFO L82 PathProgramCache]: Analyzing trace with hash 959335076, now seen corresponding path program 627 times [2020-02-10 19:52:36,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:36,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796407166] [2020-02-10 19:52:36,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:36,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:37,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:37,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796407166] [2020-02-10 19:52:37,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:37,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:52:37,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235970007] [2020-02-10 19:52:37,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:52:37,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:37,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:52:37,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:37,227 INFO L87 Difference]: Start difference. First operand 1581 states and 7072 transitions. Second operand 11 states. [2020-02-10 19:52:37,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:37,425 INFO L93 Difference]: Finished difference Result 3014 states and 11899 transitions. [2020-02-10 19:52:37,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:52:37,425 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:52:37,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:37,433 INFO L225 Difference]: With dead ends: 3014 [2020-02-10 19:52:37,433 INFO L226 Difference]: Without dead ends: 2998 [2020-02-10 19:52:37,433 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:52:37,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2998 states. [2020-02-10 19:52:37,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2998 to 1587. [2020-02-10 19:52:37,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1587 states. [2020-02-10 19:52:37,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 7083 transitions. [2020-02-10 19:52:37,504 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 7083 transitions. Word has length 28 [2020-02-10 19:52:37,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:37,504 INFO L479 AbstractCegarLoop]: Abstraction has 1587 states and 7083 transitions. [2020-02-10 19:52:37,505 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:52:37,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 7083 transitions. [2020-02-10 19:52:37,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:52:37,507 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:37,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] [2020-02-10 19:52:37,507 INFO L427 AbstractCegarLoop]: === Iteration 636 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:37,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:37,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1846227224, now seen corresponding path program 628 times [2020-02-10 19:52:37,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:37,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199812893] [2020-02-10 19:52:37,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:37,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:38,042 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 19:52:38,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:38,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199812893] [2020-02-10 19:52:38,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:38,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:52:38,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10276241] [2020-02-10 19:52:38,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:52:38,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:38,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:52:38,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:38,050 INFO L87 Difference]: Start difference. First operand 1587 states and 7083 transitions. Second operand 11 states. [2020-02-10 19:52:38,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:38,278 INFO L93 Difference]: Finished difference Result 3016 states and 11897 transitions. [2020-02-10 19:52:38,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:52:38,278 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:52:38,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:38,285 INFO L225 Difference]: With dead ends: 3016 [2020-02-10 19:52:38,285 INFO L226 Difference]: Without dead ends: 2992 [2020-02-10 19:52:38,285 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:52:38,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2992 states. [2020-02-10 19:52:38,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2992 to 1581. [2020-02-10 19:52:38,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 19:52:38,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7066 transitions. [2020-02-10 19:52:38,355 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7066 transitions. Word has length 28 [2020-02-10 19:52:38,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:38,355 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7066 transitions. [2020-02-10 19:52:38,355 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:52:38,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7066 transitions. [2020-02-10 19:52:38,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:52:38,357 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:38,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] [2020-02-10 19:52:38,358 INFO L427 AbstractCegarLoop]: === Iteration 637 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:38,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:38,358 INFO L82 PathProgramCache]: Analyzing trace with hash -979988764, now seen corresponding path program 629 times [2020-02-10 19:52:38,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:38,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946170109] [2020-02-10 19:52:38,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:38,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:38,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:38,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946170109] [2020-02-10 19:52:38,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:38,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:52:38,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966381605] [2020-02-10 19:52:38,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:52:38,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:38,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:52:38,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:38,917 INFO L87 Difference]: Start difference. First operand 1581 states and 7066 transitions. Second operand 11 states. [2020-02-10 19:52:39,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:39,088 INFO L93 Difference]: Finished difference Result 3026 states and 11916 transitions. [2020-02-10 19:52:39,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:52:39,088 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:52:39,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:39,096 INFO L225 Difference]: With dead ends: 3026 [2020-02-10 19:52:39,096 INFO L226 Difference]: Without dead ends: 3006 [2020-02-10 19:52:39,096 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:52:39,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3006 states. [2020-02-10 19:52:39,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3006 to 1591. [2020-02-10 19:52:39,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1591 states. [2020-02-10 19:52:39,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1591 states and 7083 transitions. [2020-02-10 19:52:39,165 INFO L78 Accepts]: Start accepts. Automaton has 1591 states and 7083 transitions. Word has length 28 [2020-02-10 19:52:39,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:39,166 INFO L479 AbstractCegarLoop]: Abstraction has 1591 states and 7083 transitions. [2020-02-10 19:52:39,166 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:52:39,166 INFO L276 IsEmpty]: Start isEmpty. Operand 1591 states and 7083 transitions. [2020-02-10 19:52:39,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:52:39,168 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:39,168 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:39,168 INFO L427 AbstractCegarLoop]: === Iteration 638 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:39,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:39,168 INFO L82 PathProgramCache]: Analyzing trace with hash -235286266, now seen corresponding path program 630 times [2020-02-10 19:52:39,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:39,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521503534] [2020-02-10 19:52:39,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:39,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:39,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:39,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521503534] [2020-02-10 19:52:39,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:39,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:52:39,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314423657] [2020-02-10 19:52:39,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:52:39,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:39,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:52:39,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:39,719 INFO L87 Difference]: Start difference. First operand 1591 states and 7083 transitions. Second operand 11 states. [2020-02-10 19:52:39,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:39,905 INFO L93 Difference]: Finished difference Result 3024 states and 11904 transitions. [2020-02-10 19:52:39,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:52:39,905 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:52:39,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:39,913 INFO L225 Difference]: With dead ends: 3024 [2020-02-10 19:52:39,913 INFO L226 Difference]: Without dead ends: 2988 [2020-02-10 19:52:39,913 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:52:39,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2988 states. [2020-02-10 19:52:39,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2988 to 1573. [2020-02-10 19:52:39,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 19:52:39,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7043 transitions. [2020-02-10 19:52:39,980 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7043 transitions. Word has length 28 [2020-02-10 19:52:39,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:39,980 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7043 transitions. [2020-02-10 19:52:39,980 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:52:39,981 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7043 transitions. [2020-02-10 19:52:39,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:52:39,983 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:39,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] [2020-02-10 19:52:39,983 INFO L427 AbstractCegarLoop]: === Iteration 639 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:39,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:39,983 INFO L82 PathProgramCache]: Analyzing trace with hash -63860560, now seen corresponding path program 631 times [2020-02-10 19:52:39,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:39,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472862146] [2020-02-10 19:52:39,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:39,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:40,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 19:52:40,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472862146] [2020-02-10 19:52:40,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:40,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:52:40,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549324600] [2020-02-10 19:52:40,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:52:40,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:40,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:52:40,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:40,550 INFO L87 Difference]: Start difference. First operand 1573 states and 7043 transitions. Second operand 11 states. [2020-02-10 19:52:40,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:40,757 INFO L93 Difference]: Finished difference Result 3013 states and 11895 transitions. [2020-02-10 19:52:40,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:52:40,758 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:52:40,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:40,765 INFO L225 Difference]: With dead ends: 3013 [2020-02-10 19:52:40,765 INFO L226 Difference]: Without dead ends: 2997 [2020-02-10 19:52:40,765 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:52:40,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2997 states. [2020-02-10 19:52:40,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2997 to 1587. [2020-02-10 19:52:40,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1587 states. [2020-02-10 19:52:40,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 7082 transitions. [2020-02-10 19:52:40,835 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 7082 transitions. Word has length 28 [2020-02-10 19:52:40,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:40,835 INFO L479 AbstractCegarLoop]: Abstraction has 1587 states and 7082 transitions. [2020-02-10 19:52:40,835 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:52:40,835 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 7082 transitions. [2020-02-10 19:52:40,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:52:40,837 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:40,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] [2020-02-10 19:52:40,837 INFO L427 AbstractCegarLoop]: === Iteration 640 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:40,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:40,838 INFO L82 PathProgramCache]: Analyzing trace with hash 680841938, now seen corresponding path program 632 times [2020-02-10 19:52:40,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:40,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776745396] [2020-02-10 19:52:40,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:40,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:41,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:41,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776745396] [2020-02-10 19:52:41,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:41,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:52:41,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966403716] [2020-02-10 19:52:41,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:52:41,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:41,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:52:41,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:41,378 INFO L87 Difference]: Start difference. First operand 1587 states and 7082 transitions. Second operand 11 states. [2020-02-10 19:52:41,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:41,524 INFO L93 Difference]: Finished difference Result 3017 states and 11896 transitions. [2020-02-10 19:52:41,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:52:41,524 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:52:41,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:41,531 INFO L225 Difference]: With dead ends: 3017 [2020-02-10 19:52:41,531 INFO L226 Difference]: Without dead ends: 2990 [2020-02-10 19:52:41,531 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:52:41,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2990 states. [2020-02-10 19:52:41,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2990 to 1580. [2020-02-10 19:52:41,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 19:52:41,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7062 transitions. [2020-02-10 19:52:41,601 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7062 transitions. Word has length 28 [2020-02-10 19:52:41,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:41,601 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7062 transitions. [2020-02-10 19:52:41,601 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:52:41,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7062 transitions. [2020-02-10 19:52:41,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:52:41,603 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:41,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] [2020-02-10 19:52:41,603 INFO L427 AbstractCegarLoop]: === Iteration 641 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:41,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:41,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1011850596, now seen corresponding path program 633 times [2020-02-10 19:52:41,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:41,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738110478] [2020-02-10 19:52:41,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:41,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:42,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 19:52:42,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738110478] [2020-02-10 19:52:42,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:42,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:52:42,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378383903] [2020-02-10 19:52:42,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:52:42,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:42,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:52:42,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:42,153 INFO L87 Difference]: Start difference. First operand 1580 states and 7062 transitions. Second operand 11 states. [2020-02-10 19:52:42,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:42,332 INFO L93 Difference]: Finished difference Result 3009 states and 11881 transitions. [2020-02-10 19:52:42,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:52:42,332 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:52:42,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:42,340 INFO L225 Difference]: With dead ends: 3009 [2020-02-10 19:52:42,340 INFO L226 Difference]: Without dead ends: 2993 [2020-02-10 19:52:42,341 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:52:42,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2993 states. [2020-02-10 19:52:42,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2993 to 1586. [2020-02-10 19:52:42,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1586 states. [2020-02-10 19:52:42,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1586 states and 7073 transitions. [2020-02-10 19:52:42,408 INFO L78 Accepts]: Start accepts. Automaton has 1586 states and 7073 transitions. Word has length 28 [2020-02-10 19:52:42,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:42,408 INFO L479 AbstractCegarLoop]: Abstraction has 1586 states and 7073 transitions. [2020-02-10 19:52:42,409 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:52:42,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1586 states and 7073 transitions. [2020-02-10 19:52:42,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:52:42,411 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:42,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] [2020-02-10 19:52:42,411 INFO L427 AbstractCegarLoop]: === Iteration 642 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:42,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:42,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1929800786, now seen corresponding path program 634 times [2020-02-10 19:52:42,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:42,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757365494] [2020-02-10 19:52:42,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:42,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:42,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 19:52:42,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757365494] [2020-02-10 19:52:42,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:42,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:52:42,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406230707] [2020-02-10 19:52:42,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:52:42,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:42,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:52:42,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:42,948 INFO L87 Difference]: Start difference. First operand 1586 states and 7073 transitions. Second operand 11 states. [2020-02-10 19:52:43,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:43,127 INFO L93 Difference]: Finished difference Result 3010 states and 11877 transitions. [2020-02-10 19:52:43,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:52:43,127 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:52:43,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:43,135 INFO L225 Difference]: With dead ends: 3010 [2020-02-10 19:52:43,135 INFO L226 Difference]: Without dead ends: 2987 [2020-02-10 19:52:43,135 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:52:43,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2987 states. [2020-02-10 19:52:43,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2987 to 1580. [2020-02-10 19:52:43,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 19:52:43,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7056 transitions. [2020-02-10 19:52:43,202 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7056 transitions. Word has length 28 [2020-02-10 19:52:43,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:43,203 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7056 transitions. [2020-02-10 19:52:43,203 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:52:43,203 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7056 transitions. [2020-02-10 19:52:43,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:52:43,205 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:43,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] [2020-02-10 19:52:43,205 INFO L427 AbstractCegarLoop]: === Iteration 643 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:43,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:43,205 INFO L82 PathProgramCache]: Analyzing trace with hash -927473244, now seen corresponding path program 635 times [2020-02-10 19:52:43,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:43,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800528592] [2020-02-10 19:52:43,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:43,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:43,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 19:52:43,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800528592] [2020-02-10 19:52:43,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:43,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:52:43,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274710701] [2020-02-10 19:52:43,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:52:43,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:43,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:52:43,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:43,759 INFO L87 Difference]: Start difference. First operand 1580 states and 7056 transitions. Second operand 11 states. [2020-02-10 19:52:43,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:43,947 INFO L93 Difference]: Finished difference Result 3019 states and 11894 transitions. [2020-02-10 19:52:43,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:52:43,948 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:52:43,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:43,955 INFO L225 Difference]: With dead ends: 3019 [2020-02-10 19:52:43,956 INFO L226 Difference]: Without dead ends: 2999 [2020-02-10 19:52:43,956 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:52:43,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2999 states. [2020-02-10 19:52:44,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2999 to 1588. [2020-02-10 19:52:44,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1588 states. [2020-02-10 19:52:44,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 7070 transitions. [2020-02-10 19:52:44,023 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 7070 transitions. Word has length 28 [2020-02-10 19:52:44,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:44,023 INFO L479 AbstractCegarLoop]: Abstraction has 1588 states and 7070 transitions. [2020-02-10 19:52:44,023 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:52:44,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 7070 transitions. [2020-02-10 19:52:44,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:52:44,026 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:44,026 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:44,026 INFO L427 AbstractCegarLoop]: === Iteration 644 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:44,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:44,026 INFO L82 PathProgramCache]: Analyzing trace with hash -754225552, now seen corresponding path program 636 times [2020-02-10 19:52:44,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:44,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625404697] [2020-02-10 19:52:44,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:44,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:44,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:44,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625404697] [2020-02-10 19:52:44,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:44,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:52:44,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530263208] [2020-02-10 19:52:44,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:52:44,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:44,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:52:44,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:44,565 INFO L87 Difference]: Start difference. First operand 1588 states and 7070 transitions. Second operand 11 states. [2020-02-10 19:52:44,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:44,819 INFO L93 Difference]: Finished difference Result 3016 states and 11881 transitions. [2020-02-10 19:52:44,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:52:44,819 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:52:44,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:44,826 INFO L225 Difference]: With dead ends: 3016 [2020-02-10 19:52:44,827 INFO L226 Difference]: Without dead ends: 2984 [2020-02-10 19:52:44,827 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:52:44,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2984 states. [2020-02-10 19:52:44,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2984 to 1573. [2020-02-10 19:52:44,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 19:52:44,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7036 transitions. [2020-02-10 19:52:44,894 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7036 transitions. Word has length 28 [2020-02-10 19:52:44,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:44,894 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7036 transitions. [2020-02-10 19:52:44,894 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:52:44,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7036 transitions. [2020-02-10 19:52:44,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:52:44,896 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:44,896 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:44,896 INFO L427 AbstractCegarLoop]: === Iteration 645 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:44,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:44,896 INFO L82 PathProgramCache]: Analyzing trace with hash -53357456, now seen corresponding path program 637 times [2020-02-10 19:52:44,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:44,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452210535] [2020-02-10 19:52:44,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:44,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:45,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:45,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452210535] [2020-02-10 19:52:45,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:45,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:52:45,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034397833] [2020-02-10 19:52:45,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:52:45,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:45,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:52:45,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:45,451 INFO L87 Difference]: Start difference. First operand 1573 states and 7036 transitions. Second operand 11 states. [2020-02-10 19:52:45,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:45,716 INFO L93 Difference]: Finished difference Result 3005 states and 11873 transitions. [2020-02-10 19:52:45,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:52:45,716 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:52:45,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:45,724 INFO L225 Difference]: With dead ends: 3005 [2020-02-10 19:52:45,724 INFO L226 Difference]: Without dead ends: 2989 [2020-02-10 19:52:45,724 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:52:45,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2989 states. [2020-02-10 19:52:45,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2989 to 1585. [2020-02-10 19:52:45,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1585 states. [2020-02-10 19:52:45,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 7070 transitions. [2020-02-10 19:52:45,790 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 7070 transitions. Word has length 28 [2020-02-10 19:52:45,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:45,791 INFO L479 AbstractCegarLoop]: Abstraction has 1585 states and 7070 transitions. [2020-02-10 19:52:45,791 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:52:45,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 7070 transitions. [2020-02-10 19:52:45,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:52:45,793 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:45,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] [2020-02-10 19:52:45,793 INFO L427 AbstractCegarLoop]: === Iteration 646 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:45,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:45,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1436047540, now seen corresponding path program 638 times [2020-02-10 19:52:45,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:45,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070353275] [2020-02-10 19:52:45,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:45,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:46,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:46,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070353275] [2020-02-10 19:52:46,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:46,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:52:46,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835713669] [2020-02-10 19:52:46,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:52:46,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:46,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:52:46,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:46,355 INFO L87 Difference]: Start difference. First operand 1585 states and 7070 transitions. Second operand 11 states. [2020-02-10 19:52:46,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:46,564 INFO L93 Difference]: Finished difference Result 3007 states and 11871 transitions. [2020-02-10 19:52:46,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:52:46,565 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:52:46,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:46,572 INFO L225 Difference]: With dead ends: 3007 [2020-02-10 19:52:46,572 INFO L226 Difference]: Without dead ends: 2983 [2020-02-10 19:52:46,572 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:52:46,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2983 states. [2020-02-10 19:52:46,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2983 to 1579. [2020-02-10 19:52:46,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 19:52:46,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7053 transitions. [2020-02-10 19:52:46,639 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7053 transitions. Word has length 28 [2020-02-10 19:52:46,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:46,639 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7053 transitions. [2020-02-10 19:52:46,639 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:52:46,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7053 transitions. [2020-02-10 19:52:46,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:52:46,642 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:46,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] [2020-02-10 19:52:46,642 INFO L427 AbstractCegarLoop]: === Iteration 647 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:46,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:46,642 INFO L82 PathProgramCache]: Analyzing trace with hash -588587258, now seen corresponding path program 639 times [2020-02-10 19:52:46,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:46,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503263557] [2020-02-10 19:52:46,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:46,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:47,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:47,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503263557] [2020-02-10 19:52:47,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:47,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:52:47,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14141125] [2020-02-10 19:52:47,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:52:47,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:47,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:52:47,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:47,182 INFO L87 Difference]: Start difference. First operand 1579 states and 7053 transitions. Second operand 11 states. [2020-02-10 19:52:47,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:47,438 INFO L93 Difference]: Finished difference Result 3004 states and 11865 transitions. [2020-02-10 19:52:47,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:52:47,439 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:52:47,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:47,446 INFO L225 Difference]: With dead ends: 3004 [2020-02-10 19:52:47,446 INFO L226 Difference]: Without dead ends: 2988 [2020-02-10 19:52:47,447 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:52:47,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2988 states. [2020-02-10 19:52:47,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2988 to 1585. [2020-02-10 19:52:47,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1585 states. [2020-02-10 19:52:47,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 7064 transitions. [2020-02-10 19:52:47,514 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 7064 transitions. Word has length 28 [2020-02-10 19:52:47,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:47,514 INFO L479 AbstractCegarLoop]: Abstraction has 1585 states and 7064 transitions. [2020-02-10 19:52:47,514 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:52:47,514 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 7064 transitions. [2020-02-10 19:52:47,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:52:47,516 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:47,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] [2020-02-10 19:52:47,517 INFO L427 AbstractCegarLoop]: === Iteration 648 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:47,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:47,517 INFO L82 PathProgramCache]: Analyzing trace with hash 329362932, now seen corresponding path program 640 times [2020-02-10 19:52:47,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:47,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641669525] [2020-02-10 19:52:47,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:47,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:48,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:48,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641669525] [2020-02-10 19:52:48,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:48,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:52:48,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615884461] [2020-02-10 19:52:48,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:52:48,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:48,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:52:48,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:48,065 INFO L87 Difference]: Start difference. First operand 1585 states and 7064 transitions. Second operand 11 states. [2020-02-10 19:52:48,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:48,266 INFO L93 Difference]: Finished difference Result 3005 states and 11861 transitions. [2020-02-10 19:52:48,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:52:48,266 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:52:48,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:48,274 INFO L225 Difference]: With dead ends: 3005 [2020-02-10 19:52:48,274 INFO L226 Difference]: Without dead ends: 2982 [2020-02-10 19:52:48,274 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:52:48,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2982 states. [2020-02-10 19:52:48,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2982 to 1579. [2020-02-10 19:52:48,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 19:52:48,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7047 transitions. [2020-02-10 19:52:48,341 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7047 transitions. Word has length 28 [2020-02-10 19:52:48,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:48,341 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7047 transitions. [2020-02-10 19:52:48,341 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:52:48,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7047 transitions. [2020-02-10 19:52:48,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:52:48,344 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:48,344 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:48,344 INFO L427 AbstractCegarLoop]: === Iteration 649 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:48,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:48,344 INFO L82 PathProgramCache]: Analyzing trace with hash -172267642, now seen corresponding path program 641 times [2020-02-10 19:52:48,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:48,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003753763] [2020-02-10 19:52:48,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:48,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:48,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 19:52:48,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003753763] [2020-02-10 19:52:48,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:48,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:52:48,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891937705] [2020-02-10 19:52:48,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:52:48,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:48,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:52:48,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:48,895 INFO L87 Difference]: Start difference. First operand 1579 states and 7047 transitions. Second operand 11 states. [2020-02-10 19:52:49,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:49,095 INFO L93 Difference]: Finished difference Result 3009 states and 11870 transitions. [2020-02-10 19:52:49,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:52:49,095 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:52:49,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:49,102 INFO L225 Difference]: With dead ends: 3009 [2020-02-10 19:52:49,102 INFO L226 Difference]: Without dead ends: 2991 [2020-02-10 19:52:49,102 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:52:49,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2991 states. [2020-02-10 19:52:49,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2991 to 1586. [2020-02-10 19:52:49,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1586 states. [2020-02-10 19:52:49,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1586 states and 7060 transitions. [2020-02-10 19:52:49,170 INFO L78 Accepts]: Start accepts. Automaton has 1586 states and 7060 transitions. Word has length 28 [2020-02-10 19:52:49,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:49,170 INFO L479 AbstractCegarLoop]: Abstraction has 1586 states and 7060 transitions. [2020-02-10 19:52:49,170 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:52:49,170 INFO L276 IsEmpty]: Start isEmpty. Operand 1586 states and 7060 transitions. [2020-02-10 19:52:49,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:52:49,172 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:49,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] [2020-02-10 19:52:49,172 INFO L427 AbstractCegarLoop]: === Iteration 650 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:49,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:49,172 INFO L82 PathProgramCache]: Analyzing trace with hash -743722448, now seen corresponding path program 642 times [2020-02-10 19:52:49,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:49,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170535846] [2020-02-10 19:52:49,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:49,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:49,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 19:52:49,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170535846] [2020-02-10 19:52:49,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:49,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:52:49,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018810792] [2020-02-10 19:52:49,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:52:49,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:49,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:52:49,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:49,714 INFO L87 Difference]: Start difference. First operand 1586 states and 7060 transitions. Second operand 11 states. [2020-02-10 19:52:49,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:49,915 INFO L93 Difference]: Finished difference Result 3008 states and 11861 transitions. [2020-02-10 19:52:49,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:52:49,916 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:52:49,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:49,923 INFO L225 Difference]: With dead ends: 3008 [2020-02-10 19:52:49,924 INFO L226 Difference]: Without dead ends: 2978 [2020-02-10 19:52:49,924 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:52:49,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2978 states. [2020-02-10 19:52:49,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2978 to 1573. [2020-02-10 19:52:49,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 19:52:49,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7030 transitions. [2020-02-10 19:52:49,991 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7030 transitions. Word has length 28 [2020-02-10 19:52:49,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:49,991 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7030 transitions. [2020-02-10 19:52:49,991 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:52:49,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7030 transitions. [2020-02-10 19:52:49,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:52:49,993 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:49,993 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:49,994 INFO L427 AbstractCegarLoop]: === Iteration 651 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:49,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:49,994 INFO L82 PathProgramCache]: Analyzing trace with hash 701848146, now seen corresponding path program 643 times [2020-02-10 19:52:49,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:49,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637584527] [2020-02-10 19:52:49,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:49,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:50,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:50,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637584527] [2020-02-10 19:52:50,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:50,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:52:50,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757018793] [2020-02-10 19:52:50,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:52:50,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:50,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:52:50,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:50,565 INFO L87 Difference]: Start difference. First operand 1573 states and 7030 transitions. Second operand 11 states. [2020-02-10 19:52:50,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:50,790 INFO L93 Difference]: Finished difference Result 3031 states and 11921 transitions. [2020-02-10 19:52:50,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:52:50,791 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:52:50,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:50,798 INFO L225 Difference]: With dead ends: 3031 [2020-02-10 19:52:50,798 INFO L226 Difference]: Without dead ends: 3011 [2020-02-10 19:52:50,798 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:52:50,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3011 states. [2020-02-10 19:52:50,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3011 to 1593. [2020-02-10 19:52:50,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1593 states. [2020-02-10 19:52:50,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 7080 transitions. [2020-02-10 19:52:50,866 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 7080 transitions. Word has length 28 [2020-02-10 19:52:50,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:50,866 INFO L479 AbstractCegarLoop]: Abstraction has 1593 states and 7080 transitions. [2020-02-10 19:52:50,866 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:52:50,866 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 7080 transitions. [2020-02-10 19:52:50,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:52:50,869 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:50,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] [2020-02-10 19:52:50,869 INFO L427 AbstractCegarLoop]: === Iteration 652 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:50,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:50,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1446550644, now seen corresponding path program 644 times [2020-02-10 19:52:50,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:50,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752661167] [2020-02-10 19:52:50,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:50,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:51,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:51,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752661167] [2020-02-10 19:52:51,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:51,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:52:51,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835550176] [2020-02-10 19:52:51,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:52:51,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:51,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:52:51,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:51,428 INFO L87 Difference]: Start difference. First operand 1593 states and 7080 transitions. Second operand 11 states. [2020-02-10 19:52:51,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:51,635 INFO L93 Difference]: Finished difference Result 3029 states and 11909 transitions. [2020-02-10 19:52:51,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:52:51,636 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:52:51,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:51,643 INFO L225 Difference]: With dead ends: 3029 [2020-02-10 19:52:51,644 INFO L226 Difference]: Without dead ends: 3001 [2020-02-10 19:52:51,644 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:52:51,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3001 states. [2020-02-10 19:52:51,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3001 to 1583. [2020-02-10 19:52:51,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 19:52:51,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7054 transitions. [2020-02-10 19:52:51,711 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7054 transitions. Word has length 28 [2020-02-10 19:52:51,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:51,712 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7054 transitions. [2020-02-10 19:52:51,712 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:52:51,712 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7054 transitions. [2020-02-10 19:52:51,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:52:51,714 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:51,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] [2020-02-10 19:52:51,714 INFO L427 AbstractCegarLoop]: === Iteration 653 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:51,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:51,714 INFO L82 PathProgramCache]: Analyzing trace with hash 166618344, now seen corresponding path program 645 times [2020-02-10 19:52:51,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:51,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378463922] [2020-02-10 19:52:51,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:51,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:52,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:52,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378463922] [2020-02-10 19:52:52,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:52,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:52:52,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399919345] [2020-02-10 19:52:52,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:52:52,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:52,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:52:52,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:52,268 INFO L87 Difference]: Start difference. First operand 1583 states and 7054 transitions. Second operand 11 states. [2020-02-10 19:52:52,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:52,445 INFO L93 Difference]: Finished difference Result 3028 states and 11906 transitions. [2020-02-10 19:52:52,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:52:52,445 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:52:52,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:52,453 INFO L225 Difference]: With dead ends: 3028 [2020-02-10 19:52:52,453 INFO L226 Difference]: Without dead ends: 3008 [2020-02-10 19:52:52,453 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:52:52,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3008 states. [2020-02-10 19:52:52,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3008 to 1591. [2020-02-10 19:52:52,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1591 states. [2020-02-10 19:52:52,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1591 states and 7068 transitions. [2020-02-10 19:52:52,520 INFO L78 Accepts]: Start accepts. Automaton has 1591 states and 7068 transitions. Word has length 28 [2020-02-10 19:52:52,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:52,520 INFO L479 AbstractCegarLoop]: Abstraction has 1591 states and 7068 transitions. [2020-02-10 19:52:52,521 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:52:52,521 INFO L276 IsEmpty]: Start isEmpty. Operand 1591 states and 7068 transitions. [2020-02-10 19:52:52,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:52:52,523 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:52,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] [2020-02-10 19:52:52,523 INFO L427 AbstractCegarLoop]: === Iteration 654 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:52,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:52,523 INFO L82 PathProgramCache]: Analyzing trace with hash 339866036, now seen corresponding path program 646 times [2020-02-10 19:52:52,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:52,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163153229] [2020-02-10 19:52:52,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:52,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:53,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 19:52:53,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163153229] [2020-02-10 19:52:53,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:53,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:52:53,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605247353] [2020-02-10 19:52:53,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:52:53,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:53,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:52:53,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:53,064 INFO L87 Difference]: Start difference. First operand 1591 states and 7068 transitions. Second operand 11 states. [2020-02-10 19:52:53,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:53,260 INFO L93 Difference]: Finished difference Result 3025 states and 11893 transitions. [2020-02-10 19:52:53,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:52:53,261 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:52:53,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:53,268 INFO L225 Difference]: With dead ends: 3025 [2020-02-10 19:52:53,268 INFO L226 Difference]: Without dead ends: 3000 [2020-02-10 19:52:53,268 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:52:53,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3000 states. [2020-02-10 19:52:53,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3000 to 1583. [2020-02-10 19:52:53,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 19:52:53,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7046 transitions. [2020-02-10 19:52:53,341 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7046 transitions. Word has length 28 [2020-02-10 19:52:53,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:53,341 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7046 transitions. [2020-02-10 19:52:53,341 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:52:53,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7046 transitions. [2020-02-10 19:52:53,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:52:53,344 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:53,344 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:53,344 INFO L427 AbstractCegarLoop]: === Iteration 655 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:53,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:53,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1772705496, now seen corresponding path program 647 times [2020-02-10 19:52:53,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:53,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427481310] [2020-02-10 19:52:53,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:53,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52: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 19:52:53,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427481310] [2020-02-10 19:52:53,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:53,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:52:53,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518450360] [2020-02-10 19:52:53,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:52:53,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:53,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:52:53,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:53,897 INFO L87 Difference]: Start difference. First operand 1583 states and 7046 transitions. Second operand 11 states. [2020-02-10 19:52:54,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:54,071 INFO L93 Difference]: Finished difference Result 3023 states and 11890 transitions. [2020-02-10 19:52:54,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:52:54,072 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:52:54,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:54,079 INFO L225 Difference]: With dead ends: 3023 [2020-02-10 19:52:54,080 INFO L226 Difference]: Without dead ends: 3005 [2020-02-10 19:52:54,080 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:52:54,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3005 states. [2020-02-10 19:52:54,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3005 to 1590. [2020-02-10 19:52:54,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1590 states. [2020-02-10 19:52:54,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1590 states to 1590 states and 7059 transitions. [2020-02-10 19:52:54,149 INFO L78 Accepts]: Start accepts. Automaton has 1590 states and 7059 transitions. Word has length 28 [2020-02-10 19:52:54,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:54,149 INFO L479 AbstractCegarLoop]: Abstraction has 1590 states and 7059 transitions. [2020-02-10 19:52:54,149 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:52:54,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1590 states and 7059 transitions. [2020-02-10 19:52:54,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:52:54,152 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:54,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] [2020-02-10 19:52:54,152 INFO L427 AbstractCegarLoop]: === Iteration 656 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:54,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:54,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1950806994, now seen corresponding path program 648 times [2020-02-10 19:52:54,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:54,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714510724] [2020-02-10 19:52:54,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:54,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:54,698 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 19:52:54,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 19:52:54,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714510724] [2020-02-10 19:52:54,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:54,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:52:54,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742003292] [2020-02-10 19:52:54,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:52:54,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:54,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:52:54,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:54,706 INFO L87 Difference]: Start difference. First operand 1590 states and 7059 transitions. Second operand 11 states. [2020-02-10 19:52:54,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:54,880 INFO L93 Difference]: Finished difference Result 3022 states and 11881 transitions. [2020-02-10 19:52:54,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:52:54,881 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:52:54,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:54,888 INFO L225 Difference]: With dead ends: 3022 [2020-02-10 19:52:54,888 INFO L226 Difference]: Without dead ends: 2978 [2020-02-10 19:52:54,888 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:52:54,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2978 states. [2020-02-10 19:52:54,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2978 to 1563. [2020-02-10 19:52:54,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2020-02-10 19:52:54,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 7004 transitions. [2020-02-10 19:52:54,955 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 7004 transitions. Word has length 28 [2020-02-10 19:52:54,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:54,955 INFO L479 AbstractCegarLoop]: Abstraction has 1563 states and 7004 transitions. [2020-02-10 19:52:54,955 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:52:54,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 7004 transitions. [2020-02-10 19:52:54,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:52:54,957 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:54,957 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:54,957 INFO L427 AbstractCegarLoop]: === Iteration 657 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:54,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:54,958 INFO L82 PathProgramCache]: Analyzing trace with hash 325182790, now seen corresponding path program 649 times [2020-02-10 19:52:54,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:54,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020000672] [2020-02-10 19:52:54,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:54,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:55,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 19:52:55,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020000672] [2020-02-10 19:52:55,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:55,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:52:55,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002217770] [2020-02-10 19:52:55,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:52:55,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:55,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:52:55,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:55,477 INFO L87 Difference]: Start difference. First operand 1563 states and 7004 transitions. Second operand 11 states. [2020-02-10 19:52:55,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:55,653 INFO L93 Difference]: Finished difference Result 2974 states and 11781 transitions. [2020-02-10 19:52:55,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:52:55,654 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:52:55,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:55,661 INFO L225 Difference]: With dead ends: 2974 [2020-02-10 19:52:55,661 INFO L226 Difference]: Without dead ends: 2958 [2020-02-10 19:52:55,661 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:52:55,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2958 states. [2020-02-10 19:52:55,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2958 to 1580. [2020-02-10 19:52:55,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 19:52:55,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7058 transitions. [2020-02-10 19:52:55,730 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7058 transitions. Word has length 28 [2020-02-10 19:52:55,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:55,730 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7058 transitions. [2020-02-10 19:52:55,730 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:52:55,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7058 transitions. [2020-02-10 19:52:55,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:52:55,733 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:55,733 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:55,733 INFO L427 AbstractCegarLoop]: === Iteration 658 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:55,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:55,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1069885288, now seen corresponding path program 650 times [2020-02-10 19:52:55,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:55,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616514710] [2020-02-10 19:52:55,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:55,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:56,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:56,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616514710] [2020-02-10 19:52:56,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:56,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:52:56,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236788623] [2020-02-10 19:52:56,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:52:56,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:56,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:52:56,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:56,264 INFO L87 Difference]: Start difference. First operand 1580 states and 7058 transitions. Second operand 11 states. [2020-02-10 19:52:56,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:56,401 INFO L93 Difference]: Finished difference Result 2978 states and 11782 transitions. [2020-02-10 19:52:56,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:52:56,401 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:52:56,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:56,408 INFO L225 Difference]: With dead ends: 2978 [2020-02-10 19:52:56,409 INFO L226 Difference]: Without dead ends: 2951 [2020-02-10 19:52:56,409 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:52:56,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2020-02-10 19:52:56,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 1573. [2020-02-10 19:52:56,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 19:52:56,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7040 transitions. [2020-02-10 19:52:56,477 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7040 transitions. Word has length 28 [2020-02-10 19:52:56,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:56,477 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7040 transitions. [2020-02-10 19:52:56,477 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:52:56,477 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7040 transitions. [2020-02-10 19:52:56,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:52:56,480 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:56,480 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:52:56,480 INFO L427 AbstractCegarLoop]: === Iteration 659 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:56,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:56,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1820987970, now seen corresponding path program 651 times [2020-02-10 19:52:56,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:56,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617382576] [2020-02-10 19:52:56,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:56,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:56,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:56,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617382576] [2020-02-10 19:52:56,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:56,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:52:56,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203002341] [2020-02-10 19:52:56,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:52:56,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:56,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:52:56,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:56,998 INFO L87 Difference]: Start difference. First operand 1573 states and 7040 transitions. Second operand 11 states. [2020-02-10 19:52:57,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:57,191 INFO L93 Difference]: Finished difference Result 2965 states and 11757 transitions. [2020-02-10 19:52:57,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:52:57,191 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:52:57,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:57,199 INFO L225 Difference]: With dead ends: 2965 [2020-02-10 19:52:57,199 INFO L226 Difference]: Without dead ends: 2949 [2020-02-10 19:52:57,199 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:52:57,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2949 states. [2020-02-10 19:52:57,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2949 to 1577. [2020-02-10 19:52:57,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 19:52:57,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7047 transitions. [2020-02-10 19:52:57,268 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7047 transitions. Word has length 28 [2020-02-10 19:52:57,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:57,268 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7047 transitions. [2020-02-10 19:52:57,268 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:52:57,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7047 transitions. [2020-02-10 19:52:57,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:52:57,270 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:57,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] [2020-02-10 19:52:57,271 INFO L427 AbstractCegarLoop]: === Iteration 660 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:57,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:57,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1902524520, now seen corresponding path program 652 times [2020-02-10 19:52:57,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:57,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883544786] [2020-02-10 19:52:57,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:57,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:57,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:57,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883544786] [2020-02-10 19:52:57,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:57,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:52:57,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803953122] [2020-02-10 19:52:57,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:52:57,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:57,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:52:57,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:57,798 INFO L87 Difference]: Start difference. First operand 1577 states and 7047 transitions. Second operand 11 states. [2020-02-10 19:52:57,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:57,975 INFO L93 Difference]: Finished difference Result 2963 states and 11749 transitions. [2020-02-10 19:52:57,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:52:57,975 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:52:57,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:57,982 INFO L225 Difference]: With dead ends: 2963 [2020-02-10 19:52:57,983 INFO L226 Difference]: Without dead ends: 2945 [2020-02-10 19:52:57,983 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:52:58,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2945 states. [2020-02-10 19:52:58,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2945 to 1573. [2020-02-10 19:52:58,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 19:52:58,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7036 transitions. [2020-02-10 19:52:58,050 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7036 transitions. Word has length 28 [2020-02-10 19:52:58,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:58,050 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7036 transitions. [2020-02-10 19:52:58,050 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:52:58,050 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7036 transitions. [2020-02-10 19:52:58,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:52:58,052 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:58,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] [2020-02-10 19:52:58,052 INFO L427 AbstractCegarLoop]: === Iteration 661 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:58,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:58,052 INFO L82 PathProgramCache]: Analyzing trace with hash 534655486, now seen corresponding path program 653 times [2020-02-10 19:52:58,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:58,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052293379] [2020-02-10 19:52:58,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:58,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:58,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 19:52:58,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052293379] [2020-02-10 19:52:58,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:58,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:52:58,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677893977] [2020-02-10 19:52:58,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:52:58,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:58,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:52:58,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:58,586 INFO L87 Difference]: Start difference. First operand 1573 states and 7036 transitions. Second operand 11 states. [2020-02-10 19:52:58,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:58,719 INFO L93 Difference]: Finished difference Result 2974 states and 11769 transitions. [2020-02-10 19:52:58,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:52:58,719 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:52:58,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:58,727 INFO L225 Difference]: With dead ends: 2974 [2020-02-10 19:52:58,727 INFO L226 Difference]: Without dead ends: 2954 [2020-02-10 19:52:58,727 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:52:58,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2020-02-10 19:52:58,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 1578. [2020-02-10 19:52:58,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 19:52:58,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7044 transitions. [2020-02-10 19:52:58,795 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7044 transitions. Word has length 28 [2020-02-10 19:52:58,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:58,795 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7044 transitions. [2020-02-10 19:52:58,795 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:52:58,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7044 transitions. [2020-02-10 19:52:58,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:52:58,797 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:58,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] [2020-02-10 19:52:58,797 INFO L427 AbstractCegarLoop]: === Iteration 662 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:58,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:58,798 INFO L82 PathProgramCache]: Analyzing trace with hash -781501818, now seen corresponding path program 654 times [2020-02-10 19:52:58,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:58,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103512832] [2020-02-10 19:52:58,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:58,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:52:59,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:52:59,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103512832] [2020-02-10 19:52:59,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:52:59,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:52:59,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340187771] [2020-02-10 19:52:59,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:52:59,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:52:59,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:52:59,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:52:59,303 INFO L87 Difference]: Start difference. First operand 1578 states and 7044 transitions. Second operand 11 states. [2020-02-10 19:52:59,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:52:59,471 INFO L93 Difference]: Finished difference Result 2968 states and 11753 transitions. [2020-02-10 19:52:59,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:52:59,472 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:52:59,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:52:59,480 INFO L225 Difference]: With dead ends: 2968 [2020-02-10 19:52:59,480 INFO L226 Difference]: Without dead ends: 2944 [2020-02-10 19:52:59,480 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:52:59,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2944 states. [2020-02-10 19:52:59,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2944 to 1568. [2020-02-10 19:52:59,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 19:52:59,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7022 transitions. [2020-02-10 19:52:59,547 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7022 transitions. Word has length 28 [2020-02-10 19:52:59,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:52:59,547 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7022 transitions. [2020-02-10 19:52:59,547 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:52:59,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7022 transitions. [2020-02-10 19:52:59,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:52:59,550 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:52:59,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] [2020-02-10 19:52:59,550 INFO L427 AbstractCegarLoop]: === Iteration 663 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:52:59,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:52:59,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1419274378, now seen corresponding path program 655 times [2020-02-10 19:52:59,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:52:59,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129032919] [2020-02-10 19:52:59,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:52:59,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:00,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:00,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129032919] [2020-02-10 19:53:00,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:00,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:53:00,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374605021] [2020-02-10 19:53:00,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:53:00,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:00,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:53:00,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:00,078 INFO L87 Difference]: Start difference. First operand 1568 states and 7022 transitions. Second operand 11 states. [2020-02-10 19:53:00,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:00,260 INFO L93 Difference]: Finished difference Result 2984 states and 11805 transitions. [2020-02-10 19:53:00,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:53:00,260 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:53:00,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:00,267 INFO L225 Difference]: With dead ends: 2984 [2020-02-10 19:53:00,267 INFO L226 Difference]: Without dead ends: 2968 [2020-02-10 19:53:00,267 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:53:00,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2968 states. [2020-02-10 19:53:00,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2968 to 1582. [2020-02-10 19:53:00,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2020-02-10 19:53:00,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 7061 transitions. [2020-02-10 19:53:00,337 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 7061 transitions. Word has length 28 [2020-02-10 19:53:00,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:00,337 INFO L479 AbstractCegarLoop]: Abstraction has 1582 states and 7061 transitions. [2020-02-10 19:53:00,337 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:53:00,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 7061 transitions. [2020-02-10 19:53:00,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:53:00,340 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:00,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] [2020-02-10 19:53:00,340 INFO L427 AbstractCegarLoop]: === Iteration 664 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:00,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:00,340 INFO L82 PathProgramCache]: Analyzing trace with hash -2130990420, now seen corresponding path program 656 times [2020-02-10 19:53:00,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:00,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035242023] [2020-02-10 19:53:00,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:00,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:00,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:00,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035242023] [2020-02-10 19:53:00,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:00,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:53:00,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547852747] [2020-02-10 19:53:00,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:53:00,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:00,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:53:00,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:00,874 INFO L87 Difference]: Start difference. First operand 1582 states and 7061 transitions. Second operand 11 states. [2020-02-10 19:53:01,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:01,013 INFO L93 Difference]: Finished difference Result 2988 states and 11806 transitions. [2020-02-10 19:53:01,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:53:01,014 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:53:01,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:01,021 INFO L225 Difference]: With dead ends: 2988 [2020-02-10 19:53:01,021 INFO L226 Difference]: Without dead ends: 2961 [2020-02-10 19:53:01,022 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:53:01,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2961 states. [2020-02-10 19:53:01,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2961 to 1575. [2020-02-10 19:53:01,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 19:53:01,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7041 transitions. [2020-02-10 19:53:01,090 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7041 transitions. Word has length 28 [2020-02-10 19:53:01,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:01,091 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7041 transitions. [2020-02-10 19:53:01,091 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:53:01,091 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7041 transitions. [2020-02-10 19:53:01,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:53:01,093 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:01,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] [2020-02-10 19:53:01,093 INFO L427 AbstractCegarLoop]: === Iteration 665 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:01,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:01,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1799981762, now seen corresponding path program 657 times [2020-02-10 19:53:01,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:01,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318977444] [2020-02-10 19:53:01,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:01,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:01,614 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 19:53:01,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 19:53:01,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318977444] [2020-02-10 19:53:01,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:01,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:53:01,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257707290] [2020-02-10 19:53:01,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:53:01,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:01,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:53:01,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:01,622 INFO L87 Difference]: Start difference. First operand 1575 states and 7041 transitions. Second operand 11 states. [2020-02-10 19:53:01,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:01,798 INFO L93 Difference]: Finished difference Result 2980 states and 11791 transitions. [2020-02-10 19:53:01,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:53:01,798 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:53:01,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:01,806 INFO L225 Difference]: With dead ends: 2980 [2020-02-10 19:53:01,806 INFO L226 Difference]: Without dead ends: 2964 [2020-02-10 19:53:01,806 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:53:01,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2964 states. [2020-02-10 19:53:01,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2964 to 1581. [2020-02-10 19:53:01,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 19:53:01,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7052 transitions. [2020-02-10 19:53:01,876 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7052 transitions. Word has length 28 [2020-02-10 19:53:01,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:01,876 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7052 transitions. [2020-02-10 19:53:01,876 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:53:01,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7052 transitions. [2020-02-10 19:53:01,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:53:01,879 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:01,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] [2020-02-10 19:53:01,879 INFO L427 AbstractCegarLoop]: === Iteration 666 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:01,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:01,879 INFO L82 PathProgramCache]: Analyzing trace with hash -882031572, now seen corresponding path program 658 times [2020-02-10 19:53:01,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:01,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762984067] [2020-02-10 19:53:01,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:01,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:02,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 19:53:02,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762984067] [2020-02-10 19:53:02,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:02,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:53:02,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795709732] [2020-02-10 19:53:02,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:53:02,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:02,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:53:02,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:02,403 INFO L87 Difference]: Start difference. First operand 1581 states and 7052 transitions. Second operand 11 states. [2020-02-10 19:53:02,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:02,585 INFO L93 Difference]: Finished difference Result 2981 states and 11787 transitions. [2020-02-10 19:53:02,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:53:02,586 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:53:02,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:02,593 INFO L225 Difference]: With dead ends: 2981 [2020-02-10 19:53:02,593 INFO L226 Difference]: Without dead ends: 2958 [2020-02-10 19:53:02,593 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:53:02,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2958 states. [2020-02-10 19:53:02,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2958 to 1575. [2020-02-10 19:53:02,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 19:53:02,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7035 transitions. [2020-02-10 19:53:02,662 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7035 transitions. Word has length 28 [2020-02-10 19:53:02,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:02,662 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7035 transitions. [2020-02-10 19:53:02,662 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:53:02,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7035 transitions. [2020-02-10 19:53:02,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:53:02,665 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:02,665 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:02,665 INFO L427 AbstractCegarLoop]: === Iteration 667 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:02,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:02,665 INFO L82 PathProgramCache]: Analyzing trace with hash 555661694, now seen corresponding path program 659 times [2020-02-10 19:53:02,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:02,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2643657] [2020-02-10 19:53:02,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:02,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:03,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:03,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2643657] [2020-02-10 19:53:03,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:03,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:53:03,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78042796] [2020-02-10 19:53:03,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:53:03,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:03,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:53:03,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:03,207 INFO L87 Difference]: Start difference. First operand 1575 states and 7035 transitions. Second operand 11 states. [2020-02-10 19:53:03,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:03,346 INFO L93 Difference]: Finished difference Result 2990 states and 11804 transitions. [2020-02-10 19:53:03,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:53:03,347 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:53:03,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:03,354 INFO L225 Difference]: With dead ends: 2990 [2020-02-10 19:53:03,354 INFO L226 Difference]: Without dead ends: 2970 [2020-02-10 19:53:03,355 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:53:03,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2970 states. [2020-02-10 19:53:03,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2970 to 1583. [2020-02-10 19:53:03,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 19:53:03,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7049 transitions. [2020-02-10 19:53:03,422 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7049 transitions. Word has length 28 [2020-02-10 19:53:03,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:03,422 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7049 transitions. [2020-02-10 19:53:03,422 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:53:03,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7049 transitions. [2020-02-10 19:53:03,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:53:03,424 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:03,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] [2020-02-10 19:53:03,424 INFO L427 AbstractCegarLoop]: === Iteration 668 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:03,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:03,425 INFO L82 PathProgramCache]: Analyzing trace with hash 728909386, now seen corresponding path program 660 times [2020-02-10 19:53:03,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:03,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076079467] [2020-02-10 19:53:03,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:03,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:03,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:03,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076079467] [2020-02-10 19:53:03,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:03,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:53:03,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547580537] [2020-02-10 19:53:03,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:53:03,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:03,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:53:03,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:03,953 INFO L87 Difference]: Start difference. First operand 1583 states and 7049 transitions. Second operand 11 states. [2020-02-10 19:53:04,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:04,133 INFO L93 Difference]: Finished difference Result 2987 states and 11791 transitions. [2020-02-10 19:53:04,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:53:04,134 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:53:04,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:04,141 INFO L225 Difference]: With dead ends: 2987 [2020-02-10 19:53:04,141 INFO L226 Difference]: Without dead ends: 2955 [2020-02-10 19:53:04,141 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:53:04,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2955 states. [2020-02-10 19:53:04,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2955 to 1568. [2020-02-10 19:53:04,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 19:53:04,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7017 transitions. [2020-02-10 19:53:04,234 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7017 transitions. Word has length 28 [2020-02-10 19:53:04,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:04,235 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7017 transitions. [2020-02-10 19:53:04,235 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:53:04,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7017 transitions. [2020-02-10 19:53:04,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:53:04,237 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:04,237 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:04,237 INFO L427 AbstractCegarLoop]: === Iteration 669 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:04,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:04,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1461286794, now seen corresponding path program 661 times [2020-02-10 19:53:04,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:04,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773796076] [2020-02-10 19:53:04,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:04,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:04,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:04,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773796076] [2020-02-10 19:53:04,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:04,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:53:04,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701180846] [2020-02-10 19:53:04,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:53:04,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:04,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:53:04,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:04,753 INFO L87 Difference]: Start difference. First operand 1568 states and 7017 transitions. Second operand 11 states. [2020-02-10 19:53:04,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:04,923 INFO L93 Difference]: Finished difference Result 2959 states and 11740 transitions. [2020-02-10 19:53:04,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:53:04,924 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:53:04,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:04,931 INFO L225 Difference]: With dead ends: 2959 [2020-02-10 19:53:04,931 INFO L226 Difference]: Without dead ends: 2943 [2020-02-10 19:53:04,932 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:53:04,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2943 states. [2020-02-10 19:53:04,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2943 to 1576. [2020-02-10 19:53:04,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 19:53:04,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7039 transitions. [2020-02-10 19:53:04,999 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7039 transitions. Word has length 28 [2020-02-10 19:53:04,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:04,999 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7039 transitions. [2020-02-10 19:53:04,999 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:53:04,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7039 transitions. [2020-02-10 19:53:05,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:53:05,001 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:05,001 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:05,001 INFO L427 AbstractCegarLoop]: === Iteration 670 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:05,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:05,002 INFO L82 PathProgramCache]: Analyzing trace with hash 889831988, now seen corresponding path program 662 times [2020-02-10 19:53:05,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:05,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413705323] [2020-02-10 19:53:05,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:05,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:05,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 19:53:05,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413705323] [2020-02-10 19:53:05,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:05,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:53:05,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091960316] [2020-02-10 19:53:05,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:53:05,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:05,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:53:05,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:05,515 INFO L87 Difference]: Start difference. First operand 1576 states and 7039 transitions. Second operand 11 states. [2020-02-10 19:53:05,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:05,709 INFO L93 Difference]: Finished difference Result 2957 states and 11732 transitions. [2020-02-10 19:53:05,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:53:05,709 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:53:05,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:05,716 INFO L225 Difference]: With dead ends: 2957 [2020-02-10 19:53:05,717 INFO L226 Difference]: Without dead ends: 2939 [2020-02-10 19:53:05,717 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:53:05,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2939 states. [2020-02-10 19:53:05,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2939 to 1572. [2020-02-10 19:53:05,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 19:53:05,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7028 transitions. [2020-02-10 19:53:05,784 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7028 transitions. Word has length 28 [2020-02-10 19:53:05,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:05,784 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7028 transitions. [2020-02-10 19:53:05,784 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:53:05,784 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7028 transitions. [2020-02-10 19:53:05,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:53:05,786 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:05,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] [2020-02-10 19:53:05,786 INFO L427 AbstractCegarLoop]: === Iteration 671 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:05,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:05,786 INFO L82 PathProgramCache]: Analyzing trace with hash 388201414, now seen corresponding path program 663 times [2020-02-10 19:53:05,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:05,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822297353] [2020-02-10 19:53:05,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:05,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:06,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 19:53:06,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822297353] [2020-02-10 19:53:06,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:06,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:53:06,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469656020] [2020-02-10 19:53:06,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:53:06,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:06,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:53:06,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:06,306 INFO L87 Difference]: Start difference. First operand 1572 states and 7028 transitions. Second operand 11 states. [2020-02-10 19:53:06,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:06,490 INFO L93 Difference]: Finished difference Result 2964 states and 11748 transitions. [2020-02-10 19:53:06,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:53:06,490 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:53:06,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:06,497 INFO L225 Difference]: With dead ends: 2964 [2020-02-10 19:53:06,497 INFO L226 Difference]: Without dead ends: 2948 [2020-02-10 19:53:06,497 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:53:06,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2948 states. [2020-02-10 19:53:06,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2948 to 1578. [2020-02-10 19:53:06,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 19:53:06,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7039 transitions. [2020-02-10 19:53:06,565 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7039 transitions. Word has length 28 [2020-02-10 19:53:06,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:06,565 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7039 transitions. [2020-02-10 19:53:06,565 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:53:06,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7039 transitions. [2020-02-10 19:53:06,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:53:06,567 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:06,568 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:06,568 INFO L427 AbstractCegarLoop]: === Iteration 672 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:06,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:06,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1306151604, now seen corresponding path program 664 times [2020-02-10 19:53:06,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:06,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740059096] [2020-02-10 19:53:06,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:06,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:07,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 19:53:07,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740059096] [2020-02-10 19:53:07,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:07,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:53:07,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562475695] [2020-02-10 19:53:07,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:53:07,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:07,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:53:07,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:07,097 INFO L87 Difference]: Start difference. First operand 1578 states and 7039 transitions. Second operand 11 states. [2020-02-10 19:53:07,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:07,274 INFO L93 Difference]: Finished difference Result 2965 states and 11744 transitions. [2020-02-10 19:53:07,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:53:07,274 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:53:07,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:07,281 INFO L225 Difference]: With dead ends: 2965 [2020-02-10 19:53:07,281 INFO L226 Difference]: Without dead ends: 2942 [2020-02-10 19:53:07,281 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:53:07,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2942 states. [2020-02-10 19:53:07,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2942 to 1572. [2020-02-10 19:53:07,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 19:53:07,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7024 transitions. [2020-02-10 19:53:07,348 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7024 transitions. Word has length 28 [2020-02-10 19:53:07,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:07,349 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7024 transitions. [2020-02-10 19:53:07,349 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:53:07,349 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7024 transitions. [2020-02-10 19:53:07,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:53:07,351 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:07,351 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:07,351 INFO L427 AbstractCegarLoop]: === Iteration 673 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:07,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:07,352 INFO L82 PathProgramCache]: Analyzing trace with hash -718483194, now seen corresponding path program 665 times [2020-02-10 19:53:07,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:07,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500246121] [2020-02-10 19:53:07,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:07,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:07,877 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 19:53:07,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:07,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500246121] [2020-02-10 19:53:07,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:07,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:53:07,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720977519] [2020-02-10 19:53:07,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:53:07,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:07,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:53:07,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:07,886 INFO L87 Difference]: Start difference. First operand 1572 states and 7024 transitions. Second operand 11 states. [2020-02-10 19:53:08,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:08,074 INFO L93 Difference]: Finished difference Result 2958 states and 11730 transitions. [2020-02-10 19:53:08,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:53:08,075 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:53:08,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:08,082 INFO L225 Difference]: With dead ends: 2958 [2020-02-10 19:53:08,082 INFO L226 Difference]: Without dead ends: 2944 [2020-02-10 19:53:08,082 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:53:08,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2944 states. [2020-02-10 19:53:08,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2944 to 1576. [2020-02-10 19:53:08,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 19:53:08,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7031 transitions. [2020-02-10 19:53:08,150 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7031 transitions. Word has length 28 [2020-02-10 19:53:08,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:08,150 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7031 transitions. [2020-02-10 19:53:08,150 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:53:08,150 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7031 transitions. [2020-02-10 19:53:08,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:53:08,152 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:08,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] [2020-02-10 19:53:08,152 INFO L427 AbstractCegarLoop]: === Iteration 674 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:08,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:08,153 INFO L82 PathProgramCache]: Analyzing trace with hash 770921802, now seen corresponding path program 666 times [2020-02-10 19:53:08,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:08,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376227615] [2020-02-10 19:53:08,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:08,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:08,674 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 19:53:08,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 19:53:08,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376227615] [2020-02-10 19:53:08,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:08,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:53:08,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369004145] [2020-02-10 19:53:08,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:53:08,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:08,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:53:08,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:08,682 INFO L87 Difference]: Start difference. First operand 1576 states and 7031 transitions. Second operand 11 states. [2020-02-10 19:53:08,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:08,861 INFO L93 Difference]: Finished difference Result 2961 states and 11732 transitions. [2020-02-10 19:53:08,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:53:08,862 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:53:08,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:08,870 INFO L225 Difference]: With dead ends: 2961 [2020-02-10 19:53:08,870 INFO L226 Difference]: Without dead ends: 2936 [2020-02-10 19:53:08,870 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:53:08,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2936 states. [2020-02-10 19:53:08,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2936 to 1568. [2020-02-10 19:53:08,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 19:53:08,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7013 transitions. [2020-02-10 19:53:08,937 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7013 transitions. Word has length 28 [2020-02-10 19:53:08,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:08,937 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7013 transitions. [2020-02-10 19:53:08,937 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:53:08,937 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7013 transitions. [2020-02-10 19:53:08,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:53:08,939 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:08,939 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:08,939 INFO L427 AbstractCegarLoop]: === Iteration 675 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:08,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:08,939 INFO L82 PathProgramCache]: Analyzing trace with hash -2078474900, now seen corresponding path program 667 times [2020-02-10 19:53:08,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:08,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194129145] [2020-02-10 19:53:08,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:08,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:09,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:09,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194129145] [2020-02-10 19:53:09,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:09,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:53:09,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117289393] [2020-02-10 19:53:09,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:53:09,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:09,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:53:09,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:09,469 INFO L87 Difference]: Start difference. First operand 1568 states and 7013 transitions. Second operand 11 states. [2020-02-10 19:53:09,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:09,598 INFO L93 Difference]: Finished difference Result 2976 states and 11769 transitions. [2020-02-10 19:53:09,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:53:09,598 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:53:09,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:09,605 INFO L225 Difference]: With dead ends: 2976 [2020-02-10 19:53:09,606 INFO L226 Difference]: Without dead ends: 2956 [2020-02-10 19:53:09,606 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:53:09,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2020-02-10 19:53:09,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 1578. [2020-02-10 19:53:09,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 19:53:09,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7039 transitions. [2020-02-10 19:53:09,673 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7039 transitions. Word has length 28 [2020-02-10 19:53:09,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:09,673 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7039 transitions. [2020-02-10 19:53:09,673 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:53:09,673 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7039 transitions. [2020-02-10 19:53:09,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:53:09,675 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:09,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] [2020-02-10 19:53:09,675 INFO L427 AbstractCegarLoop]: === Iteration 676 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:09,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:09,675 INFO L82 PathProgramCache]: Analyzing trace with hash 900335092, now seen corresponding path program 668 times [2020-02-10 19:53:09,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:09,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456472335] [2020-02-10 19:53:09,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:09,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:10,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 19:53:10,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456472335] [2020-02-10 19:53:10,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:10,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:53:10,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342425901] [2020-02-10 19:53:10,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:53:10,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:10,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:53:10,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:10,199 INFO L87 Difference]: Start difference. First operand 1578 states and 7039 transitions. Second operand 11 states. [2020-02-10 19:53:10,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:10,383 INFO L93 Difference]: Finished difference Result 2970 states and 11753 transitions. [2020-02-10 19:53:10,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:53:10,383 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:53:10,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:10,390 INFO L225 Difference]: With dead ends: 2970 [2020-02-10 19:53:10,390 INFO L226 Difference]: Without dead ends: 2951 [2020-02-10 19:53:10,390 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:53:10,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2020-02-10 19:53:10,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 1573. [2020-02-10 19:53:10,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 19:53:10,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7026 transitions. [2020-02-10 19:53:10,457 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7026 transitions. Word has length 28 [2020-02-10 19:53:10,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:10,457 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7026 transitions. [2020-02-10 19:53:10,457 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:53:10,457 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7026 transitions. [2020-02-10 19:53:10,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:53:10,459 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:10,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] [2020-02-10 19:53:10,460 INFO L427 AbstractCegarLoop]: === Iteration 677 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:10,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:10,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1143407016, now seen corresponding path program 669 times [2020-02-10 19:53:10,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:10,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307756802] [2020-02-10 19:53:10,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:10,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:11,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:11,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307756802] [2020-02-10 19:53:11,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:11,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:53:11,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369584977] [2020-02-10 19:53:11,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:53:11,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:11,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:53:11,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:11,001 INFO L87 Difference]: Start difference. First operand 1573 states and 7026 transitions. Second operand 11 states. [2020-02-10 19:53:11,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:11,141 INFO L93 Difference]: Finished difference Result 2982 states and 11779 transitions. [2020-02-10 19:53:11,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:53:11,141 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:53:11,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:11,148 INFO L225 Difference]: With dead ends: 2982 [2020-02-10 19:53:11,148 INFO L226 Difference]: Without dead ends: 2962 [2020-02-10 19:53:11,148 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:53:11,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2962 states. [2020-02-10 19:53:11,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2962 to 1581. [2020-02-10 19:53:11,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 19:53:11,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7040 transitions. [2020-02-10 19:53:11,215 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7040 transitions. Word has length 28 [2020-02-10 19:53:11,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:11,216 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7040 transitions. [2020-02-10 19:53:11,216 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:53:11,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7040 transitions. [2020-02-10 19:53:11,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:53:11,218 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:11,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] [2020-02-10 19:53:11,218 INFO L427 AbstractCegarLoop]: === Iteration 678 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:11,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:11,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1316654708, now seen corresponding path program 670 times [2020-02-10 19:53:11,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:11,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785654646] [2020-02-10 19:53:11,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:11,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:11,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 19:53:11,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785654646] [2020-02-10 19:53:11,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:11,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:53:11,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741883969] [2020-02-10 19:53:11,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:53:11,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:11,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:53:11,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:11,750 INFO L87 Difference]: Start difference. First operand 1581 states and 7040 transitions. Second operand 11 states. [2020-02-10 19:53:11,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:11,926 INFO L93 Difference]: Finished difference Result 2979 states and 11766 transitions. [2020-02-10 19:53:11,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:53:11,927 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:53:11,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:11,935 INFO L225 Difference]: With dead ends: 2979 [2020-02-10 19:53:11,935 INFO L226 Difference]: Without dead ends: 2954 [2020-02-10 19:53:11,935 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:53:11,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2020-02-10 19:53:11,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 1573. [2020-02-10 19:53:11,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 19:53:12,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7021 transitions. [2020-02-10 19:53:12,002 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7021 transitions. Word has length 28 [2020-02-10 19:53:12,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:12,002 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7021 transitions. [2020-02-10 19:53:12,002 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:53:12,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7021 transitions. [2020-02-10 19:53:12,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:53:12,004 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:12,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] [2020-02-10 19:53:12,004 INFO L427 AbstractCegarLoop]: === Iteration 679 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:12,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:12,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1976046248, now seen corresponding path program 671 times [2020-02-10 19:53:12,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:12,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112967069] [2020-02-10 19:53:12,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:12,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:12,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:12,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112967069] [2020-02-10 19:53:12,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:12,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:53:12,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566526591] [2020-02-10 19:53:12,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:53:12,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:12,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:53:12,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:12,536 INFO L87 Difference]: Start difference. First operand 1573 states and 7021 transitions. Second operand 11 states. [2020-02-10 19:53:12,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:12,714 INFO L93 Difference]: Finished difference Result 2966 states and 11741 transitions. [2020-02-10 19:53:12,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:53:12,714 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:53:12,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:12,721 INFO L225 Difference]: With dead ends: 2966 [2020-02-10 19:53:12,721 INFO L226 Difference]: Without dead ends: 2952 [2020-02-10 19:53:12,721 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:53:12,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2952 states. [2020-02-10 19:53:12,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2952 to 1577. [2020-02-10 19:53:12,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 19:53:12,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7028 transitions. [2020-02-10 19:53:12,789 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7028 transitions. Word has length 28 [2020-02-10 19:53:12,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:12,789 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7028 transitions. [2020-02-10 19:53:12,789 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:53:12,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7028 transitions. [2020-02-10 19:53:12,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:53:12,792 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:12,792 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:12,792 INFO L427 AbstractCegarLoop]: === Iteration 680 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:12,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:12,792 INFO L82 PathProgramCache]: Analyzing trace with hash -829516052, now seen corresponding path program 672 times [2020-02-10 19:53:12,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:12,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166560408] [2020-02-10 19:53:12,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:12,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:13,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:13,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166560408] [2020-02-10 19:53:13,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:13,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:53:13,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964566725] [2020-02-10 19:53:13,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:53:13,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:13,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:53:13,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:13,318 INFO L87 Difference]: Start difference. First operand 1577 states and 7028 transitions. Second operand 11 states. [2020-02-10 19:53:13,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:13,495 INFO L93 Difference]: Finished difference Result 2969 states and 11743 transitions. [2020-02-10 19:53:13,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:53:13,495 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:53:13,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:13,502 INFO L225 Difference]: With dead ends: 2969 [2020-02-10 19:53:13,502 INFO L226 Difference]: Without dead ends: 2938 [2020-02-10 19:53:13,502 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:53:13,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2938 states. [2020-02-10 19:53:13,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2938 to 1563. [2020-02-10 19:53:13,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2020-02-10 19:53:13,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 6999 transitions. [2020-02-10 19:53:13,571 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 6999 transitions. Word has length 28 [2020-02-10 19:53:13,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:13,571 INFO L479 AbstractCegarLoop]: Abstraction has 1563 states and 6999 transitions. [2020-02-10 19:53:13,571 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:53:13,572 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 6999 transitions. [2020-02-10 19:53:13,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:53:13,574 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:13,574 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:13,574 INFO L427 AbstractCegarLoop]: === Iteration 681 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:13,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:13,574 INFO L82 PathProgramCache]: Analyzing trace with hash -2033247324, now seen corresponding path program 673 times [2020-02-10 19:53:13,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:13,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48486445] [2020-02-10 19:53:13,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:13,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:14,096 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 19:53:14,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:14,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48486445] [2020-02-10 19:53:14,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:14,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:53:14,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534210178] [2020-02-10 19:53:14,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:53:14,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:14,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:53:14,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:14,104 INFO L87 Difference]: Start difference. First operand 1563 states and 6999 transitions. Second operand 11 states. [2020-02-10 19:53:14,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:14,286 INFO L93 Difference]: Finished difference Result 2957 states and 11739 transitions. [2020-02-10 19:53:14,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:53:14,286 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:53:14,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:14,294 INFO L225 Difference]: With dead ends: 2957 [2020-02-10 19:53:14,294 INFO L226 Difference]: Without dead ends: 2941 [2020-02-10 19:53:14,294 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:53:14,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2941 states. [2020-02-10 19:53:14,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2941 to 1577. [2020-02-10 19:53:14,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 19:53:14,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7044 transitions. [2020-02-10 19:53:14,362 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7044 transitions. Word has length 28 [2020-02-10 19:53:14,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:14,362 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7044 transitions. [2020-02-10 19:53:14,362 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:53:14,362 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7044 transitions. [2020-02-10 19:53:14,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:53:14,364 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:14,364 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:14,364 INFO L427 AbstractCegarLoop]: === Iteration 682 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:14,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:14,365 INFO L82 PathProgramCache]: Analyzing trace with hash -543842328, now seen corresponding path program 674 times [2020-02-10 19:53:14,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:14,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184772238] [2020-02-10 19:53:14,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:14,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:14,886 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 19:53:14,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:14,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184772238] [2020-02-10 19:53:14,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:14,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:53:14,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524457346] [2020-02-10 19:53:14,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:53:14,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:14,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:53:14,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:14,894 INFO L87 Difference]: Start difference. First operand 1577 states and 7044 transitions. Second operand 11 states. [2020-02-10 19:53:15,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:15,107 INFO L93 Difference]: Finished difference Result 2959 states and 11737 transitions. [2020-02-10 19:53:15,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:53:15,108 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:53:15,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:15,115 INFO L225 Difference]: With dead ends: 2959 [2020-02-10 19:53:15,115 INFO L226 Difference]: Without dead ends: 2935 [2020-02-10 19:53:15,115 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:53:15,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2935 states. [2020-02-10 19:53:15,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2935 to 1571. [2020-02-10 19:53:15,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 19:53:15,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7029 transitions. [2020-02-10 19:53:15,185 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7029 transitions. Word has length 28 [2020-02-10 19:53:15,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:15,185 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7029 transitions. [2020-02-10 19:53:15,185 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:53:15,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7029 transitions. [2020-02-10 19:53:15,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:53:15,187 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:15,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] [2020-02-10 19:53:15,187 INFO L427 AbstractCegarLoop]: === Iteration 683 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:15,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:15,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1495391746, now seen corresponding path program 675 times [2020-02-10 19:53:15,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:15,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451319432] [2020-02-10 19:53:15,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:15,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:15,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 19:53:15,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451319432] [2020-02-10 19:53:15,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:15,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:53:15,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319258317] [2020-02-10 19:53:15,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:53:15,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:15,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:53:15,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:15,708 INFO L87 Difference]: Start difference. First operand 1571 states and 7029 transitions. Second operand 11 states. [2020-02-10 19:53:15,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:15,898 INFO L93 Difference]: Finished difference Result 2951 states and 11721 transitions. [2020-02-10 19:53:15,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:53:15,898 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:53:15,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:15,906 INFO L225 Difference]: With dead ends: 2951 [2020-02-10 19:53:15,906 INFO L226 Difference]: Without dead ends: 2935 [2020-02-10 19:53:15,906 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:53:15,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2935 states. [2020-02-10 19:53:15,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2935 to 1575. [2020-02-10 19:53:15,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 19:53:15,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7036 transitions. [2020-02-10 19:53:15,977 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7036 transitions. Word has length 28 [2020-02-10 19:53:15,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:15,977 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7036 transitions. [2020-02-10 19:53:15,977 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:53:15,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7036 transitions. [2020-02-10 19:53:15,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:53:15,980 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:15,980 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:15,980 INFO L427 AbstractCegarLoop]: === Iteration 684 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:15,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:15,980 INFO L82 PathProgramCache]: Analyzing trace with hash -2066846552, now seen corresponding path program 676 times [2020-02-10 19:53:15,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:15,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754145276] [2020-02-10 19:53:15,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:15,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:16,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 19:53:16,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754145276] [2020-02-10 19:53:16,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:16,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:53:16,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130187231] [2020-02-10 19:53:16,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:53:16,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:16,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:53:16,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:16,518 INFO L87 Difference]: Start difference. First operand 1575 states and 7036 transitions. Second operand 11 states. [2020-02-10 19:53:16,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:16,696 INFO L93 Difference]: Finished difference Result 2949 states and 11713 transitions. [2020-02-10 19:53:16,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:53:16,696 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:53:16,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:16,704 INFO L225 Difference]: With dead ends: 2949 [2020-02-10 19:53:16,704 INFO L226 Difference]: Without dead ends: 2931 [2020-02-10 19:53:16,704 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:53:16,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2931 states. [2020-02-10 19:53:16,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2931 to 1571. [2020-02-10 19:53:16,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 19:53:16,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7025 transitions. [2020-02-10 19:53:16,771 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7025 transitions. Word has length 28 [2020-02-10 19:53:16,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:16,772 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7025 transitions. [2020-02-10 19:53:16,772 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:53:16,772 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7025 transitions. [2020-02-10 19:53:16,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:53:16,774 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:16,774 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:16,774 INFO L427 AbstractCegarLoop]: === Iteration 685 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:16,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:16,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1079072130, now seen corresponding path program 677 times [2020-02-10 19:53:16,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:16,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833213217] [2020-02-10 19:53:16,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:16,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:17,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 19:53:17,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833213217] [2020-02-10 19:53:17,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:17,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:53:17,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967734562] [2020-02-10 19:53:17,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:53:17,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:17,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:53:17,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:17,292 INFO L87 Difference]: Start difference. First operand 1571 states and 7025 transitions. Second operand 11 states. [2020-02-10 19:53:17,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:17,473 INFO L93 Difference]: Finished difference Result 2955 states and 11725 transitions. [2020-02-10 19:53:17,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:53:17,474 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:53:17,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:17,481 INFO L225 Difference]: With dead ends: 2955 [2020-02-10 19:53:17,481 INFO L226 Difference]: Without dead ends: 2937 [2020-02-10 19:53:17,481 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:53:17,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2937 states. [2020-02-10 19:53:17,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2937 to 1575. [2020-02-10 19:53:17,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 19:53:17,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7032 transitions. [2020-02-10 19:53:17,548 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7032 transitions. Word has length 28 [2020-02-10 19:53:17,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:17,548 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7032 transitions. [2020-02-10 19:53:17,548 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:53:17,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7032 transitions. [2020-02-10 19:53:17,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:53:17,550 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:17,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] [2020-02-10 19:53:17,551 INFO L427 AbstractCegarLoop]: === Iteration 686 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:17,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:17,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1155035364, now seen corresponding path program 678 times [2020-02-10 19:53:17,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:17,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534152788] [2020-02-10 19:53:17,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:17,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:18,064 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2020-02-10 19:53:18,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 19:53:18,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534152788] [2020-02-10 19:53:18,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:18,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:53:18,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006977212] [2020-02-10 19:53:18,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:53:18,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:18,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:53:18,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:18,072 INFO L87 Difference]: Start difference. First operand 1575 states and 7032 transitions. Second operand 11 states. [2020-02-10 19:53:18,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:18,281 INFO L93 Difference]: Finished difference Result 2951 states and 11713 transitions. [2020-02-10 19:53:18,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:53:18,282 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:53:18,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:18,289 INFO L225 Difference]: With dead ends: 2951 [2020-02-10 19:53:18,289 INFO L226 Difference]: Without dead ends: 2929 [2020-02-10 19:53:18,289 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:53:18,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2929 states. [2020-02-10 19:53:18,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2929 to 1567. [2020-02-10 19:53:18,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 19:53:18,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7014 transitions. [2020-02-10 19:53:18,356 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7014 transitions. Word has length 28 [2020-02-10 19:53:18,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:18,356 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7014 transitions. [2020-02-10 19:53:18,356 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:53:18,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7014 transitions. [2020-02-10 19:53:18,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:53:18,359 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:18,359 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:18,359 INFO L427 AbstractCegarLoop]: === Iteration 687 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:18,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:18,359 INFO L82 PathProgramCache]: Analyzing trace with hash -939155736, now seen corresponding path program 679 times [2020-02-10 19:53:18,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:18,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176738837] [2020-02-10 19:53:18,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:18,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:18,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:18,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176738837] [2020-02-10 19:53:18,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:18,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:53:18,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827011873] [2020-02-10 19:53:18,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:53:18,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:18,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:53:18,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:18,888 INFO L87 Difference]: Start difference. First operand 1567 states and 7014 transitions. Second operand 11 states. [2020-02-10 19:53:19,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:19,083 INFO L93 Difference]: Finished difference Result 2967 states and 11764 transitions. [2020-02-10 19:53:19,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:53:19,083 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:53:19,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:19,091 INFO L225 Difference]: With dead ends: 2967 [2020-02-10 19:53:19,091 INFO L226 Difference]: Without dead ends: 2951 [2020-02-10 19:53:19,091 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:53:19,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2020-02-10 19:53:19,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 1579. [2020-02-10 19:53:19,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 19:53:19,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7048 transitions. [2020-02-10 19:53:19,158 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7048 transitions. Word has length 28 [2020-02-10 19:53:19,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:19,158 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7048 transitions. [2020-02-10 19:53:19,158 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:53:19,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7048 transitions. [2020-02-10 19:53:19,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:53:19,160 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:19,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] [2020-02-10 19:53:19,161 INFO L427 AbstractCegarLoop]: === Iteration 688 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:19,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:19,161 INFO L82 PathProgramCache]: Analyzing trace with hash 550249260, now seen corresponding path program 680 times [2020-02-10 19:53:19,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:19,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509673254] [2020-02-10 19:53:19,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:19,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:19,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:19,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509673254] [2020-02-10 19:53:19,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:19,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:53:19,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698419421] [2020-02-10 19:53:19,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:53:19,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:19,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:53:19,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:19,678 INFO L87 Difference]: Start difference. First operand 1579 states and 7048 transitions. Second operand 11 states. [2020-02-10 19:53:19,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:19,923 INFO L93 Difference]: Finished difference Result 2969 states and 11762 transitions. [2020-02-10 19:53:19,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:53:19,924 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:53:19,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:19,931 INFO L225 Difference]: With dead ends: 2969 [2020-02-10 19:53:19,931 INFO L226 Difference]: Without dead ends: 2945 [2020-02-10 19:53:19,932 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:53:19,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2945 states. [2020-02-10 19:53:19,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2945 to 1573. [2020-02-10 19:53:19,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 19:53:19,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7031 transitions. [2020-02-10 19:53:19,999 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7031 transitions. Word has length 28 [2020-02-10 19:53:19,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:19,999 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7031 transitions. [2020-02-10 19:53:19,999 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:53:19,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7031 transitions. [2020-02-10 19:53:20,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:53:20,001 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:20,001 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:20,002 INFO L427 AbstractCegarLoop]: === Iteration 689 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:20,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:20,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1474385538, now seen corresponding path program 681 times [2020-02-10 19:53:20,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:20,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486619494] [2020-02-10 19:53:20,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:20,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:20,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 19:53:20,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486619494] [2020-02-10 19:53:20,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:20,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:53:20,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508767155] [2020-02-10 19:53:20,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:53:20,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:20,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:53:20,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:20,540 INFO L87 Difference]: Start difference. First operand 1573 states and 7031 transitions. Second operand 11 states. [2020-02-10 19:53:20,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:20,783 INFO L93 Difference]: Finished difference Result 2966 states and 11756 transitions. [2020-02-10 19:53:20,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:53:20,784 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:53:20,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:20,791 INFO L225 Difference]: With dead ends: 2966 [2020-02-10 19:53:20,791 INFO L226 Difference]: Without dead ends: 2950 [2020-02-10 19:53:20,792 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:53:20,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2020-02-10 19:53:20,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 1579. [2020-02-10 19:53:20,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 19:53:20,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7042 transitions. [2020-02-10 19:53:20,859 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7042 transitions. Word has length 28 [2020-02-10 19:53:20,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:20,859 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7042 transitions. [2020-02-10 19:53:20,859 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:53:20,859 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7042 transitions. [2020-02-10 19:53:20,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:53:20,861 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:20,862 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:20,862 INFO L427 AbstractCegarLoop]: === Iteration 690 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:20,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:20,862 INFO L82 PathProgramCache]: Analyzing trace with hash -556435348, now seen corresponding path program 682 times [2020-02-10 19:53:20,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:20,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798099402] [2020-02-10 19:53:20,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:20,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:21,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 19:53:21,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798099402] [2020-02-10 19:53:21,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:21,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:53:21,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134483587] [2020-02-10 19:53:21,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:53:21,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:21,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:53:21,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:21,386 INFO L87 Difference]: Start difference. First operand 1579 states and 7042 transitions. Second operand 11 states. [2020-02-10 19:53:21,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:21,581 INFO L93 Difference]: Finished difference Result 2967 states and 11752 transitions. [2020-02-10 19:53:21,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:53:21,582 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:53:21,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:21,589 INFO L225 Difference]: With dead ends: 2967 [2020-02-10 19:53:21,589 INFO L226 Difference]: Without dead ends: 2944 [2020-02-10 19:53:21,589 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:53:21,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2944 states. [2020-02-10 19:53:21,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2944 to 1573. [2020-02-10 19:53:21,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 19:53:21,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7025 transitions. [2020-02-10 19:53:21,656 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7025 transitions. Word has length 28 [2020-02-10 19:53:21,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:21,656 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7025 transitions. [2020-02-10 19:53:21,656 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:53:21,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7025 transitions. [2020-02-10 19:53:21,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:53:21,659 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:21,659 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:21,659 INFO L427 AbstractCegarLoop]: === Iteration 691 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:21,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:21,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1058065922, now seen corresponding path program 683 times [2020-02-10 19:53:21,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:21,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429030533] [2020-02-10 19:53:21,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:21,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:22,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:22,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429030533] [2020-02-10 19:53:22,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:22,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:53:22,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547724668] [2020-02-10 19:53:22,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:53:22,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:22,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:53:22,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:22,196 INFO L87 Difference]: Start difference. First operand 1573 states and 7025 transitions. Second operand 11 states. [2020-02-10 19:53:22,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:22,380 INFO L93 Difference]: Finished difference Result 2971 states and 11761 transitions. [2020-02-10 19:53:22,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:53:22,380 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:53:22,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:22,388 INFO L225 Difference]: With dead ends: 2971 [2020-02-10 19:53:22,388 INFO L226 Difference]: Without dead ends: 2953 [2020-02-10 19:53:22,388 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:53:22,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2953 states. [2020-02-10 19:53:22,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2953 to 1580. [2020-02-10 19:53:22,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 19:53:22,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7038 transitions. [2020-02-10 19:53:22,474 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7038 transitions. Word has length 28 [2020-02-10 19:53:22,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:22,475 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7038 transitions. [2020-02-10 19:53:22,475 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:53:22,475 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7038 transitions. [2020-02-10 19:53:22,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:53:22,477 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:22,477 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:22,477 INFO L427 AbstractCegarLoop]: === Iteration 692 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:22,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:22,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1629520728, now seen corresponding path program 684 times [2020-02-10 19:53:22,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:22,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322283299] [2020-02-10 19:53:22,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:22,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:23,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 19:53:23,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322283299] [2020-02-10 19:53:23,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:23,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:53:23,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140425246] [2020-02-10 19:53:23,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:53:23,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:23,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:53:23,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:23,006 INFO L87 Difference]: Start difference. First operand 1580 states and 7038 transitions. Second operand 11 states. [2020-02-10 19:53:23,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:23,197 INFO L93 Difference]: Finished difference Result 2970 states and 11752 transitions. [2020-02-10 19:53:23,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:53:23,197 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:53:23,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:23,205 INFO L225 Difference]: With dead ends: 2970 [2020-02-10 19:53:23,205 INFO L226 Difference]: Without dead ends: 2940 [2020-02-10 19:53:23,205 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:53:23,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2940 states. [2020-02-10 19:53:23,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2940 to 1567. [2020-02-10 19:53:23,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 19:53:23,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7010 transitions. [2020-02-10 19:53:23,273 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7010 transitions. Word has length 28 [2020-02-10 19:53:23,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:23,273 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7010 transitions. [2020-02-10 19:53:23,273 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:53:23,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7010 transitions. [2020-02-10 19:53:23,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:53:23,275 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:23,275 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:23,275 INFO L427 AbstractCegarLoop]: === Iteration 693 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:23,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:23,275 INFO L82 PathProgramCache]: Analyzing trace with hash -907646424, now seen corresponding path program 685 times [2020-02-10 19:53:23,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:23,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128371021] [2020-02-10 19:53:23,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:23,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:23,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:23,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128371021] [2020-02-10 19:53:23,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:23,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:53:23,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021776528] [2020-02-10 19:53:23,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:53:23,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:23,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:53:23,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:23,788 INFO L87 Difference]: Start difference. First operand 1567 states and 7010 transitions. Second operand 11 states. [2020-02-10 19:53:23,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:23,971 INFO L93 Difference]: Finished difference Result 2950 states and 11715 transitions. [2020-02-10 19:53:23,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:53:23,971 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:53:23,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:23,978 INFO L225 Difference]: With dead ends: 2950 [2020-02-10 19:53:23,978 INFO L226 Difference]: Without dead ends: 2934 [2020-02-10 19:53:23,978 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:53:24,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2934 states. [2020-02-10 19:53:24,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2934 to 1575. [2020-02-10 19:53:24,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 19:53:24,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7032 transitions. [2020-02-10 19:53:24,046 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7032 transitions. Word has length 28 [2020-02-10 19:53:24,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:24,046 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7032 transitions. [2020-02-10 19:53:24,046 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:53:24,047 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7032 transitions. [2020-02-10 19:53:24,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:53:24,049 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:24,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] [2020-02-10 19:53:24,049 INFO L427 AbstractCegarLoop]: === Iteration 694 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:24,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:24,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1479101230, now seen corresponding path program 686 times [2020-02-10 19:53:24,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:24,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986024318] [2020-02-10 19:53:24,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:24,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:24,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:24,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986024318] [2020-02-10 19:53:24,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:24,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:53:24,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981060695] [2020-02-10 19:53:24,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:53:24,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:24,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:53:24,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:24,565 INFO L87 Difference]: Start difference. First operand 1575 states and 7032 transitions. Second operand 11 states. [2020-02-10 19:53:24,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:24,752 INFO L93 Difference]: Finished difference Result 2948 states and 11707 transitions. [2020-02-10 19:53:24,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:53:24,753 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:53:24,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:24,759 INFO L225 Difference]: With dead ends: 2948 [2020-02-10 19:53:24,760 INFO L226 Difference]: Without dead ends: 2930 [2020-02-10 19:53:24,760 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:53:24,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2020-02-10 19:53:24,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 1571. [2020-02-10 19:53:24,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 19:53:24,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7021 transitions. [2020-02-10 19:53:24,826 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7021 transitions. Word has length 28 [2020-02-10 19:53:24,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:24,826 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7021 transitions. [2020-02-10 19:53:24,827 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:53:24,827 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7021 transitions. [2020-02-10 19:53:24,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:53:24,829 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:24,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] [2020-02-10 19:53:24,829 INFO L427 AbstractCegarLoop]: === Iteration 695 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:24,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:24,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1980731804, now seen corresponding path program 687 times [2020-02-10 19:53:24,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:24,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775903402] [2020-02-10 19:53:24,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:24,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:25,346 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 19:53:25,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:25,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775903402] [2020-02-10 19:53:25,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:25,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:53:25,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605161008] [2020-02-10 19:53:25,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:53:25,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:25,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:53:25,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:25,354 INFO L87 Difference]: Start difference. First operand 1571 states and 7021 transitions. Second operand 11 states. [2020-02-10 19:53:25,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:25,562 INFO L93 Difference]: Finished difference Result 2955 states and 11723 transitions. [2020-02-10 19:53:25,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:53:25,563 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:53:25,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:25,570 INFO L225 Difference]: With dead ends: 2955 [2020-02-10 19:53:25,570 INFO L226 Difference]: Without dead ends: 2939 [2020-02-10 19:53:25,570 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:53:25,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2939 states. [2020-02-10 19:53:25,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2939 to 1577. [2020-02-10 19:53:25,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 19:53:25,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7032 transitions. [2020-02-10 19:53:25,638 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7032 transitions. Word has length 28 [2020-02-10 19:53:25,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:25,638 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7032 transitions. [2020-02-10 19:53:25,638 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:53:25,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7032 transitions. [2020-02-10 19:53:25,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:53:25,641 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:25,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] [2020-02-10 19:53:25,641 INFO L427 AbstractCegarLoop]: === Iteration 696 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:25,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:25,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1062781614, now seen corresponding path program 688 times [2020-02-10 19:53:25,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:25,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094715478] [2020-02-10 19:53:25,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:25,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:26,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:26,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094715478] [2020-02-10 19:53:26,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:26,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:53:26,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439250655] [2020-02-10 19:53:26,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:53:26,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:26,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:53:26,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:26,173 INFO L87 Difference]: Start difference. First operand 1577 states and 7032 transitions. Second operand 11 states. [2020-02-10 19:53:26,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:26,377 INFO L93 Difference]: Finished difference Result 2956 states and 11719 transitions. [2020-02-10 19:53:26,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:53:26,378 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:53:26,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:26,385 INFO L225 Difference]: With dead ends: 2956 [2020-02-10 19:53:26,386 INFO L226 Difference]: Without dead ends: 2933 [2020-02-10 19:53:26,386 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:53:26,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2933 states. [2020-02-10 19:53:26,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2933 to 1571. [2020-02-10 19:53:26,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 19:53:26,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7017 transitions. [2020-02-10 19:53:26,454 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7017 transitions. Word has length 28 [2020-02-10 19:53:26,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:26,454 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7017 transitions. [2020-02-10 19:53:26,454 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:53:26,454 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7017 transitions. [2020-02-10 19:53:26,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:53:26,456 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:26,456 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:26,456 INFO L427 AbstractCegarLoop]: === Iteration 697 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:26,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:26,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1207550884, now seen corresponding path program 689 times [2020-02-10 19:53:26,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:26,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760401043] [2020-02-10 19:53:26,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:26,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:26,980 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 19:53:26,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 19:53:26,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760401043] [2020-02-10 19:53:26,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:26,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:53:26,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472605796] [2020-02-10 19:53:26,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:53:26,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:26,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:53:26,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:26,988 INFO L87 Difference]: Start difference. First operand 1571 states and 7017 transitions. Second operand 11 states. [2020-02-10 19:53:27,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:27,169 INFO L93 Difference]: Finished difference Result 2949 states and 11705 transitions. [2020-02-10 19:53:27,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:53:27,170 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:53:27,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:27,177 INFO L225 Difference]: With dead ends: 2949 [2020-02-10 19:53:27,177 INFO L226 Difference]: Without dead ends: 2935 [2020-02-10 19:53:27,177 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:53:27,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2935 states. [2020-02-10 19:53:27,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2935 to 1575. [2020-02-10 19:53:27,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 19:53:27,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7024 transitions. [2020-02-10 19:53:27,244 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7024 transitions. Word has length 28 [2020-02-10 19:53:27,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:27,244 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7024 transitions. [2020-02-10 19:53:27,245 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:53:27,245 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7024 transitions. [2020-02-10 19:53:27,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:53:27,247 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:27,247 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:27,247 INFO L427 AbstractCegarLoop]: === Iteration 698 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:27,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:27,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1598011416, now seen corresponding path program 690 times [2020-02-10 19:53:27,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:27,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950551044] [2020-02-10 19:53:27,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:27,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:27,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 19:53:27,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950551044] [2020-02-10 19:53:27,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:27,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:53:27,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659092016] [2020-02-10 19:53:27,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:53:27,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:27,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:53:27,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:27,789 INFO L87 Difference]: Start difference. First operand 1575 states and 7024 transitions. Second operand 11 states. [2020-02-10 19:53:27,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:27,974 INFO L93 Difference]: Finished difference Result 2952 states and 11707 transitions. [2020-02-10 19:53:27,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:53:27,974 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:53:27,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:27,981 INFO L225 Difference]: With dead ends: 2952 [2020-02-10 19:53:27,981 INFO L226 Difference]: Without dead ends: 2927 [2020-02-10 19:53:27,981 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:53:28,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2927 states. [2020-02-10 19:53:28,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2927 to 1567. [2020-02-10 19:53:28,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 19:53:28,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7006 transitions. [2020-02-10 19:53:28,048 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7006 transitions. Word has length 28 [2020-02-10 19:53:28,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:28,048 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7006 transitions. [2020-02-10 19:53:28,048 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:53:28,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7006 transitions. [2020-02-10 19:53:28,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:53:28,050 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:28,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] [2020-02-10 19:53:28,050 INFO L427 AbstractCegarLoop]: === Iteration 699 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:28,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:28,051 INFO L82 PathProgramCache]: Analyzing trace with hash 602764780, now seen corresponding path program 691 times [2020-02-10 19:53:28,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:28,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506710424] [2020-02-10 19:53:28,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:28,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:28,592 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 19:53:28,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 19:53:28,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506710424] [2020-02-10 19:53:28,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:28,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:53:28,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607453041] [2020-02-10 19:53:28,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:53:28,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:28,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:53:28,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:28,600 INFO L87 Difference]: Start difference. First operand 1567 states and 7006 transitions. Second operand 11 states. [2020-02-10 19:53:28,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:28,834 INFO L93 Difference]: Finished difference Result 2957 states and 11726 transitions. [2020-02-10 19:53:28,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:53:28,834 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:53:28,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:28,841 INFO L225 Difference]: With dead ends: 2957 [2020-02-10 19:53:28,842 INFO L226 Difference]: Without dead ends: 2939 [2020-02-10 19:53:28,842 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:53:28,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2939 states. [2020-02-10 19:53:28,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2939 to 1575. [2020-02-10 19:53:28,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 19:53:28,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7028 transitions. [2020-02-10 19:53:28,909 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7028 transitions. Word has length 28 [2020-02-10 19:53:28,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:28,909 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7028 transitions. [2020-02-10 19:53:28,909 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:53:28,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7028 transitions. [2020-02-10 19:53:28,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:53:28,911 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:28,911 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:28,912 INFO L427 AbstractCegarLoop]: === Iteration 700 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:28,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:28,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1458095022, now seen corresponding path program 692 times [2020-02-10 19:53:28,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:28,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880055994] [2020-02-10 19:53:28,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:28,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:29,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 19:53:29,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880055994] [2020-02-10 19:53:29,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:29,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:53:29,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362656069] [2020-02-10 19:53:29,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:53:29,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:29,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:53:29,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:29,429 INFO L87 Difference]: Start difference. First operand 1575 states and 7028 transitions. Second operand 11 states. [2020-02-10 19:53:29,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:29,601 INFO L93 Difference]: Finished difference Result 2953 states and 11714 transitions. [2020-02-10 19:53:29,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:53:29,601 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:53:29,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:29,608 INFO L225 Difference]: With dead ends: 2953 [2020-02-10 19:53:29,608 INFO L226 Difference]: Without dead ends: 2935 [2020-02-10 19:53:29,608 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:53:29,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2935 states. [2020-02-10 19:53:29,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2935 to 1571. [2020-02-10 19:53:29,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 19:53:29,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7017 transitions. [2020-02-10 19:53:29,676 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7017 transitions. Word has length 28 [2020-02-10 19:53:29,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:29,676 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7017 transitions. [2020-02-10 19:53:29,676 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:53:29,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7017 transitions. [2020-02-10 19:53:29,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:53:29,678 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:29,678 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:29,679 INFO L427 AbstractCegarLoop]: === Iteration 701 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:29,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:29,679 INFO L82 PathProgramCache]: Analyzing trace with hash -470320600, now seen corresponding path program 693 times [2020-02-10 19:53:29,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:29,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442955854] [2020-02-10 19:53:29,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:29,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:30,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:30,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442955854] [2020-02-10 19:53:30,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:30,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:53:30,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260625511] [2020-02-10 19:53:30,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:53:30,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:30,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:53:30,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:30,208 INFO L87 Difference]: Start difference. First operand 1571 states and 7017 transitions. Second operand 11 states. [2020-02-10 19:53:30,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:30,412 INFO L93 Difference]: Finished difference Result 2963 states and 11737 transitions. [2020-02-10 19:53:30,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:53:30,412 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:53:30,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:30,420 INFO L225 Difference]: With dead ends: 2963 [2020-02-10 19:53:30,420 INFO L226 Difference]: Without dead ends: 2945 [2020-02-10 19:53:30,420 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:53:30,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2945 states. [2020-02-10 19:53:30,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2945 to 1578. [2020-02-10 19:53:30,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 19:53:30,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7030 transitions. [2020-02-10 19:53:30,487 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7030 transitions. Word has length 28 [2020-02-10 19:53:30,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:30,488 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7030 transitions. [2020-02-10 19:53:30,488 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:53:30,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7030 transitions. [2020-02-10 19:53:30,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:53:30,490 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:30,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] [2020-02-10 19:53:30,490 INFO L427 AbstractCegarLoop]: === Iteration 702 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:30,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:30,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1041775406, now seen corresponding path program 694 times [2020-02-10 19:53:30,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:30,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19441913] [2020-02-10 19:53:30,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:30,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:31,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:31,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19441913] [2020-02-10 19:53:31,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:31,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:53:31,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452104624] [2020-02-10 19:53:31,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:53:31,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:31,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:53:31,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:31,029 INFO L87 Difference]: Start difference. First operand 1578 states and 7030 transitions. Second operand 11 states. [2020-02-10 19:53:31,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:31,204 INFO L93 Difference]: Finished difference Result 2962 states and 11728 transitions. [2020-02-10 19:53:31,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:53:31,205 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:53:31,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:31,212 INFO L225 Difference]: With dead ends: 2962 [2020-02-10 19:53:31,212 INFO L226 Difference]: Without dead ends: 2938 [2020-02-10 19:53:31,212 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:53:31,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2938 states. [2020-02-10 19:53:31,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2938 to 1571. [2020-02-10 19:53:31,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 19:53:31,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7013 transitions. [2020-02-10 19:53:31,280 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7013 transitions. Word has length 28 [2020-02-10 19:53:31,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:31,280 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7013 transitions. [2020-02-10 19:53:31,280 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:53:31,280 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7013 transitions. [2020-02-10 19:53:31,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:53:31,283 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:31,283 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:31,283 INFO L427 AbstractCegarLoop]: === Iteration 703 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:31,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:31,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1993324824, now seen corresponding path program 695 times [2020-02-10 19:53:31,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:31,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949991723] [2020-02-10 19:53:31,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:31,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:31,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:31,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949991723] [2020-02-10 19:53:31,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:31,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:53:31,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044485788] [2020-02-10 19:53:31,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:53:31,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:31,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:53:31,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:31,805 INFO L87 Difference]: Start difference. First operand 1571 states and 7013 transitions. Second operand 11 states. [2020-02-10 19:53:31,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:31,984 INFO L93 Difference]: Finished difference Result 2952 states and 11708 transitions. [2020-02-10 19:53:31,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:53:31,985 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:53:31,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:31,992 INFO L225 Difference]: With dead ends: 2952 [2020-02-10 19:53:31,992 INFO L226 Difference]: Without dead ends: 2938 [2020-02-10 19:53:31,993 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:53:32,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2938 states. [2020-02-10 19:53:32,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2938 to 1575. [2020-02-10 19:53:32,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 19:53:32,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7020 transitions. [2020-02-10 19:53:32,060 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7020 transitions. Word has length 28 [2020-02-10 19:53:32,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:32,060 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7020 transitions. [2020-02-10 19:53:32,060 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:53:32,060 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7020 transitions. [2020-02-10 19:53:32,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:53:32,062 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:32,062 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:32,062 INFO L427 AbstractCegarLoop]: === Iteration 704 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:32,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:32,063 INFO L82 PathProgramCache]: Analyzing trace with hash -503919828, now seen corresponding path program 696 times [2020-02-10 19:53:32,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:32,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871182074] [2020-02-10 19:53:32,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:32,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:32,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:32,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871182074] [2020-02-10 19:53:32,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:32,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:53:32,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781482769] [2020-02-10 19:53:32,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:53:32,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:32,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:53:32,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:32,589 INFO L87 Difference]: Start difference. First operand 1575 states and 7020 transitions. Second operand 11 states. [2020-02-10 19:53:32,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:32,791 INFO L93 Difference]: Finished difference Result 2955 states and 11710 transitions. [2020-02-10 19:53:32,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:53:32,792 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:53:32,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:32,799 INFO L225 Difference]: With dead ends: 2955 [2020-02-10 19:53:32,800 INFO L226 Difference]: Without dead ends: 2926 [2020-02-10 19:53:32,800 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:53:32,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2926 states. [2020-02-10 19:53:32,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2926 to 1563. [2020-02-10 19:53:32,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2020-02-10 19:53:32,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 6995 transitions. [2020-02-10 19:53:32,866 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 6995 transitions. Word has length 28 [2020-02-10 19:53:32,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:32,866 INFO L479 AbstractCegarLoop]: Abstraction has 1563 states and 6995 transitions. [2020-02-10 19:53:32,867 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:53:32,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 6995 transitions. [2020-02-10 19:53:32,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:53:32,869 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:32,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] [2020-02-10 19:53:32,869 INFO L427 AbstractCegarLoop]: === Iteration 705 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:32,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:32,869 INFO L82 PathProgramCache]: Analyzing trace with hash 647992356, now seen corresponding path program 697 times [2020-02-10 19:53:32,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:32,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106885907] [2020-02-10 19:53:32,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:32,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:33,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:33,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106885907] [2020-02-10 19:53:33,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:33,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:53:33,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33214760] [2020-02-10 19:53:33,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:53:33,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:33,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:53:33,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:33,433 INFO L87 Difference]: Start difference. First operand 1563 states and 6995 transitions. Second operand 11 states. [2020-02-10 19:53:33,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:33,581 INFO L93 Difference]: Finished difference Result 3001 states and 11831 transitions. [2020-02-10 19:53:33,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:53:33,582 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:53:33,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:33,589 INFO L225 Difference]: With dead ends: 3001 [2020-02-10 19:53:33,589 INFO L226 Difference]: Without dead ends: 2981 [2020-02-10 19:53:33,589 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:53:33,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2981 states. [2020-02-10 19:53:33,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2981 to 1586. [2020-02-10 19:53:33,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1586 states. [2020-02-10 19:53:33,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1586 states and 7060 transitions. [2020-02-10 19:53:33,657 INFO L78 Accepts]: Start accepts. Automaton has 1586 states and 7060 transitions. Word has length 28 [2020-02-10 19:53:33,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:33,657 INFO L479 AbstractCegarLoop]: Abstraction has 1586 states and 7060 transitions. [2020-02-10 19:53:33,657 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:53:33,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1586 states and 7060 transitions. [2020-02-10 19:53:33,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:53:33,660 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:33,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] [2020-02-10 19:53:33,660 INFO L427 AbstractCegarLoop]: === Iteration 706 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:33,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:33,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1392694854, now seen corresponding path program 698 times [2020-02-10 19:53:33,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:33,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089212085] [2020-02-10 19:53:33,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:33,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:34,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 19:53:34,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089212085] [2020-02-10 19:53:34,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:34,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:53:34,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901420442] [2020-02-10 19:53:34,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:53:34,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:34,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:53:34,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:34,218 INFO L87 Difference]: Start difference. First operand 1586 states and 7060 transitions. Second operand 11 states. [2020-02-10 19:53:34,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:34,386 INFO L93 Difference]: Finished difference Result 2999 states and 11819 transitions. [2020-02-10 19:53:34,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:53:34,387 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:53:34,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:34,394 INFO L225 Difference]: With dead ends: 2999 [2020-02-10 19:53:34,395 INFO L226 Difference]: Without dead ends: 2971 [2020-02-10 19:53:34,395 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:53:34,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2971 states. [2020-02-10 19:53:34,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2971 to 1576. [2020-02-10 19:53:34,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 19:53:34,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7037 transitions. [2020-02-10 19:53:34,462 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7037 transitions. Word has length 28 [2020-02-10 19:53:34,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:34,462 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7037 transitions. [2020-02-10 19:53:34,463 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:53:34,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7037 transitions. [2020-02-10 19:53:34,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:53:34,465 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:34,465 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:34,465 INFO L427 AbstractCegarLoop]: === Iteration 707 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:34,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:34,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1185847934, now seen corresponding path program 699 times [2020-02-10 19:53:34,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:34,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677965411] [2020-02-10 19:53:34,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:34,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:35,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:35,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677965411] [2020-02-10 19:53:35,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:35,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:53:35,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870203714] [2020-02-10 19:53:35,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:53:35,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:35,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:53:35,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:35,016 INFO L87 Difference]: Start difference. First operand 1576 states and 7037 transitions. Second operand 11 states. [2020-02-10 19:53:35,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:35,155 INFO L93 Difference]: Finished difference Result 2992 states and 11804 transitions. [2020-02-10 19:53:35,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:53:35,156 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:53:35,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:35,163 INFO L225 Difference]: With dead ends: 2992 [2020-02-10 19:53:35,163 INFO L226 Difference]: Without dead ends: 2972 [2020-02-10 19:53:35,163 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:53:35,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2972 states. [2020-02-10 19:53:35,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2972 to 1581. [2020-02-10 19:53:35,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 19:53:35,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7045 transitions. [2020-02-10 19:53:35,231 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7045 transitions. Word has length 28 [2020-02-10 19:53:35,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:35,231 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7045 transitions. [2020-02-10 19:53:35,231 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:53:35,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7045 transitions. [2020-02-10 19:53:35,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:53:35,233 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:35,233 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:35,233 INFO L427 AbstractCegarLoop]: === Iteration 708 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:35,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:35,234 INFO L82 PathProgramCache]: Analyzing trace with hash -130309370, now seen corresponding path program 700 times [2020-02-10 19:53:35,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:35,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436000531] [2020-02-10 19:53:35,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:35,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:35,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:35,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436000531] [2020-02-10 19:53:35,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:35,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:53:35,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815052774] [2020-02-10 19:53:35,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:53:35,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:35,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:53:35,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:35,760 INFO L87 Difference]: Start difference. First operand 1581 states and 7045 transitions. Second operand 11 states. [2020-02-10 19:53:35,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:35,982 INFO L93 Difference]: Finished difference Result 2986 states and 11788 transitions. [2020-02-10 19:53:35,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:53:35,982 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:53:35,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:35,989 INFO L225 Difference]: With dead ends: 2986 [2020-02-10 19:53:35,989 INFO L226 Difference]: Without dead ends: 2967 [2020-02-10 19:53:35,989 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:53:36,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2967 states. [2020-02-10 19:53:36,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2967 to 1576. [2020-02-10 19:53:36,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 19:53:36,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7032 transitions. [2020-02-10 19:53:36,056 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7032 transitions. Word has length 28 [2020-02-10 19:53:36,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:36,056 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7032 transitions. [2020-02-10 19:53:36,056 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:53:36,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7032 transitions. [2020-02-10 19:53:36,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:53:36,059 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:36,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] [2020-02-10 19:53:36,059 INFO L427 AbstractCegarLoop]: === Iteration 709 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:36,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:36,059 INFO L82 PathProgramCache]: Analyzing trace with hash -753475906, now seen corresponding path program 701 times [2020-02-10 19:53:36,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:36,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419147736] [2020-02-10 19:53:36,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:36,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:36,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 19:53:36,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419147736] [2020-02-10 19:53:36,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:36,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:53:36,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221288174] [2020-02-10 19:53:36,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:53:36,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:36,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:53:36,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:36,583 INFO L87 Difference]: Start difference. First operand 1576 states and 7032 transitions. Second operand 11 states. [2020-02-10 19:53:36,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:36,760 INFO L93 Difference]: Finished difference Result 2987 states and 11791 transitions. [2020-02-10 19:53:36,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:53:36,761 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:53:36,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:36,768 INFO L225 Difference]: With dead ends: 2987 [2020-02-10 19:53:36,768 INFO L226 Difference]: Without dead ends: 2969 [2020-02-10 19:53:36,768 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:53:36,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2969 states. [2020-02-10 19:53:36,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2969 to 1580. [2020-02-10 19:53:36,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 19:53:36,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7039 transitions. [2020-02-10 19:53:36,835 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7039 transitions. Word has length 28 [2020-02-10 19:53:36,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:36,835 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7039 transitions. [2020-02-10 19:53:36,835 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:53:36,835 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7039 transitions. [2020-02-10 19:53:36,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:53:36,838 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:36,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] [2020-02-10 19:53:36,838 INFO L427 AbstractCegarLoop]: === Iteration 710 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:36,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:36,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1480631588, now seen corresponding path program 702 times [2020-02-10 19:53:36,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:36,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783995650] [2020-02-10 19:53:36,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:36,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:37,367 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 19:53:37,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 19:53:37,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783995650] [2020-02-10 19:53:37,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:37,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:53:37,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792309595] [2020-02-10 19:53:37,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:53:37,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:37,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:53:37,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:37,375 INFO L87 Difference]: Start difference. First operand 1580 states and 7039 transitions. Second operand 11 states. [2020-02-10 19:53:37,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:37,551 INFO L93 Difference]: Finished difference Result 2983 states and 11779 transitions. [2020-02-10 19:53:37,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:53:37,552 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:53:37,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:37,559 INFO L225 Difference]: With dead ends: 2983 [2020-02-10 19:53:37,560 INFO L226 Difference]: Without dead ends: 2959 [2020-02-10 19:53:37,560 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:53:37,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2959 states. [2020-02-10 19:53:37,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2959 to 1570. [2020-02-10 19:53:37,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 19:53:37,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7017 transitions. [2020-02-10 19:53:37,627 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7017 transitions. Word has length 28 [2020-02-10 19:53:37,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:37,627 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7017 transitions. [2020-02-10 19:53:37,627 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:53:37,627 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7017 transitions. [2020-02-10 19:53:37,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:53:37,629 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:37,629 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:37,629 INFO L427 AbstractCegarLoop]: === Iteration 711 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:37,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:37,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1742083944, now seen corresponding path program 703 times [2020-02-10 19:53:37,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:37,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863475902] [2020-02-10 19:53:37,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:37,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:38,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 19:53:38,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863475902] [2020-02-10 19:53:38,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:38,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:53:38,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883106845] [2020-02-10 19:53:38,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:53:38,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:38,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:53:38,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:38,181 INFO L87 Difference]: Start difference. First operand 1570 states and 7017 transitions. Second operand 11 states. [2020-02-10 19:53:38,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:38,353 INFO L93 Difference]: Finished difference Result 3014 states and 11862 transitions. [2020-02-10 19:53:38,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:53:38,354 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:53:38,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:38,361 INFO L225 Difference]: With dead ends: 3014 [2020-02-10 19:53:38,361 INFO L226 Difference]: Without dead ends: 2994 [2020-02-10 19:53:38,362 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:53:38,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2994 states. [2020-02-10 19:53:38,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2994 to 1590. [2020-02-10 19:53:38,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1590 states. [2020-02-10 19:53:38,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1590 states to 1590 states and 7067 transitions. [2020-02-10 19:53:38,429 INFO L78 Accepts]: Start accepts. Automaton has 1590 states and 7067 transitions. Word has length 28 [2020-02-10 19:53:38,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:38,429 INFO L479 AbstractCegarLoop]: Abstraction has 1590 states and 7067 transitions. [2020-02-10 19:53:38,429 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:53:38,429 INFO L276 IsEmpty]: Start isEmpty. Operand 1590 states and 7067 transitions. [2020-02-10 19:53:38,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:53:38,431 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:38,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] [2020-02-10 19:53:38,432 INFO L427 AbstractCegarLoop]: === Iteration 712 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:38,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:38,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1808180854, now seen corresponding path program 704 times [2020-02-10 19:53:38,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:38,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610153824] [2020-02-10 19:53:38,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:38,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:38,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:38,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610153824] [2020-02-10 19:53:38,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:38,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:53:38,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590431349] [2020-02-10 19:53:38,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:53:38,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:38,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:53:38,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:38,983 INFO L87 Difference]: Start difference. First operand 1590 states and 7067 transitions. Second operand 11 states. [2020-02-10 19:53:39,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:39,202 INFO L93 Difference]: Finished difference Result 3012 states and 11850 transitions. [2020-02-10 19:53:39,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:53:39,203 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:53:39,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:39,210 INFO L225 Difference]: With dead ends: 3012 [2020-02-10 19:53:39,210 INFO L226 Difference]: Without dead ends: 2984 [2020-02-10 19:53:39,211 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:53:39,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2984 states. [2020-02-10 19:53:39,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2984 to 1580. [2020-02-10 19:53:39,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 19:53:39,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7041 transitions. [2020-02-10 19:53:39,278 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7041 transitions. Word has length 28 [2020-02-10 19:53:39,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:39,278 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7041 transitions. [2020-02-10 19:53:39,278 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:53:39,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7041 transitions. [2020-02-10 19:53:39,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:53:39,280 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:39,280 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:39,280 INFO L427 AbstractCegarLoop]: === Iteration 713 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:39,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:39,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1206854142, now seen corresponding path program 705 times [2020-02-10 19:53:39,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:39,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111730606] [2020-02-10 19:53:39,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:39,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:39,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 19:53:39,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111730606] [2020-02-10 19:53:39,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:39,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:53:39,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135121442] [2020-02-10 19:53:39,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:53:39,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:39,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:53:39,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:39,827 INFO L87 Difference]: Start difference. First operand 1580 states and 7041 transitions. Second operand 11 states. [2020-02-10 19:53:39,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:39,968 INFO L93 Difference]: Finished difference Result 3011 states and 11847 transitions. [2020-02-10 19:53:39,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:53:39,969 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:53:39,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:39,975 INFO L225 Difference]: With dead ends: 3011 [2020-02-10 19:53:39,976 INFO L226 Difference]: Without dead ends: 2991 [2020-02-10 19:53:39,976 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:53:40,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2991 states. [2020-02-10 19:53:40,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2991 to 1588. [2020-02-10 19:53:40,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1588 states. [2020-02-10 19:53:40,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 7055 transitions. [2020-02-10 19:53:40,045 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 7055 transitions. Word has length 28 [2020-02-10 19:53:40,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:40,045 INFO L479 AbstractCegarLoop]: Abstraction has 1588 states and 7055 transitions. [2020-02-10 19:53:40,045 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:53:40,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 7055 transitions. [2020-02-10 19:53:40,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:53:40,047 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:40,047 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:40,047 INFO L427 AbstractCegarLoop]: === Iteration 714 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:40,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:40,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1380101834, now seen corresponding path program 706 times [2020-02-10 19:53:40,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:40,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657765088] [2020-02-10 19:53:40,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:40,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:40,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 19:53:40,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657765088] [2020-02-10 19:53:40,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:40,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:53:40,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110846432] [2020-02-10 19:53:40,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:53:40,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:40,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:53:40,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:40,591 INFO L87 Difference]: Start difference. First operand 1588 states and 7055 transitions. Second operand 11 states. [2020-02-10 19:53:40,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:40,813 INFO L93 Difference]: Finished difference Result 3008 states and 11834 transitions. [2020-02-10 19:53:40,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:53:40,813 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:53:40,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:40,820 INFO L225 Difference]: With dead ends: 3008 [2020-02-10 19:53:40,820 INFO L226 Difference]: Without dead ends: 2983 [2020-02-10 19:53:40,820 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:53:40,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2983 states. [2020-02-10 19:53:40,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2983 to 1580. [2020-02-10 19:53:40,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 19:53:40,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7033 transitions. [2020-02-10 19:53:40,888 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7033 transitions. Word has length 28 [2020-02-10 19:53:40,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:40,888 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7033 transitions. [2020-02-10 19:53:40,888 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:53:40,888 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7033 transitions. [2020-02-10 19:53:40,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:53:40,890 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:40,890 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:40,891 INFO L427 AbstractCegarLoop]: === Iteration 715 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:40,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:40,891 INFO L82 PathProgramCache]: Analyzing trace with hash -732469698, now seen corresponding path program 707 times [2020-02-10 19:53:40,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:40,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947584683] [2020-02-10 19:53:40,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:40,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:41,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:41,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947584683] [2020-02-10 19:53:41,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:41,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:53:41,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449405222] [2020-02-10 19:53:41,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:53:41,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:41,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:53:41,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:41,429 INFO L87 Difference]: Start difference. First operand 1580 states and 7033 transitions. Second operand 11 states. [2020-02-10 19:53:41,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:41,623 INFO L93 Difference]: Finished difference Result 3006 states and 11831 transitions. [2020-02-10 19:53:41,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:53:41,624 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:53:41,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:41,631 INFO L225 Difference]: With dead ends: 3006 [2020-02-10 19:53:41,631 INFO L226 Difference]: Without dead ends: 2988 [2020-02-10 19:53:41,632 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:53:41,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2988 states. [2020-02-10 19:53:41,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2988 to 1587. [2020-02-10 19:53:41,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1587 states. [2020-02-10 19:53:41,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 7046 transitions. [2020-02-10 19:53:41,699 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 7046 transitions. Word has length 28 [2020-02-10 19:53:41,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:41,699 INFO L479 AbstractCegarLoop]: Abstraction has 1587 states and 7046 transitions. [2020-02-10 19:53:41,699 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:53:41,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 7046 transitions. [2020-02-10 19:53:41,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:53:41,702 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:41,702 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:41,702 INFO L427 AbstractCegarLoop]: === Iteration 716 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:41,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:41,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1303924504, now seen corresponding path program 708 times [2020-02-10 19:53:41,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:41,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756119835] [2020-02-10 19:53:41,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:41,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:42,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:42,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756119835] [2020-02-10 19:53:42,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:42,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:53:42,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964656313] [2020-02-10 19:53:42,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:53:42,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:42,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:53:42,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:42,237 INFO L87 Difference]: Start difference. First operand 1587 states and 7046 transitions. Second operand 11 states. [2020-02-10 19:53:42,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:42,419 INFO L93 Difference]: Finished difference Result 3005 states and 11822 transitions. [2020-02-10 19:53:42,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:53:42,420 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:53:42,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:42,427 INFO L225 Difference]: With dead ends: 3005 [2020-02-10 19:53:42,427 INFO L226 Difference]: Without dead ends: 2971 [2020-02-10 19:53:42,427 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:53:42,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2971 states. [2020-02-10 19:53:42,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2971 to 1570. [2020-02-10 19:53:42,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 19:53:42,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7010 transitions. [2020-02-10 19:53:42,494 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7010 transitions. Word has length 28 [2020-02-10 19:53:42,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:42,494 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7010 transitions. [2020-02-10 19:53:42,494 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:53:42,494 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7010 transitions. [2020-02-10 19:53:42,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:53:42,497 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:42,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] [2020-02-10 19:53:42,497 INFO L427 AbstractCegarLoop]: === Iteration 717 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:42,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:42,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1773593256, now seen corresponding path program 709 times [2020-02-10 19:53:42,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:42,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539281124] [2020-02-10 19:53:42,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:42,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:43,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:43,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539281124] [2020-02-10 19:53:43,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:43,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:53:43,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452215115] [2020-02-10 19:53:43,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:53:43,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:43,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:53:43,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:43,024 INFO L87 Difference]: Start difference. First operand 1570 states and 7010 transitions. Second operand 11 states. [2020-02-10 19:53:43,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:43,196 INFO L93 Difference]: Finished difference Result 2988 states and 11789 transitions. [2020-02-10 19:53:43,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:53:43,196 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:53:43,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:43,204 INFO L225 Difference]: With dead ends: 2988 [2020-02-10 19:53:43,204 INFO L226 Difference]: Without dead ends: 2968 [2020-02-10 19:53:43,204 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:53:43,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2968 states. [2020-02-10 19:53:43,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2968 to 1580. [2020-02-10 19:53:43,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 19:53:43,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7036 transitions. [2020-02-10 19:53:43,273 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7036 transitions. Word has length 28 [2020-02-10 19:53:43,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:43,274 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7036 transitions. [2020-02-10 19:53:43,274 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:53:43,274 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7036 transitions. [2020-02-10 19:53:43,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:53:43,276 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:43,276 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:43,276 INFO L427 AbstractCegarLoop]: === Iteration 718 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:43,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:43,276 INFO L82 PathProgramCache]: Analyzing trace with hash 457435952, now seen corresponding path program 710 times [2020-02-10 19:53:43,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:43,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143676488] [2020-02-10 19:53:43,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:43,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:43,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 19:53:43,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143676488] [2020-02-10 19:53:43,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:43,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:53:43,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282569239] [2020-02-10 19:53:43,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:53:43,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:43,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:53:43,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:43,801 INFO L87 Difference]: Start difference. First operand 1580 states and 7036 transitions. Second operand 11 states. [2020-02-10 19:53:43,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:43,996 INFO L93 Difference]: Finished difference Result 2982 states and 11773 transitions. [2020-02-10 19:53:43,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:53:43,997 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:53:43,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:44,005 INFO L225 Difference]: With dead ends: 2982 [2020-02-10 19:53:44,005 INFO L226 Difference]: Without dead ends: 2963 [2020-02-10 19:53:44,005 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:53:44,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2963 states. [2020-02-10 19:53:44,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2963 to 1575. [2020-02-10 19:53:44,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 19:53:44,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7023 transitions. [2020-02-10 19:53:44,075 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7023 transitions. Word has length 28 [2020-02-10 19:53:44,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:44,075 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7023 transitions. [2020-02-10 19:53:44,075 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:53:44,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7023 transitions. [2020-02-10 19:53:44,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:53:44,077 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:44,077 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:44,077 INFO L427 AbstractCegarLoop]: === Iteration 719 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:44,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:44,077 INFO L82 PathProgramCache]: Analyzing trace with hash 700507876, now seen corresponding path program 711 times [2020-02-10 19:53:44,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:44,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876965208] [2020-02-10 19:53:44,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:44,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:44,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:44,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876965208] [2020-02-10 19:53:44,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:44,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:53:44,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384337281] [2020-02-10 19:53:44,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:53:44,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:44,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:53:44,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:44,624 INFO L87 Difference]: Start difference. First operand 1575 states and 7023 transitions. Second operand 11 states. [2020-02-10 19:53:44,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:44,775 INFO L93 Difference]: Finished difference Result 2994 states and 11799 transitions. [2020-02-10 19:53:44,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:53:44,776 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:53:44,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:44,783 INFO L225 Difference]: With dead ends: 2994 [2020-02-10 19:53:44,784 INFO L226 Difference]: Without dead ends: 2974 [2020-02-10 19:53:44,784 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:53:44,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2974 states. [2020-02-10 19:53:44,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2974 to 1583. [2020-02-10 19:53:44,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 19:53:44,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7037 transitions. [2020-02-10 19:53:44,852 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7037 transitions. Word has length 28 [2020-02-10 19:53:44,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:44,852 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7037 transitions. [2020-02-10 19:53:44,852 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:53:44,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7037 transitions. [2020-02-10 19:53:44,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:53:44,854 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:44,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] [2020-02-10 19:53:44,855 INFO L427 AbstractCegarLoop]: === Iteration 720 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:44,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:44,855 INFO L82 PathProgramCache]: Analyzing trace with hash 873755568, now seen corresponding path program 712 times [2020-02-10 19:53:44,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:44,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619112466] [2020-02-10 19:53:44,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:44,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:45,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 19:53:45,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619112466] [2020-02-10 19:53:45,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:45,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:53:45,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738894405] [2020-02-10 19:53:45,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:53:45,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:45,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:53:45,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:45,382 INFO L87 Difference]: Start difference. First operand 1583 states and 7037 transitions. Second operand 11 states. [2020-02-10 19:53:45,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:45,610 INFO L93 Difference]: Finished difference Result 2991 states and 11786 transitions. [2020-02-10 19:53:45,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:53:45,611 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:53:45,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:45,618 INFO L225 Difference]: With dead ends: 2991 [2020-02-10 19:53:45,618 INFO L226 Difference]: Without dead ends: 2966 [2020-02-10 19:53:45,619 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:53:45,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2966 states. [2020-02-10 19:53:45,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2966 to 1575. [2020-02-10 19:53:45,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 19:53:45,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7018 transitions. [2020-02-10 19:53:45,695 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7018 transitions. Word has length 28 [2020-02-10 19:53:45,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:45,695 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7018 transitions. [2020-02-10 19:53:45,695 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:53:45,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7018 transitions. [2020-02-10 19:53:45,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:53:45,697 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:45,697 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:45,697 INFO L427 AbstractCegarLoop]: === Iteration 721 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:45,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:45,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1533147108, now seen corresponding path program 713 times [2020-02-10 19:53:45,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:45,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031466640] [2020-02-10 19:53:45,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:45,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:46,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:46,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031466640] [2020-02-10 19:53:46,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:46,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:53:46,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126096379] [2020-02-10 19:53:46,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:53:46,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:46,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:53:46,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:46,242 INFO L87 Difference]: Start difference. First operand 1575 states and 7018 transitions. Second operand 11 states. [2020-02-10 19:53:46,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:46,473 INFO L93 Difference]: Finished difference Result 2978 states and 11761 transitions. [2020-02-10 19:53:46,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:53:46,473 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:53:46,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:46,480 INFO L225 Difference]: With dead ends: 2978 [2020-02-10 19:53:46,480 INFO L226 Difference]: Without dead ends: 2964 [2020-02-10 19:53:46,480 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:53:46,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2964 states. [2020-02-10 19:53:46,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2964 to 1579. [2020-02-10 19:53:46,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 19:53:46,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7025 transitions. [2020-02-10 19:53:46,550 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7025 transitions. Word has length 28 [2020-02-10 19:53:46,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:46,550 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7025 transitions. [2020-02-10 19:53:46,550 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:53:46,550 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7025 transitions. [2020-02-10 19:53:46,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:53:46,552 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:46,552 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:46,552 INFO L427 AbstractCegarLoop]: === Iteration 722 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:46,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:46,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1272415192, now seen corresponding path program 714 times [2020-02-10 19:53:46,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:46,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668139544] [2020-02-10 19:53:46,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:46,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:47,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 19:53:47,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668139544] [2020-02-10 19:53:47,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:47,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:53:47,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208227223] [2020-02-10 19:53:47,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:53:47,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:47,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:53:47,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:47,099 INFO L87 Difference]: Start difference. First operand 1579 states and 7025 transitions. Second operand 11 states. [2020-02-10 19:53:47,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:47,300 INFO L93 Difference]: Finished difference Result 2981 states and 11763 transitions. [2020-02-10 19:53:47,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:53:47,301 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:53:47,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:47,308 INFO L225 Difference]: With dead ends: 2981 [2020-02-10 19:53:47,308 INFO L226 Difference]: Without dead ends: 2955 [2020-02-10 19:53:47,308 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:53:47,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2955 states. [2020-02-10 19:53:47,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2955 to 1570. [2020-02-10 19:53:47,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 19:53:47,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7005 transitions. [2020-02-10 19:53:47,378 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7005 transitions. Word has length 28 [2020-02-10 19:53:47,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:47,378 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7005 transitions. [2020-02-10 19:53:47,378 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:53:47,378 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7005 transitions. [2020-02-10 19:53:47,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:53:47,380 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:47,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] [2020-02-10 19:53:47,380 INFO L427 AbstractCegarLoop]: === Iteration 723 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:47,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:47,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1766168438, now seen corresponding path program 715 times [2020-02-10 19:53:47,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:47,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828391319] [2020-02-10 19:53:47,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:47,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:47,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 19:53:47,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828391319] [2020-02-10 19:53:47,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:47,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:53:47,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052177264] [2020-02-10 19:53:47,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:53:47,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:47,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:53:47,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:47,919 INFO L87 Difference]: Start difference. First operand 1570 states and 7005 transitions. Second operand 11 states. [2020-02-10 19:53:48,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:48,103 INFO L93 Difference]: Finished difference Result 2978 states and 11766 transitions. [2020-02-10 19:53:48,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:53:48,103 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:53:48,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:48,111 INFO L225 Difference]: With dead ends: 2978 [2020-02-10 19:53:48,111 INFO L226 Difference]: Without dead ends: 2960 [2020-02-10 19:53:48,111 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:53:48,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2960 states. [2020-02-10 19:53:48,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2960 to 1578. [2020-02-10 19:53:48,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 19:53:48,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7027 transitions. [2020-02-10 19:53:48,181 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7027 transitions. Word has length 28 [2020-02-10 19:53:48,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:48,181 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7027 transitions. [2020-02-10 19:53:48,181 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:53:48,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7027 transitions. [2020-02-10 19:53:48,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:53:48,183 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:48,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] [2020-02-10 19:53:48,183 INFO L427 AbstractCegarLoop]: === Iteration 724 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:48,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:48,184 INFO L82 PathProgramCache]: Analyzing trace with hash 467939056, now seen corresponding path program 716 times [2020-02-10 19:53:48,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:48,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121079122] [2020-02-10 19:53:48,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:48,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:48,705 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2020-02-10 19:53:48,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 19:53:48,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121079122] [2020-02-10 19:53:48,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:48,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:53:48,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742484416] [2020-02-10 19:53:48,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:53:48,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:48,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:53:48,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:48,713 INFO L87 Difference]: Start difference. First operand 1578 states and 7027 transitions. Second operand 11 states. [2020-02-10 19:53:48,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:48,929 INFO L93 Difference]: Finished difference Result 2974 states and 11754 transitions. [2020-02-10 19:53:48,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:53:48,930 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:53:48,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:48,937 INFO L225 Difference]: With dead ends: 2974 [2020-02-10 19:53:48,937 INFO L226 Difference]: Without dead ends: 2956 [2020-02-10 19:53:48,937 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:53:48,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2020-02-10 19:53:49,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 1574. [2020-02-10 19:53:49,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 19:53:49,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7016 transitions. [2020-02-10 19:53:49,005 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7016 transitions. Word has length 28 [2020-02-10 19:53:49,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:49,005 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7016 transitions. [2020-02-10 19:53:49,005 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:53:49,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7016 transitions. [2020-02-10 19:53:49,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:53:49,007 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:49,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] [2020-02-10 19:53:49,007 INFO L427 AbstractCegarLoop]: === Iteration 725 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:49,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:49,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1455713478, now seen corresponding path program 717 times [2020-02-10 19:53:49,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:49,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851045372] [2020-02-10 19:53:49,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:49,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:49,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:49,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851045372] [2020-02-10 19:53:49,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:49,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:53:49,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987176926] [2020-02-10 19:53:49,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:53:49,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:49,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:53:49,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:49,555 INFO L87 Difference]: Start difference. First operand 1574 states and 7016 transitions. Second operand 11 states. [2020-02-10 19:53:49,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:49,769 INFO L93 Difference]: Finished difference Result 2984 states and 11777 transitions. [2020-02-10 19:53:49,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:53:49,769 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:53:49,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:49,776 INFO L225 Difference]: With dead ends: 2984 [2020-02-10 19:53:49,777 INFO L226 Difference]: Without dead ends: 2966 [2020-02-10 19:53:49,777 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:53:49,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2966 states. [2020-02-10 19:53:49,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2966 to 1581. [2020-02-10 19:53:49,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 19:53:49,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7029 transitions. [2020-02-10 19:53:49,846 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7029 transitions. Word has length 28 [2020-02-10 19:53:49,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:49,846 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7029 transitions. [2020-02-10 19:53:49,846 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:53:49,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7029 transitions. [2020-02-10 19:53:49,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:53:49,848 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53: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] [2020-02-10 19:53:49,849 INFO L427 AbstractCegarLoop]: === Iteration 726 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:49,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:49,849 INFO L82 PathProgramCache]: Analyzing trace with hash 884258672, now seen corresponding path program 718 times [2020-02-10 19:53:49,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:49,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9517761] [2020-02-10 19:53:49,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:49,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:50,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:50,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9517761] [2020-02-10 19:53:50,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:50,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:53:50,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734119349] [2020-02-10 19:53:50,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:53:50,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:50,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:53:50,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:50,396 INFO L87 Difference]: Start difference. First operand 1581 states and 7029 transitions. Second operand 11 states. [2020-02-10 19:53:50,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:50,632 INFO L93 Difference]: Finished difference Result 2983 states and 11768 transitions. [2020-02-10 19:53:50,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:53:50,632 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:53:50,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:50,639 INFO L225 Difference]: With dead ends: 2983 [2020-02-10 19:53:50,640 INFO L226 Difference]: Without dead ends: 2959 [2020-02-10 19:53:50,640 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:53:50,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2959 states. [2020-02-10 19:53:50,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2959 to 1574. [2020-02-10 19:53:50,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 19:53:50,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7012 transitions. [2020-02-10 19:53:50,707 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7012 transitions. Word has length 28 [2020-02-10 19:53:50,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:50,707 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7012 transitions. [2020-02-10 19:53:50,707 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:53:50,707 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7012 transitions. [2020-02-10 19:53:50,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:53:50,709 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:50,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] [2020-02-10 19:53:50,710 INFO L427 AbstractCegarLoop]: === Iteration 727 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:50,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:50,710 INFO L82 PathProgramCache]: Analyzing trace with hash -67290746, now seen corresponding path program 719 times [2020-02-10 19:53:50,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:50,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578100889] [2020-02-10 19:53:50,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:50,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:51,230 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 19:53:51,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:51,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578100889] [2020-02-10 19:53:51,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:51,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:53:51,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420349853] [2020-02-10 19:53:51,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:53:51,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:51,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:53:51,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:51,239 INFO L87 Difference]: Start difference. First operand 1574 states and 7012 transitions. Second operand 11 states. [2020-02-10 19:53:51,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:51,462 INFO L93 Difference]: Finished difference Result 2973 states and 11748 transitions. [2020-02-10 19:53:51,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:53:51,462 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:53:51,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:51,469 INFO L225 Difference]: With dead ends: 2973 [2020-02-10 19:53:51,470 INFO L226 Difference]: Without dead ends: 2959 [2020-02-10 19:53:51,470 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:53:51,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2959 states. [2020-02-10 19:53:51,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2959 to 1578. [2020-02-10 19:53:51,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 19:53:51,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7019 transitions. [2020-02-10 19:53:51,539 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7019 transitions. Word has length 28 [2020-02-10 19:53:51,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:51,539 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7019 transitions. [2020-02-10 19:53:51,539 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:53:51,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7019 transitions. [2020-02-10 19:53:51,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:53:51,541 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:51,542 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:51,542 INFO L427 AbstractCegarLoop]: === Iteration 728 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:51,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:51,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1422114250, now seen corresponding path program 720 times [2020-02-10 19:53:51,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:51,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949880753] [2020-02-10 19:53:51,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:51,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:52,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:52,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949880753] [2020-02-10 19:53:52,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:52,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:53:52,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114364607] [2020-02-10 19:53:52,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:53:52,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:52,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:53:52,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:52,075 INFO L87 Difference]: Start difference. First operand 1578 states and 7019 transitions. Second operand 11 states. [2020-02-10 19:53:52,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:52,319 INFO L93 Difference]: Finished difference Result 2976 states and 11750 transitions. [2020-02-10 19:53:52,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:53:52,320 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:53:52,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:52,327 INFO L225 Difference]: With dead ends: 2976 [2020-02-10 19:53:52,327 INFO L226 Difference]: Without dead ends: 2926 [2020-02-10 19:53:52,328 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:53:52,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2926 states. [2020-02-10 19:53:52,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2926 to 1545. [2020-02-10 19:53:52,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1545 states. [2020-02-10 19:53:52,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 6955 transitions. [2020-02-10 19:53:52,397 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 6955 transitions. Word has length 28 [2020-02-10 19:53:52,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:52,397 INFO L479 AbstractCegarLoop]: Abstraction has 1545 states and 6955 transitions. [2020-02-10 19:53:52,397 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:53:52,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 6955 transitions. [2020-02-10 19:53:52,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:53:52,399 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:52,400 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:52,400 INFO L427 AbstractCegarLoop]: === Iteration 729 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:52,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:52,400 INFO L82 PathProgramCache]: Analyzing trace with hash -645301276, now seen corresponding path program 721 times [2020-02-10 19:53:52,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:52,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831946962] [2020-02-10 19:53:52,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:52,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:52,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 19:53:52,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831946962] [2020-02-10 19:53:52,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:52,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:53:52,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007231529] [2020-02-10 19:53:52,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:53:52,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:52,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:53:52,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:52,937 INFO L87 Difference]: Start difference. First operand 1545 states and 6955 transitions. Second operand 11 states. [2020-02-10 19:53:53,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:53,223 INFO L93 Difference]: Finished difference Result 2968 states and 11774 transitions. [2020-02-10 19:53:53,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:53:53,224 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:53:53,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:53,229 INFO L225 Difference]: With dead ends: 2968 [2020-02-10 19:53:53,229 INFO L226 Difference]: Without dead ends: 2953 [2020-02-10 19:53:53,229 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:53:53,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2953 states. [2020-02-10 19:53:53,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2953 to 1581. [2020-02-10 19:53:53,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 19:53:53,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7101 transitions. [2020-02-10 19:53:53,296 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7101 transitions. Word has length 28 [2020-02-10 19:53:53,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:53,296 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7101 transitions. [2020-02-10 19:53:53,296 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:53:53,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7101 transitions. [2020-02-10 19:53:53,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:53:53,298 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:53,299 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:53,299 INFO L427 AbstractCegarLoop]: === Iteration 730 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:53,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:53,299 INFO L82 PathProgramCache]: Analyzing trace with hash 99401222, now seen corresponding path program 722 times [2020-02-10 19:53:53,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:53,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606952287] [2020-02-10 19:53:53,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:53,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:53,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:53,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606952287] [2020-02-10 19:53:53,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:53,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:53:53,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053403592] [2020-02-10 19:53:53,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:53:53,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:53,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:53:53,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:53,834 INFO L87 Difference]: Start difference. First operand 1581 states and 7101 transitions. Second operand 11 states. [2020-02-10 19:53:54,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:54,098 INFO L93 Difference]: Finished difference Result 2969 states and 11771 transitions. [2020-02-10 19:53:54,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:53:54,099 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:53:54,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:54,106 INFO L225 Difference]: With dead ends: 2969 [2020-02-10 19:53:54,106 INFO L226 Difference]: Without dead ends: 2948 [2020-02-10 19:53:54,106 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:53:54,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2948 states. [2020-02-10 19:53:54,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2948 to 1576. [2020-02-10 19:53:54,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 19:53:54,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7087 transitions. [2020-02-10 19:53:54,175 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7087 transitions. Word has length 28 [2020-02-10 19:53:54,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:54,176 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7087 transitions. [2020-02-10 19:53:54,176 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:53:54,176 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7087 transitions. [2020-02-10 19:53:54,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:53:54,178 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:54,178 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:54,178 INFO L427 AbstractCegarLoop]: === Iteration 731 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:54,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:54,178 INFO L82 PathProgramCache]: Analyzing trace with hash 965639682, now seen corresponding path program 723 times [2020-02-10 19:53:54,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:54,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238760512] [2020-02-10 19:53:54,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:54,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:54,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 19:53:54,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238760512] [2020-02-10 19:53:54,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:54,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:53:54,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723926828] [2020-02-10 19:53:54,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:53:54,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:54,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:53:54,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:54,707 INFO L87 Difference]: Start difference. First operand 1576 states and 7087 transitions. Second operand 11 states. [2020-02-10 19:53:54,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:54,972 INFO L93 Difference]: Finished difference Result 2973 states and 11778 transitions. [2020-02-10 19:53:54,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:53:54,973 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:53:54,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:54,980 INFO L225 Difference]: With dead ends: 2973 [2020-02-10 19:53:54,980 INFO L226 Difference]: Without dead ends: 2958 [2020-02-10 19:53:54,980 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:53:55,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2958 states. [2020-02-10 19:53:55,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2958 to 1582. [2020-02-10 19:53:55,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2020-02-10 19:53:55,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 7098 transitions. [2020-02-10 19:53:55,049 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 7098 transitions. Word has length 28 [2020-02-10 19:53:55,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:55,049 INFO L479 AbstractCegarLoop]: Abstraction has 1582 states and 7098 transitions. [2020-02-10 19:53:55,049 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:53:55,049 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 7098 transitions. [2020-02-10 19:53:55,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:53:55,051 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:55,051 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:55,051 INFO L427 AbstractCegarLoop]: === Iteration 732 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:55,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:55,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1839922618, now seen corresponding path program 724 times [2020-02-10 19:53:55,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:55,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409373219] [2020-02-10 19:53:55,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:55,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:55,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:55,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409373219] [2020-02-10 19:53:55,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:55,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:53:55,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026797908] [2020-02-10 19:53:55,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:53:55,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:55,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:53:55,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:55,595 INFO L87 Difference]: Start difference. First operand 1582 states and 7098 transitions. Second operand 11 states. [2020-02-10 19:53:55,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:55,766 INFO L93 Difference]: Finished difference Result 2978 states and 11782 transitions. [2020-02-10 19:53:55,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:53:55,766 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:53:55,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:55,773 INFO L225 Difference]: With dead ends: 2978 [2020-02-10 19:53:55,773 INFO L226 Difference]: Without dead ends: 2952 [2020-02-10 19:53:55,773 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:53:55,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2952 states. [2020-02-10 19:53:55,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2952 to 1576. [2020-02-10 19:53:55,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 19:53:55,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7081 transitions. [2020-02-10 19:53:55,842 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7081 transitions. Word has length 28 [2020-02-10 19:53:55,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:55,843 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7081 transitions. [2020-02-10 19:53:55,843 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:53:55,843 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7081 transitions. [2020-02-10 19:53:55,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:53:55,845 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:55,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] [2020-02-10 19:53:55,845 INFO L427 AbstractCegarLoop]: === Iteration 733 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:55,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:55,845 INFO L82 PathProgramCache]: Analyzing trace with hash -973684158, now seen corresponding path program 725 times [2020-02-10 19:53:55,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:55,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665028544] [2020-02-10 19:53:55,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:55,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:56,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:56,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665028544] [2020-02-10 19:53:56,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:56,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:53:56,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447931491] [2020-02-10 19:53:56,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:53:56,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:56,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:53:56,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:56,393 INFO L87 Difference]: Start difference. First operand 1576 states and 7081 transitions. Second operand 11 states. [2020-02-10 19:53:56,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:56,586 INFO L93 Difference]: Finished difference Result 2976 states and 11779 transitions. [2020-02-10 19:53:56,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:53:56,586 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:53:56,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:56,593 INFO L225 Difference]: With dead ends: 2976 [2020-02-10 19:53:56,594 INFO L226 Difference]: Without dead ends: 2960 [2020-02-10 19:53:56,594 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:53:56,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2960 states. [2020-02-10 19:53:56,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2960 to 1583. [2020-02-10 19:53:56,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 19:53:56,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7094 transitions. [2020-02-10 19:53:56,662 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7094 transitions. Word has length 28 [2020-02-10 19:53:56,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:56,662 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7094 transitions. [2020-02-10 19:53:56,662 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:53:56,662 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7094 transitions. [2020-02-10 19:53:56,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:53:56,665 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:56,665 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:56,665 INFO L427 AbstractCegarLoop]: === Iteration 734 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:56,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:56,665 INFO L82 PathProgramCache]: Analyzing trace with hash -228981660, now seen corresponding path program 726 times [2020-02-10 19:53:56,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:56,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709490288] [2020-02-10 19:53:56,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:56,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:57,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:57,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709490288] [2020-02-10 19:53:57,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:57,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:53:57,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745223890] [2020-02-10 19:53:57,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:53:57,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:57,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:53:57,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:57,245 INFO L87 Difference]: Start difference. First operand 1583 states and 7094 transitions. Second operand 11 states. [2020-02-10 19:53:57,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:57,476 INFO L93 Difference]: Finished difference Result 2980 states and 11780 transitions. [2020-02-10 19:53:57,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:53:57,477 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:53:57,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:57,484 INFO L225 Difference]: With dead ends: 2980 [2020-02-10 19:53:57,484 INFO L226 Difference]: Without dead ends: 2947 [2020-02-10 19:53:57,484 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:53:57,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2947 states. [2020-02-10 19:53:57,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2947 to 1570. [2020-02-10 19:53:57,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 19:53:57,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7064 transitions. [2020-02-10 19:53:57,553 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7064 transitions. Word has length 28 [2020-02-10 19:53:57,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:57,553 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7064 transitions. [2020-02-10 19:53:57,553 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:53:57,553 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7064 transitions. [2020-02-10 19:53:57,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:53:57,555 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:57,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] [2020-02-10 19:53:57,556 INFO L427 AbstractCegarLoop]: === Iteration 735 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:57,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:57,556 INFO L82 PathProgramCache]: Analyzing trace with hash 74711198, now seen corresponding path program 727 times [2020-02-10 19:53:57,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:57,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420833272] [2020-02-10 19:53:57,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:57,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:58,081 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 30 [2020-02-10 19:53:58,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:58,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420833272] [2020-02-10 19:53:58,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:58,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:53:58,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919904741] [2020-02-10 19:53:58,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:53:58,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:58,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:53:58,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:58,089 INFO L87 Difference]: Start difference. First operand 1570 states and 7064 transitions. Second operand 11 states. [2020-02-10 19:53:58,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:58,282 INFO L93 Difference]: Finished difference Result 2963 states and 11758 transitions. [2020-02-10 19:53:58,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:53:58,282 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:53:58,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:58,290 INFO L225 Difference]: With dead ends: 2963 [2020-02-10 19:53:58,290 INFO L226 Difference]: Without dead ends: 2948 [2020-02-10 19:53:58,290 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:53:58,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2948 states. [2020-02-10 19:53:58,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2948 to 1580. [2020-02-10 19:53:58,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 19:53:58,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7092 transitions. [2020-02-10 19:53:58,358 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7092 transitions. Word has length 28 [2020-02-10 19:53:58,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:58,358 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7092 transitions. [2020-02-10 19:53:58,358 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:53:58,358 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7092 transitions. [2020-02-10 19:53:58,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:53:58,360 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:58,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] [2020-02-10 19:53:58,360 INFO L427 AbstractCegarLoop]: === Iteration 736 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:58,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:58,360 INFO L82 PathProgramCache]: Analyzing trace with hash 819413696, now seen corresponding path program 728 times [2020-02-10 19:53:58,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:58,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4406612] [2020-02-10 19:53:58,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:58,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:58,891 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 19:53:58,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:58,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4406612] [2020-02-10 19:53:58,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:58,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:53:58,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868022434] [2020-02-10 19:53:58,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:53:58,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:58,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:53:58,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:58,898 INFO L87 Difference]: Start difference. First operand 1580 states and 7092 transitions. Second operand 11 states. [2020-02-10 19:53:59,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:53:59,166 INFO L93 Difference]: Finished difference Result 2964 states and 11755 transitions. [2020-02-10 19:53:59,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:53:59,166 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:53:59,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:53:59,172 INFO L225 Difference]: With dead ends: 2964 [2020-02-10 19:53:59,172 INFO L226 Difference]: Without dead ends: 2943 [2020-02-10 19:53:59,173 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:53:59,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2943 states. [2020-02-10 19:53:59,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2943 to 1575. [2020-02-10 19:53:59,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 19:53:59,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7078 transitions. [2020-02-10 19:53:59,241 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7078 transitions. Word has length 28 [2020-02-10 19:53:59,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:53:59,241 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7078 transitions. [2020-02-10 19:53:59,241 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:53:59,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7078 transitions. [2020-02-10 19:53:59,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:53:59,243 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:53:59,243 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:53:59,244 INFO L427 AbstractCegarLoop]: === Iteration 737 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:53:59,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:53:59,244 INFO L82 PathProgramCache]: Analyzing trace with hash -998374182, now seen corresponding path program 729 times [2020-02-10 19:53:59,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:53:59,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678578220] [2020-02-10 19:53:59,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:53:59,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:53:59,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:53:59,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678578220] [2020-02-10 19:53:59,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:53:59,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:53:59,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947387712] [2020-02-10 19:53:59,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:53:59,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:53:59,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:53:59,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:53:59,795 INFO L87 Difference]: Start difference. First operand 1575 states and 7078 transitions. Second operand 11 states. [2020-02-10 19:54:00,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:00,060 INFO L93 Difference]: Finished difference Result 2965 states and 11757 transitions. [2020-02-10 19:54:00,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:54:00,060 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:54:00,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:00,067 INFO L225 Difference]: With dead ends: 2965 [2020-02-10 19:54:00,067 INFO L226 Difference]: Without dead ends: 2950 [2020-02-10 19:54:00,067 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:54:00,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2020-02-10 19:54:00,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 1580. [2020-02-10 19:54:00,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 19:54:00,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7087 transitions. [2020-02-10 19:54:00,137 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7087 transitions. Word has length 28 [2020-02-10 19:54:00,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:00,137 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7087 transitions. [2020-02-10 19:54:00,137 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:54:00,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7087 transitions. [2020-02-10 19:54:00,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:54:00,139 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:00,139 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:00,140 INFO L427 AbstractCegarLoop]: === Iteration 738 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:00,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:00,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1235733312, now seen corresponding path program 730 times [2020-02-10 19:54:00,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:00,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085688577] [2020-02-10 19:54:00,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:00,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:00,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 19:54:00,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085688577] [2020-02-10 19:54:00,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:00,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:54:00,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942998387] [2020-02-10 19:54:00,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:54:00,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:00,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:54:00,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:00,660 INFO L87 Difference]: Start difference. First operand 1580 states and 7087 transitions. Second operand 11 states. [2020-02-10 19:54:00,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:00,868 INFO L93 Difference]: Finished difference Result 2968 states and 11758 transitions. [2020-02-10 19:54:00,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:54:00,869 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:54:00,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:00,875 INFO L225 Difference]: With dead ends: 2968 [2020-02-10 19:54:00,875 INFO L226 Difference]: Without dead ends: 2945 [2020-02-10 19:54:00,876 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:54:00,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2945 states. [2020-02-10 19:54:00,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2945 to 1575. [2020-02-10 19:54:00,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 19:54:00,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7073 transitions. [2020-02-10 19:54:00,943 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7073 transitions. Word has length 28 [2020-02-10 19:54:00,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:00,943 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7073 transitions. [2020-02-10 19:54:00,943 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:54:00,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7073 transitions. [2020-02-10 19:54:00,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:54:00,945 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:00,945 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:00,945 INFO L427 AbstractCegarLoop]: === Iteration 739 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:00,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:00,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1357269274, now seen corresponding path program 731 times [2020-02-10 19:54:00,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:00,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841608742] [2020-02-10 19:54:00,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:00,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:01,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:01,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841608742] [2020-02-10 19:54:01,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:01,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:54:01,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920467678] [2020-02-10 19:54:01,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:54:01,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:01,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:54:01,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:01,469 INFO L87 Difference]: Start difference. First operand 1575 states and 7073 transitions. Second operand 11 states. [2020-02-10 19:54:01,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:01,731 INFO L93 Difference]: Finished difference Result 2968 states and 11759 transitions. [2020-02-10 19:54:01,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:54:01,732 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:54:01,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:01,740 INFO L225 Difference]: With dead ends: 2968 [2020-02-10 19:54:01,740 INFO L226 Difference]: Without dead ends: 2952 [2020-02-10 19:54:01,740 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:54:01,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2952 states. [2020-02-10 19:54:01,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2952 to 1581. [2020-02-10 19:54:01,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 19:54:01,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7084 transitions. [2020-02-10 19:54:01,811 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7084 transitions. Word has length 28 [2020-02-10 19:54:01,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:01,812 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7084 transitions. [2020-02-10 19:54:01,812 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:54:01,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7084 transitions. [2020-02-10 19:54:01,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:54:01,814 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:01,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] [2020-02-10 19:54:01,815 INFO L427 AbstractCegarLoop]: === Iteration 740 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:01,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:01,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1448293026, now seen corresponding path program 732 times [2020-02-10 19:54:01,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:01,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348898409] [2020-02-10 19:54:01,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:01,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:02,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:02,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348898409] [2020-02-10 19:54:02,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:02,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:54:02,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644915441] [2020-02-10 19:54:02,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:54:02,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:02,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:54:02,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:02,343 INFO L87 Difference]: Start difference. First operand 1581 states and 7084 transitions. Second operand 11 states. [2020-02-10 19:54:02,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:02,514 INFO L93 Difference]: Finished difference Result 2970 states and 11757 transitions. [2020-02-10 19:54:02,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:54:02,515 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:54:02,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:02,522 INFO L225 Difference]: With dead ends: 2970 [2020-02-10 19:54:02,522 INFO L226 Difference]: Without dead ends: 2941 [2020-02-10 19:54:02,522 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:54:02,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2941 states. [2020-02-10 19:54:02,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2941 to 1570. [2020-02-10 19:54:02,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 19:54:02,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7059 transitions. [2020-02-10 19:54:02,590 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7059 transitions. Word has length 28 [2020-02-10 19:54:02,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:02,590 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7059 transitions. [2020-02-10 19:54:02,590 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:54:02,590 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7059 transitions. [2020-02-10 19:54:02,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:54:02,592 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:02,592 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:02,592 INFO L427 AbstractCegarLoop]: === Iteration 741 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:02,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:02,592 INFO L82 PathProgramCache]: Analyzing trace with hash 85214302, now seen corresponding path program 733 times [2020-02-10 19:54:02,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:02,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463858370] [2020-02-10 19:54:02,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:02,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:03,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:03,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463858370] [2020-02-10 19:54:03,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:03,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:54:03,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531617518] [2020-02-10 19:54:03,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:54:03,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:03,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:54:03,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:03,121 INFO L87 Difference]: Start difference. First operand 1570 states and 7059 transitions. Second operand 11 states. [2020-02-10 19:54:03,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:03,308 INFO L93 Difference]: Finished difference Result 2979 states and 11785 transitions. [2020-02-10 19:54:03,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:54:03,308 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:54:03,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:03,315 INFO L225 Difference]: With dead ends: 2979 [2020-02-10 19:54:03,315 INFO L226 Difference]: Without dead ends: 2964 [2020-02-10 19:54:03,315 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:54:03,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2964 states. [2020-02-10 19:54:03,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2964 to 1583. [2020-02-10 19:54:03,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 19:54:03,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7094 transitions. [2020-02-10 19:54:03,383 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7094 transitions. Word has length 28 [2020-02-10 19:54:03,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:03,383 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7094 transitions. [2020-02-10 19:54:03,383 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:54:03,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7094 transitions. [2020-02-10 19:54:03,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:54:03,385 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:03,385 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:03,385 INFO L427 AbstractCegarLoop]: === Iteration 742 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:03,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:03,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1574619298, now seen corresponding path program 734 times [2020-02-10 19:54:03,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:03,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97434311] [2020-02-10 19:54:03,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:03,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:03,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:03,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97434311] [2020-02-10 19:54:03,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:03,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:54:03,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642756629] [2020-02-10 19:54:03,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:54:03,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:03,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:54:03,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:03,915 INFO L87 Difference]: Start difference. First operand 1583 states and 7094 transitions. Second operand 11 states. [2020-02-10 19:54:04,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:04,054 INFO L93 Difference]: Finished difference Result 2984 states and 11789 transitions. [2020-02-10 19:54:04,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:54:04,055 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:54:04,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:04,062 INFO L225 Difference]: With dead ends: 2984 [2020-02-10 19:54:04,062 INFO L226 Difference]: Without dead ends: 2958 [2020-02-10 19:54:04,063 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:54:04,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2958 states. [2020-02-10 19:54:04,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2958 to 1577. [2020-02-10 19:54:04,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 19:54:04,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7077 transitions. [2020-02-10 19:54:04,130 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7077 transitions. Word has length 28 [2020-02-10 19:54:04,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:04,131 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7077 transitions. [2020-02-10 19:54:04,131 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:54:04,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7077 transitions. [2020-02-10 19:54:04,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:54:04,133 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:04,133 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:04,133 INFO L427 AbstractCegarLoop]: === Iteration 743 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:04,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:04,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1696155260, now seen corresponding path program 735 times [2020-02-10 19:54:04,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:04,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705080906] [2020-02-10 19:54:04,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:04,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:04,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 19:54:04,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705080906] [2020-02-10 19:54:04,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:04,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:54:04,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083566624] [2020-02-10 19:54:04,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:54:04,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:04,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:54:04,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:04,668 INFO L87 Difference]: Start difference. First operand 1577 states and 7077 transitions. Second operand 11 states. [2020-02-10 19:54:04,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:04,839 INFO L93 Difference]: Finished difference Result 2976 states and 11774 transitions. [2020-02-10 19:54:04,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:54:04,839 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:54:04,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:04,846 INFO L225 Difference]: With dead ends: 2976 [2020-02-10 19:54:04,846 INFO L226 Difference]: Without dead ends: 2961 [2020-02-10 19:54:04,846 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:54:04,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2961 states. [2020-02-10 19:54:04,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2961 to 1582. [2020-02-10 19:54:04,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2020-02-10 19:54:04,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 7086 transitions. [2020-02-10 19:54:04,914 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 7086 transitions. Word has length 28 [2020-02-10 19:54:04,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:04,914 INFO L479 AbstractCegarLoop]: Abstraction has 1582 states and 7086 transitions. [2020-02-10 19:54:04,914 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:54:04,915 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 7086 transitions. [2020-02-10 19:54:04,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:54:04,917 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:04,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] [2020-02-10 19:54:04,917 INFO L427 AbstractCegarLoop]: === Iteration 744 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:04,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:04,917 INFO L82 PathProgramCache]: Analyzing trace with hash -364704542, now seen corresponding path program 736 times [2020-02-10 19:54:04,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:04,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446877248] [2020-02-10 19:54:04,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:04,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:05,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 19:54:05,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446877248] [2020-02-10 19:54:05,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:05,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:54:05,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728174181] [2020-02-10 19:54:05,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:54:05,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:05,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:54:05,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:05,455 INFO L87 Difference]: Start difference. First operand 1582 states and 7086 transitions. Second operand 11 states. [2020-02-10 19:54:05,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:05,632 INFO L93 Difference]: Finished difference Result 2979 states and 11775 transitions. [2020-02-10 19:54:05,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:54:05,632 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:54:05,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:05,639 INFO L225 Difference]: With dead ends: 2979 [2020-02-10 19:54:05,640 INFO L226 Difference]: Without dead ends: 2956 [2020-02-10 19:54:05,640 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:54:05,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2020-02-10 19:54:05,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 1577. [2020-02-10 19:54:05,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 19:54:05,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7072 transitions. [2020-02-10 19:54:05,729 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7072 transitions. Word has length 28 [2020-02-10 19:54:05,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:05,729 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7072 transitions. [2020-02-10 19:54:05,729 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:54:05,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7072 transitions. [2020-02-10 19:54:05,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:54:05,732 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:05,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] [2020-02-10 19:54:05,732 INFO L427 AbstractCegarLoop]: === Iteration 745 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:05,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:05,733 INFO L82 PathProgramCache]: Analyzing trace with hash 2112474876, now seen corresponding path program 737 times [2020-02-10 19:54:05,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:05,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003173658] [2020-02-10 19:54:05,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:05,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:06,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:06,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003173658] [2020-02-10 19:54:06,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:06,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:54:06,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596135096] [2020-02-10 19:54:06,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:54:06,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:06,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:54:06,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:06,283 INFO L87 Difference]: Start difference. First operand 1577 states and 7072 transitions. Second operand 11 states. [2020-02-10 19:54:06,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:06,443 INFO L93 Difference]: Finished difference Result 2991 states and 11799 transitions. [2020-02-10 19:54:06,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:54:06,444 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:54:06,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:06,451 INFO L225 Difference]: With dead ends: 2991 [2020-02-10 19:54:06,452 INFO L226 Difference]: Without dead ends: 2971 [2020-02-10 19:54:06,452 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:54:06,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2971 states. [2020-02-10 19:54:06,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2971 to 1587. [2020-02-10 19:54:06,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1587 states. [2020-02-10 19:54:06,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 7089 transitions. [2020-02-10 19:54:06,521 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 7089 transitions. Word has length 28 [2020-02-10 19:54:06,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:06,521 INFO L479 AbstractCegarLoop]: Abstraction has 1587 states and 7089 transitions. [2020-02-10 19:54:06,521 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:54:06,521 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 7089 transitions. [2020-02-10 19:54:06,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:54:06,523 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:06,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] [2020-02-10 19:54:06,524 INFO L427 AbstractCegarLoop]: === Iteration 746 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:06,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:06,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1437789922, now seen corresponding path program 738 times [2020-02-10 19:54:06,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:06,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065945050] [2020-02-10 19:54:06,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:06,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:07,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 19:54:07,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065945050] [2020-02-10 19:54:07,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:07,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:54:07,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353309770] [2020-02-10 19:54:07,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:54:07,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:07,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:54:07,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:07,067 INFO L87 Difference]: Start difference. First operand 1587 states and 7089 transitions. Second operand 11 states. [2020-02-10 19:54:07,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:07,259 INFO L93 Difference]: Finished difference Result 2989 states and 11787 transitions. [2020-02-10 19:54:07,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:54:07,260 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:54:07,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:07,267 INFO L225 Difference]: With dead ends: 2989 [2020-02-10 19:54:07,267 INFO L226 Difference]: Without dead ends: 2954 [2020-02-10 19:54:07,267 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:54:07,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2020-02-10 19:54:07,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 1570. [2020-02-10 19:54:07,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 19:54:07,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7052 transitions. [2020-02-10 19:54:07,334 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7052 transitions. Word has length 28 [2020-02-10 19:54:07,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:07,335 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7052 transitions. [2020-02-10 19:54:07,335 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:54:07,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7052 transitions. [2020-02-10 19:54:07,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:54:07,337 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:07,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] [2020-02-10 19:54:07,337 INFO L427 AbstractCegarLoop]: === Iteration 747 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:07,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:07,337 INFO L82 PathProgramCache]: Analyzing trace with hash 840419904, now seen corresponding path program 739 times [2020-02-10 19:54:07,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:07,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276775468] [2020-02-10 19:54:07,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:07,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:07,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:07,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276775468] [2020-02-10 19:54:07,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:07,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:54:07,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537701134] [2020-02-10 19:54:07,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:54:07,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:07,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:54:07,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:07,874 INFO L87 Difference]: Start difference. First operand 1570 states and 7052 transitions. Second operand 11 states. [2020-02-10 19:54:08,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:08,068 INFO L93 Difference]: Finished difference Result 2986 states and 11797 transitions. [2020-02-10 19:54:08,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:54:08,069 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:54:08,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:08,076 INFO L225 Difference]: With dead ends: 2986 [2020-02-10 19:54:08,077 INFO L226 Difference]: Without dead ends: 2970 [2020-02-10 19:54:08,077 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:54:08,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2970 states. [2020-02-10 19:54:08,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2970 to 1585. [2020-02-10 19:54:08,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1585 states. [2020-02-10 19:54:08,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 7093 transitions. [2020-02-10 19:54:08,147 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 7093 transitions. Word has length 28 [2020-02-10 19:54:08,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:08,147 INFO L479 AbstractCegarLoop]: Abstraction has 1585 states and 7093 transitions. [2020-02-10 19:54:08,147 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:54:08,147 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 7093 transitions. [2020-02-10 19:54:08,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:54:08,149 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:08,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] [2020-02-10 19:54:08,149 INFO L427 AbstractCegarLoop]: === Iteration 748 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:08,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:08,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1585122402, now seen corresponding path program 740 times [2020-02-10 19:54:08,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:08,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702672047] [2020-02-10 19:54:08,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:08,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:08,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 19:54:08,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702672047] [2020-02-10 19:54:08,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:08,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:54:08,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855806499] [2020-02-10 19:54:08,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:54:08,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:08,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:54:08,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:08,695 INFO L87 Difference]: Start difference. First operand 1585 states and 7093 transitions. Second operand 11 states. [2020-02-10 19:54:08,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:08,828 INFO L93 Difference]: Finished difference Result 2990 states and 11798 transitions. [2020-02-10 19:54:08,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:54:08,829 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:54:08,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:08,835 INFO L225 Difference]: With dead ends: 2990 [2020-02-10 19:54:08,836 INFO L226 Difference]: Without dead ends: 2963 [2020-02-10 19:54:08,836 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:54:08,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2963 states. [2020-02-10 19:54:08,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2963 to 1578. [2020-02-10 19:54:08,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 19:54:08,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7073 transitions. [2020-02-10 19:54:08,903 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7073 transitions. Word has length 28 [2020-02-10 19:54:08,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:08,904 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7073 transitions. [2020-02-10 19:54:08,904 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:54:08,904 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7073 transitions. [2020-02-10 19:54:08,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:54:08,906 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:08,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] [2020-02-10 19:54:08,906 INFO L427 AbstractCegarLoop]: === Iteration 749 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:08,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:08,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1843606434, now seen corresponding path program 741 times [2020-02-10 19:54:08,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:08,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657340198] [2020-02-10 19:54:08,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:08,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:09,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:09,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657340198] [2020-02-10 19:54:09,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:09,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:54:09,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580497226] [2020-02-10 19:54:09,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:54:09,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:09,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:54:09,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:09,434 INFO L87 Difference]: Start difference. First operand 1578 states and 7073 transitions. Second operand 11 states. [2020-02-10 19:54:09,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:09,603 INFO L93 Difference]: Finished difference Result 2983 states and 11785 transitions. [2020-02-10 19:54:09,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:54:09,604 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:54:09,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:09,611 INFO L225 Difference]: With dead ends: 2983 [2020-02-10 19:54:09,611 INFO L226 Difference]: Without dead ends: 2967 [2020-02-10 19:54:09,611 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:54:09,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2967 states. [2020-02-10 19:54:09,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2967 to 1584. [2020-02-10 19:54:09,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1584 states. [2020-02-10 19:54:09,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 7084 transitions. [2020-02-10 19:54:09,681 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 7084 transitions. Word has length 28 [2020-02-10 19:54:09,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:09,681 INFO L479 AbstractCegarLoop]: Abstraction has 1584 states and 7084 transitions. [2020-02-10 19:54:09,681 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:54:09,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 7084 transitions. [2020-02-10 19:54:09,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:54:09,684 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:09,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] [2020-02-10 19:54:09,684 INFO L427 AbstractCegarLoop]: === Iteration 750 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:09,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:09,684 INFO L82 PathProgramCache]: Analyzing trace with hash -354201438, now seen corresponding path program 742 times [2020-02-10 19:54:09,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:09,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956113647] [2020-02-10 19:54:09,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:09,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:10,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:10,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956113647] [2020-02-10 19:54:10,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:10,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:54:10,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928875657] [2020-02-10 19:54:10,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:54:10,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:10,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:54:10,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:10,214 INFO L87 Difference]: Start difference. First operand 1584 states and 7084 transitions. Second operand 11 states. [2020-02-10 19:54:10,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:10,387 INFO L93 Difference]: Finished difference Result 2985 states and 11783 transitions. [2020-02-10 19:54:10,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:54:10,388 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:54:10,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:10,395 INFO L225 Difference]: With dead ends: 2985 [2020-02-10 19:54:10,395 INFO L226 Difference]: Without dead ends: 2961 [2020-02-10 19:54:10,395 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:54:10,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2961 states. [2020-02-10 19:54:10,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2961 to 1578. [2020-02-10 19:54:10,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 19:54:10,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7067 transitions. [2020-02-10 19:54:10,465 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7067 transitions. Word has length 28 [2020-02-10 19:54:10,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:10,465 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7067 transitions. [2020-02-10 19:54:10,465 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:54:10,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7067 transitions. [2020-02-10 19:54:10,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:54:10,467 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:10,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] [2020-02-10 19:54:10,467 INFO L427 AbstractCegarLoop]: === Iteration 751 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:10,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:10,467 INFO L82 PathProgramCache]: Analyzing trace with hash 512037022, now seen corresponding path program 743 times [2020-02-10 19:54:10,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:10,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518327652] [2020-02-10 19:54:10,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:10,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:11,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:11,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518327652] [2020-02-10 19:54:11,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:11,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:54:11,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128390345] [2020-02-10 19:54:11,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:54:11,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:11,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:54:11,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:11,019 INFO L87 Difference]: Start difference. First operand 1578 states and 7067 transitions. Second operand 11 states. [2020-02-10 19:54:11,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:11,160 INFO L93 Difference]: Finished difference Result 2995 states and 11802 transitions. [2020-02-10 19:54:11,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:54:11,161 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:54:11,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:11,168 INFO L225 Difference]: With dead ends: 2995 [2020-02-10 19:54:11,169 INFO L226 Difference]: Without dead ends: 2975 [2020-02-10 19:54:11,169 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:54:11,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2975 states. [2020-02-10 19:54:11,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2975 to 1588. [2020-02-10 19:54:11,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1588 states. [2020-02-10 19:54:11,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 7084 transitions. [2020-02-10 19:54:11,238 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 7084 transitions. Word has length 28 [2020-02-10 19:54:11,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:11,238 INFO L479 AbstractCegarLoop]: Abstraction has 1588 states and 7084 transitions. [2020-02-10 19:54:11,238 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:54:11,239 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 7084 transitions. [2020-02-10 19:54:11,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:54:11,241 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:11,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] [2020-02-10 19:54:11,241 INFO L427 AbstractCegarLoop]: === Iteration 752 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:11,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:11,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1256739520, now seen corresponding path program 744 times [2020-02-10 19:54:11,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:11,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474535384] [2020-02-10 19:54:11,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:11,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:11,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:11,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474535384] [2020-02-10 19:54:11,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:11,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:54:11,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086774297] [2020-02-10 19:54:11,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:54:11,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:11,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:54:11,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:11,790 INFO L87 Difference]: Start difference. First operand 1588 states and 7084 transitions. Second operand 11 states. [2020-02-10 19:54:11,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:11,987 INFO L93 Difference]: Finished difference Result 2993 states and 11790 transitions. [2020-02-10 19:54:11,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:54:11,988 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:54:11,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:11,995 INFO L225 Difference]: With dead ends: 2993 [2020-02-10 19:54:11,995 INFO L226 Difference]: Without dead ends: 2950 [2020-02-10 19:54:11,996 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:54:12,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2020-02-10 19:54:12,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 1563. [2020-02-10 19:54:12,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2020-02-10 19:54:12,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 7032 transitions. [2020-02-10 19:54:12,063 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 7032 transitions. Word has length 28 [2020-02-10 19:54:12,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:12,064 INFO L479 AbstractCegarLoop]: Abstraction has 1563 states and 7032 transitions. [2020-02-10 19:54:12,064 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:54:12,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 7032 transitions. [2020-02-10 19:54:12,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:54:12,066 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:12,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] [2020-02-10 19:54:12,066 INFO L427 AbstractCegarLoop]: === Iteration 753 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:12,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:12,066 INFO L82 PathProgramCache]: Analyzing trace with hash -725043348, now seen corresponding path program 745 times [2020-02-10 19:54:12,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:12,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313200675] [2020-02-10 19:54:12,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:12,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:12,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:12,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313200675] [2020-02-10 19:54:12,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:12,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:54:12,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657536241] [2020-02-10 19:54:12,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:54:12,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:12,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:54:12,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:12,595 INFO L87 Difference]: Start difference. First operand 1563 states and 7032 transitions. Second operand 11 states. [2020-02-10 19:54:12,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:12,785 INFO L93 Difference]: Finished difference Result 2962 states and 11754 transitions. [2020-02-10 19:54:12,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:54:12,786 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:54:12,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:12,793 INFO L225 Difference]: With dead ends: 2962 [2020-02-10 19:54:12,793 INFO L226 Difference]: Without dead ends: 2947 [2020-02-10 19:54:12,793 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:54:12,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2947 states. [2020-02-10 19:54:12,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2947 to 1580. [2020-02-10 19:54:12,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 19:54:12,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7091 transitions. [2020-02-10 19:54:12,862 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7091 transitions. Word has length 28 [2020-02-10 19:54:12,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:12,862 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7091 transitions. [2020-02-10 19:54:12,862 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:54:12,862 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7091 transitions. [2020-02-10 19:54:12,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:54:12,864 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:12,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] [2020-02-10 19:54:12,864 INFO L427 AbstractCegarLoop]: === Iteration 754 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:12,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:12,864 INFO L82 PathProgramCache]: Analyzing trace with hash 19659150, now seen corresponding path program 746 times [2020-02-10 19:54:12,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:12,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115738931] [2020-02-10 19:54:12,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:12,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:13,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:13,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115738931] [2020-02-10 19:54:13,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:13,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:54:13,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309356152] [2020-02-10 19:54:13,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:54:13,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:13,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:54:13,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:13,391 INFO L87 Difference]: Start difference. First operand 1580 states and 7091 transitions. Second operand 11 states. [2020-02-10 19:54:13,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:13,571 INFO L93 Difference]: Finished difference Result 2963 states and 11751 transitions. [2020-02-10 19:54:13,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:54:13,572 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:54:13,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:13,579 INFO L225 Difference]: With dead ends: 2963 [2020-02-10 19:54:13,579 INFO L226 Difference]: Without dead ends: 2942 [2020-02-10 19:54:13,580 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:54:13,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2942 states. [2020-02-10 19:54:13,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2942 to 1575. [2020-02-10 19:54:13,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 19:54:13,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7077 transitions. [2020-02-10 19:54:13,647 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7077 transitions. Word has length 28 [2020-02-10 19:54:13,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:13,647 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7077 transitions. [2020-02-10 19:54:13,648 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:54:13,648 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7077 transitions. [2020-02-10 19:54:13,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:54:13,650 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:13,650 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:13,650 INFO L427 AbstractCegarLoop]: === Iteration 755 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:13,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:13,650 INFO L82 PathProgramCache]: Analyzing trace with hash 885897610, now seen corresponding path program 747 times [2020-02-10 19:54:13,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:13,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730877846] [2020-02-10 19:54:13,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:13,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:14,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 19:54:14,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730877846] [2020-02-10 19:54:14,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:14,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:54:14,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146810246] [2020-02-10 19:54:14,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:54:14,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:14,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:54:14,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:14,178 INFO L87 Difference]: Start difference. First operand 1575 states and 7077 transitions. Second operand 11 states. [2020-02-10 19:54:14,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:14,352 INFO L93 Difference]: Finished difference Result 2967 states and 11758 transitions. [2020-02-10 19:54:14,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:54:14,353 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:54:14,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:14,360 INFO L225 Difference]: With dead ends: 2967 [2020-02-10 19:54:14,361 INFO L226 Difference]: Without dead ends: 2952 [2020-02-10 19:54:14,361 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:54:14,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2952 states. [2020-02-10 19:54:14,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2952 to 1581. [2020-02-10 19:54:14,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 19:54:14,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7088 transitions. [2020-02-10 19:54:14,429 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7088 transitions. Word has length 28 [2020-02-10 19:54:14,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:14,429 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7088 transitions. [2020-02-10 19:54:14,429 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:54:14,429 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7088 transitions. [2020-02-10 19:54:14,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:54:14,431 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:14,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] [2020-02-10 19:54:14,431 INFO L427 AbstractCegarLoop]: === Iteration 756 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:14,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:14,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1919664690, now seen corresponding path program 748 times [2020-02-10 19:54:14,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:14,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535496442] [2020-02-10 19:54:14,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:14,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:14,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 19:54:14,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535496442] [2020-02-10 19:54:14,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:14,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:54:14,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620090448] [2020-02-10 19:54:14,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:54:14,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:14,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:54:14,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:14,968 INFO L87 Difference]: Start difference. First operand 1581 states and 7088 transitions. Second operand 11 states. [2020-02-10 19:54:15,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:15,116 INFO L93 Difference]: Finished difference Result 2972 states and 11762 transitions. [2020-02-10 19:54:15,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:54:15,116 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:54:15,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:15,123 INFO L225 Difference]: With dead ends: 2972 [2020-02-10 19:54:15,123 INFO L226 Difference]: Without dead ends: 2946 [2020-02-10 19:54:15,123 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:54:15,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2946 states. [2020-02-10 19:54:15,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2946 to 1575. [2020-02-10 19:54:15,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 19:54:15,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7071 transitions. [2020-02-10 19:54:15,193 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7071 transitions. Word has length 28 [2020-02-10 19:54:15,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:15,193 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7071 transitions. [2020-02-10 19:54:15,193 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:54:15,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7071 transitions. [2020-02-10 19:54:15,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:54:15,196 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:15,196 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:15,196 INFO L427 AbstractCegarLoop]: === Iteration 757 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:15,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:15,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1053426230, now seen corresponding path program 749 times [2020-02-10 19:54:15,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:15,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466233] [2020-02-10 19:54:15,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:15,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:15,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:15,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466233] [2020-02-10 19:54:15,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:15,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:54:15,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279684949] [2020-02-10 19:54:15,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:54:15,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:15,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:54:15,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:15,719 INFO L87 Difference]: Start difference. First operand 1575 states and 7071 transitions. Second operand 11 states. [2020-02-10 19:54:15,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:15,890 INFO L93 Difference]: Finished difference Result 2970 states and 11759 transitions. [2020-02-10 19:54:15,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:54:15,891 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:54:15,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:15,898 INFO L225 Difference]: With dead ends: 2970 [2020-02-10 19:54:15,898 INFO L226 Difference]: Without dead ends: 2954 [2020-02-10 19:54:15,898 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:54:15,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2020-02-10 19:54:15,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 1582. [2020-02-10 19:54:15,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2020-02-10 19:54:15,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 7084 transitions. [2020-02-10 19:54:15,968 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 7084 transitions. Word has length 28 [2020-02-10 19:54:15,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:15,969 INFO L479 AbstractCegarLoop]: Abstraction has 1582 states and 7084 transitions. [2020-02-10 19:54:15,969 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:54:15,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 7084 transitions. [2020-02-10 19:54:15,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:54:15,971 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:15,971 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:15,971 INFO L427 AbstractCegarLoop]: === Iteration 758 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:15,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:15,971 INFO L82 PathProgramCache]: Analyzing trace with hash -308723732, now seen corresponding path program 750 times [2020-02-10 19:54:15,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:15,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842196006] [2020-02-10 19:54:15,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:15,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:16,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 19:54:16,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842196006] [2020-02-10 19:54:16,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:16,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:54:16,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092252791] [2020-02-10 19:54:16,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:54:16,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:16,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:54:16,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:16,496 INFO L87 Difference]: Start difference. First operand 1582 states and 7084 transitions. Second operand 11 states. [2020-02-10 19:54:16,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:16,670 INFO L93 Difference]: Finished difference Result 2974 states and 11760 transitions. [2020-02-10 19:54:16,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:54:16,670 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:54:16,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:16,678 INFO L225 Difference]: With dead ends: 2974 [2020-02-10 19:54:16,678 INFO L226 Difference]: Without dead ends: 2941 [2020-02-10 19:54:16,678 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:54:16,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2941 states. [2020-02-10 19:54:16,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2941 to 1569. [2020-02-10 19:54:16,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 19:54:16,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7054 transitions. [2020-02-10 19:54:16,746 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7054 transitions. Word has length 28 [2020-02-10 19:54:16,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:16,746 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7054 transitions. [2020-02-10 19:54:16,746 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:54:16,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7054 transitions. [2020-02-10 19:54:16,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:54:16,749 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:16,749 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:16,749 INFO L427 AbstractCegarLoop]: === Iteration 759 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:16,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:16,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1550256474, now seen corresponding path program 751 times [2020-02-10 19:54:16,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:16,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989328670] [2020-02-10 19:54:16,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:16,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:17,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 19:54:17,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989328670] [2020-02-10 19:54:17,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:17,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:54:17,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487402583] [2020-02-10 19:54:17,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:54:17,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:17,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:54:17,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:17,288 INFO L87 Difference]: Start difference. First operand 1569 states and 7054 transitions. Second operand 11 states. [2020-02-10 19:54:17,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:17,476 INFO L93 Difference]: Finished difference Result 2956 states and 11736 transitions. [2020-02-10 19:54:17,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:54:17,477 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:54:17,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:17,485 INFO L225 Difference]: With dead ends: 2956 [2020-02-10 19:54:17,485 INFO L226 Difference]: Without dead ends: 2941 [2020-02-10 19:54:17,485 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:54:17,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2941 states. [2020-02-10 19:54:17,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2941 to 1579. [2020-02-10 19:54:17,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 19:54:17,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7082 transitions. [2020-02-10 19:54:17,555 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7082 transitions. Word has length 28 [2020-02-10 19:54:17,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:17,555 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7082 transitions. [2020-02-10 19:54:17,555 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:54:17,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7082 transitions. [2020-02-10 19:54:17,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:54:17,558 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:17,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] [2020-02-10 19:54:17,558 INFO L427 AbstractCegarLoop]: === Iteration 760 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:17,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:17,558 INFO L82 PathProgramCache]: Analyzing trace with hash -805553976, now seen corresponding path program 752 times [2020-02-10 19:54:17,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:17,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996565687] [2020-02-10 19:54:17,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:17,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:18,110 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 30 [2020-02-10 19:54:18,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:18,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996565687] [2020-02-10 19:54:18,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:18,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:54:18,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832589876] [2020-02-10 19:54:18,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:54:18,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:18,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:54:18,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:18,118 INFO L87 Difference]: Start difference. First operand 1579 states and 7082 transitions. Second operand 11 states. [2020-02-10 19:54:18,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:18,292 INFO L93 Difference]: Finished difference Result 2957 states and 11733 transitions. [2020-02-10 19:54:18,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:54:18,293 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:54:18,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:18,300 INFO L225 Difference]: With dead ends: 2957 [2020-02-10 19:54:18,301 INFO L226 Difference]: Without dead ends: 2936 [2020-02-10 19:54:18,301 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:54:18,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2936 states. [2020-02-10 19:54:18,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2936 to 1574. [2020-02-10 19:54:18,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 19:54:18,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7068 transitions. [2020-02-10 19:54:18,368 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7068 transitions. Word has length 28 [2020-02-10 19:54:18,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:18,368 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7068 transitions. [2020-02-10 19:54:18,368 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:54:18,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7068 transitions. [2020-02-10 19:54:18,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:54:18,370 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:18,371 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:18,371 INFO L427 AbstractCegarLoop]: === Iteration 761 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:18,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:18,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1136395640, now seen corresponding path program 753 times [2020-02-10 19:54:18,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:18,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562102314] [2020-02-10 19:54:18,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:18,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:18,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:18,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562102314] [2020-02-10 19:54:18,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:18,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:54:18,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302714446] [2020-02-10 19:54:18,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:54:18,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:18,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:54:18,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:18,898 INFO L87 Difference]: Start difference. First operand 1574 states and 7068 transitions. Second operand 11 states. [2020-02-10 19:54:19,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:19,120 INFO L93 Difference]: Finished difference Result 2957 states and 11733 transitions. [2020-02-10 19:54:19,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:54:19,121 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:54:19,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:19,128 INFO L225 Difference]: With dead ends: 2957 [2020-02-10 19:54:19,128 INFO L226 Difference]: Without dead ends: 2942 [2020-02-10 19:54:19,128 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:54:19,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2942 states. [2020-02-10 19:54:19,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2942 to 1579. [2020-02-10 19:54:19,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 19:54:19,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7077 transitions. [2020-02-10 19:54:19,197 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7077 transitions. Word has length 28 [2020-02-10 19:54:19,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:19,197 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7077 transitions. [2020-02-10 19:54:19,197 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:54:19,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7077 transitions. [2020-02-10 19:54:19,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:54:19,199 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:19,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] [2020-02-10 19:54:19,200 INFO L427 AbstractCegarLoop]: === Iteration 762 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:19,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:19,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1495918968, now seen corresponding path program 754 times [2020-02-10 19:54:19,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:19,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043367373] [2020-02-10 19:54:19,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:19,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:19,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:19,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043367373] [2020-02-10 19:54:19,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:19,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:54:19,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494219956] [2020-02-10 19:54:19,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:54:19,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:19,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:54:19,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:19,748 INFO L87 Difference]: Start difference. First operand 1579 states and 7077 transitions. Second operand 11 states. [2020-02-10 19:54:19,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:19,973 INFO L93 Difference]: Finished difference Result 2959 states and 11732 transitions. [2020-02-10 19:54:19,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:54:19,974 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:54:19,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:19,981 INFO L225 Difference]: With dead ends: 2959 [2020-02-10 19:54:19,981 INFO L226 Difference]: Without dead ends: 2937 [2020-02-10 19:54:19,981 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:54:20,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2937 states. [2020-02-10 19:54:20,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2937 to 1574. [2020-02-10 19:54:20,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 19:54:20,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7063 transitions. [2020-02-10 19:54:20,050 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7063 transitions. Word has length 28 [2020-02-10 19:54:20,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:20,050 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7063 transitions. [2020-02-10 19:54:20,050 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:54:20,050 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7063 transitions. [2020-02-10 19:54:20,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:54:20,052 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:20,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] [2020-02-10 19:54:20,052 INFO L427 AbstractCegarLoop]: === Iteration 763 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:20,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:20,053 INFO L82 PathProgramCache]: Analyzing trace with hash -802928200, now seen corresponding path program 755 times [2020-02-10 19:54:20,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:20,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22148489] [2020-02-10 19:54:20,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:20,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:20,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:20,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22148489] [2020-02-10 19:54:20,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:20,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:54:20,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029606448] [2020-02-10 19:54:20,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:54:20,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:20,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:54:20,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:20,589 INFO L87 Difference]: Start difference. First operand 1574 states and 7063 transitions. Second operand 11 states. [2020-02-10 19:54:20,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:20,768 INFO L93 Difference]: Finished difference Result 2960 states and 11735 transitions. [2020-02-10 19:54:20,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:54:20,769 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:54:20,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:20,776 INFO L225 Difference]: With dead ends: 2960 [2020-02-10 19:54:20,776 INFO L226 Difference]: Without dead ends: 2944 [2020-02-10 19:54:20,776 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:54:20,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2944 states. [2020-02-10 19:54:20,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2944 to 1580. [2020-02-10 19:54:20,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 19:54:20,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7074 transitions. [2020-02-10 19:54:20,850 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7074 transitions. Word has length 28 [2020-02-10 19:54:20,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:20,850 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7074 transitions. [2020-02-10 19:54:20,850 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:54:20,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7074 transitions. [2020-02-10 19:54:20,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:54:20,852 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:20,852 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:20,852 INFO L427 AbstractCegarLoop]: === Iteration 764 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:20,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:20,852 INFO L82 PathProgramCache]: Analyzing trace with hash 115021990, now seen corresponding path program 756 times [2020-02-10 19:54:20,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:20,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177304966] [2020-02-10 19:54:20,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:20,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:21,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 19:54:21,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177304966] [2020-02-10 19:54:21,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:21,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:54:21,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050567903] [2020-02-10 19:54:21,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:54:21,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:21,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:54:21,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:21,386 INFO L87 Difference]: Start difference. First operand 1580 states and 7074 transitions. Second operand 11 states. [2020-02-10 19:54:21,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:21,566 INFO L93 Difference]: Finished difference Result 2961 states and 11731 transitions. [2020-02-10 19:54:21,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:54:21,566 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:54:21,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:21,573 INFO L225 Difference]: With dead ends: 2961 [2020-02-10 19:54:21,574 INFO L226 Difference]: Without dead ends: 2933 [2020-02-10 19:54:21,574 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:54:21,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2933 states. [2020-02-10 19:54:21,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2933 to 1569. [2020-02-10 19:54:21,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 19:54:21,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7049 transitions. [2020-02-10 19:54:21,643 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7049 transitions. Word has length 28 [2020-02-10 19:54:21,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:21,643 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7049 transitions. [2020-02-10 19:54:21,643 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:54:21,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7049 transitions. [2020-02-10 19:54:21,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:54:21,645 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:21,645 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:21,646 INFO L427 AbstractCegarLoop]: === Iteration 765 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:21,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:21,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1539753370, now seen corresponding path program 757 times [2020-02-10 19:54:21,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:21,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169427832] [2020-02-10 19:54:21,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:21,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:22,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:22,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169427832] [2020-02-10 19:54:22,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:22,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:54:22,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887686079] [2020-02-10 19:54:22,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:54:22,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:22,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:54:22,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:22,187 INFO L87 Difference]: Start difference. First operand 1569 states and 7049 transitions. Second operand 11 states. [2020-02-10 19:54:22,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:22,367 INFO L93 Difference]: Finished difference Result 2969 states and 11757 transitions. [2020-02-10 19:54:22,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:54:22,368 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:54:22,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:22,375 INFO L225 Difference]: With dead ends: 2969 [2020-02-10 19:54:22,375 INFO L226 Difference]: Without dead ends: 2954 [2020-02-10 19:54:22,375 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:54:22,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2020-02-10 19:54:22,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 1581. [2020-02-10 19:54:22,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 19:54:22,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7082 transitions. [2020-02-10 19:54:22,444 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7082 transitions. Word has length 28 [2020-02-10 19:54:22,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:22,444 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7082 transitions. [2020-02-10 19:54:22,444 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:54:22,445 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7082 transitions. [2020-02-10 19:54:22,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:54:22,447 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:22,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] [2020-02-10 19:54:22,447 INFO L427 AbstractCegarLoop]: === Iteration 766 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:22,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:22,447 INFO L82 PathProgramCache]: Analyzing trace with hash -50348374, now seen corresponding path program 758 times [2020-02-10 19:54:22,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:22,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390128914] [2020-02-10 19:54:22,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:22,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:22,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 19:54:22,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390128914] [2020-02-10 19:54:22,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:22,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:54:22,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518078617] [2020-02-10 19:54:22,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:54:22,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:22,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:54:22,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:22,991 INFO L87 Difference]: Start difference. First operand 1581 states and 7082 transitions. Second operand 11 states. [2020-02-10 19:54:23,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:23,135 INFO L93 Difference]: Finished difference Result 2974 states and 11761 transitions. [2020-02-10 19:54:23,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:54:23,136 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:54:23,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:23,142 INFO L225 Difference]: With dead ends: 2974 [2020-02-10 19:54:23,142 INFO L226 Difference]: Without dead ends: 2948 [2020-02-10 19:54:23,142 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:54:23,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2948 states. [2020-02-10 19:54:23,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2948 to 1575. [2020-02-10 19:54:23,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 19:54:23,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7065 transitions. [2020-02-10 19:54:23,212 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7065 transitions. Word has length 28 [2020-02-10 19:54:23,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:23,212 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7065 transitions. [2020-02-10 19:54:23,212 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:54:23,212 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7065 transitions. [2020-02-10 19:54:23,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:54:23,215 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:23,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] [2020-02-10 19:54:23,215 INFO L427 AbstractCegarLoop]: === Iteration 767 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:23,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:23,215 INFO L82 PathProgramCache]: Analyzing trace with hash -464042214, now seen corresponding path program 759 times [2020-02-10 19:54:23,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:23,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241894484] [2020-02-10 19:54:23,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:23,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:23,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 19:54:23,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241894484] [2020-02-10 19:54:23,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:23,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:54:23,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139991921] [2020-02-10 19:54:23,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:54:23,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:23,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:54:23,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:23,750 INFO L87 Difference]: Start difference. First operand 1575 states and 7065 transitions. Second operand 11 states. [2020-02-10 19:54:23,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:23,932 INFO L93 Difference]: Finished difference Result 2965 states and 11744 transitions. [2020-02-10 19:54:23,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:54:23,932 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:54:23,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:23,939 INFO L225 Difference]: With dead ends: 2965 [2020-02-10 19:54:23,940 INFO L226 Difference]: Without dead ends: 2950 [2020-02-10 19:54:23,940 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:54:23,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2020-02-10 19:54:24,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 1580. [2020-02-10 19:54:24,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 19:54:24,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7074 transitions. [2020-02-10 19:54:24,007 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7074 transitions. Word has length 28 [2020-02-10 19:54:24,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:24,007 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7074 transitions. [2020-02-10 19:54:24,007 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:54:24,008 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7074 transitions. [2020-02-10 19:54:24,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:54:24,010 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:24,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] [2020-02-10 19:54:24,010 INFO L427 AbstractCegarLoop]: === Iteration 768 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:24,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:24,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1198610474, now seen corresponding path program 760 times [2020-02-10 19:54:24,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:24,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638807401] [2020-02-10 19:54:24,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:24,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:24,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:24,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638807401] [2020-02-10 19:54:24,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:24,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:54:24,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112998086] [2020-02-10 19:54:24,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:54:24,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:24,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:54:24,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:24,568 INFO L87 Difference]: Start difference. First operand 1580 states and 7074 transitions. Second operand 11 states. [2020-02-10 19:54:24,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:24,786 INFO L93 Difference]: Finished difference Result 2967 states and 11743 transitions. [2020-02-10 19:54:24,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:54:24,786 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:54:24,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:24,794 INFO L225 Difference]: With dead ends: 2967 [2020-02-10 19:54:24,794 INFO L226 Difference]: Without dead ends: 2945 [2020-02-10 19:54:24,794 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:54:24,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2945 states. [2020-02-10 19:54:24,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2945 to 1575. [2020-02-10 19:54:24,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 19:54:24,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7060 transitions. [2020-02-10 19:54:24,863 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7060 transitions. Word has length 28 [2020-02-10 19:54:24,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:24,863 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7060 transitions. [2020-02-10 19:54:24,864 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:54:24,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7060 transitions. [2020-02-10 19:54:24,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:54:24,866 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:24,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] [2020-02-10 19:54:24,866 INFO L427 AbstractCegarLoop]: === Iteration 769 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:24,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:24,866 INFO L82 PathProgramCache]: Analyzing trace with hash -47722598, now seen corresponding path program 761 times [2020-02-10 19:54:24,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:24,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727405304] [2020-02-10 19:54:24,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:24,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:25,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:25,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727405304] [2020-02-10 19:54:25,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:25,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:54:25,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769322311] [2020-02-10 19:54:25,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:54:25,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:25,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:54:25,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:25,398 INFO L87 Difference]: Start difference. First operand 1575 states and 7060 transitions. Second operand 11 states. [2020-02-10 19:54:25,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:25,556 INFO L93 Difference]: Finished difference Result 2978 states and 11765 transitions. [2020-02-10 19:54:25,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:54:25,556 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:54:25,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:25,563 INFO L225 Difference]: With dead ends: 2978 [2020-02-10 19:54:25,563 INFO L226 Difference]: Without dead ends: 2958 [2020-02-10 19:54:25,564 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:54:25,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2958 states. [2020-02-10 19:54:25,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2958 to 1583. [2020-02-10 19:54:25,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 19:54:25,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7074 transitions. [2020-02-10 19:54:25,632 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7074 transitions. Word has length 28 [2020-02-10 19:54:25,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:25,632 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7074 transitions. [2020-02-10 19:54:25,632 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:54:25,633 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7074 transitions. [2020-02-10 19:54:25,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:54:25,635 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:25,635 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:25,635 INFO L427 AbstractCegarLoop]: === Iteration 770 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:25,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:25,635 INFO L82 PathProgramCache]: Analyzing trace with hash 125525094, now seen corresponding path program 762 times [2020-02-10 19:54:25,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:25,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518842247] [2020-02-10 19:54:25,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:25,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:26,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 19:54:26,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518842247] [2020-02-10 19:54:26,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:26,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:54:26,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810171177] [2020-02-10 19:54:26,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:54:26,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:26,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:54:26,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:26,166 INFO L87 Difference]: Start difference. First operand 1583 states and 7074 transitions. Second operand 11 states. [2020-02-10 19:54:26,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:26,362 INFO L93 Difference]: Finished difference Result 2975 states and 11752 transitions. [2020-02-10 19:54:26,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:54:26,362 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:54:26,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:26,370 INFO L225 Difference]: With dead ends: 2975 [2020-02-10 19:54:26,370 INFO L226 Difference]: Without dead ends: 2944 [2020-02-10 19:54:26,370 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:54:26,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2944 states. [2020-02-10 19:54:26,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2944 to 1569. [2020-02-10 19:54:26,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 19:54:26,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7043 transitions. [2020-02-10 19:54:26,438 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7043 transitions. Word has length 28 [2020-02-10 19:54:26,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:26,438 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7043 transitions. [2020-02-10 19:54:26,438 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:54:26,438 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7043 transitions. [2020-02-10 19:54:26,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:54:26,440 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:26,440 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:26,440 INFO L427 AbstractCegarLoop]: === Iteration 771 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:26,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:26,440 INFO L82 PathProgramCache]: Analyzing trace with hash -784547768, now seen corresponding path program 763 times [2020-02-10 19:54:26,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:26,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355378990] [2020-02-10 19:54:26,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:26,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:26,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 19:54:26,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355378990] [2020-02-10 19:54:26,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:26,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:54:26,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122272149] [2020-02-10 19:54:26,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:54:26,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:26,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:54:26,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:26,960 INFO L87 Difference]: Start difference. First operand 1569 states and 7043 transitions. Second operand 11 states. [2020-02-10 19:54:27,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:27,136 INFO L93 Difference]: Finished difference Result 2976 states and 11770 transitions. [2020-02-10 19:54:27,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:54:27,136 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:54:27,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:27,143 INFO L225 Difference]: With dead ends: 2976 [2020-02-10 19:54:27,144 INFO L226 Difference]: Without dead ends: 2960 [2020-02-10 19:54:27,144 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:54:27,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2960 states. [2020-02-10 19:54:27,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2960 to 1583. [2020-02-10 19:54:27,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 19:54:27,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7082 transitions. [2020-02-10 19:54:27,211 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7082 transitions. Word has length 28 [2020-02-10 19:54:27,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:27,211 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7082 transitions. [2020-02-10 19:54:27,211 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:54:27,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7082 transitions. [2020-02-10 19:54:27,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:54:27,213 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:27,214 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:27,214 INFO L427 AbstractCegarLoop]: === Iteration 772 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:27,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:27,214 INFO L82 PathProgramCache]: Analyzing trace with hash -39845270, now seen corresponding path program 764 times [2020-02-10 19:54:27,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:27,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444035465] [2020-02-10 19:54:27,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:27,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:27,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:27,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444035465] [2020-02-10 19:54:27,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:27,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:54:27,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889673620] [2020-02-10 19:54:27,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:54:27,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:27,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:54:27,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:27,757 INFO L87 Difference]: Start difference. First operand 1583 states and 7082 transitions. Second operand 11 states. [2020-02-10 19:54:27,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:27,905 INFO L93 Difference]: Finished difference Result 2980 states and 11771 transitions. [2020-02-10 19:54:27,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:54:27,906 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:54:27,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:27,913 INFO L225 Difference]: With dead ends: 2980 [2020-02-10 19:54:27,913 INFO L226 Difference]: Without dead ends: 2953 [2020-02-10 19:54:27,913 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:54:27,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2953 states. [2020-02-10 19:54:27,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2953 to 1576. [2020-02-10 19:54:27,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 19:54:27,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7062 transitions. [2020-02-10 19:54:27,982 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7062 transitions. Word has length 28 [2020-02-10 19:54:27,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:27,983 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7062 transitions. [2020-02-10 19:54:27,983 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:54:27,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7062 transitions. [2020-02-10 19:54:27,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:54:27,985 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:27,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] [2020-02-10 19:54:27,985 INFO L427 AbstractCegarLoop]: === Iteration 773 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:27,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:27,985 INFO L82 PathProgramCache]: Analyzing trace with hash 291163388, now seen corresponding path program 765 times [2020-02-10 19:54:27,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:27,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432316223] [2020-02-10 19:54:27,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:27,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:28,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 19:54:28,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432316223] [2020-02-10 19:54:28,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:28,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:54:28,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586660035] [2020-02-10 19:54:28,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:54:28,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:28,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:54:28,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:28,516 INFO L87 Difference]: Start difference. First operand 1576 states and 7062 transitions. Second operand 11 states. [2020-02-10 19:54:28,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:28,708 INFO L93 Difference]: Finished difference Result 2972 states and 11756 transitions. [2020-02-10 19:54:28,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:54:28,708 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:54:28,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:28,715 INFO L225 Difference]: With dead ends: 2972 [2020-02-10 19:54:28,715 INFO L226 Difference]: Without dead ends: 2956 [2020-02-10 19:54:28,715 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:54:28,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2020-02-10 19:54:28,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 1582. [2020-02-10 19:54:28,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2020-02-10 19:54:28,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 7073 transitions. [2020-02-10 19:54:28,783 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 7073 transitions. Word has length 28 [2020-02-10 19:54:28,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:28,783 INFO L479 AbstractCegarLoop]: Abstraction has 1582 states and 7073 transitions. [2020-02-10 19:54:28,783 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:54:28,783 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 7073 transitions. [2020-02-10 19:54:28,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:54:28,785 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:28,785 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:28,785 INFO L427 AbstractCegarLoop]: === Iteration 774 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:28,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:28,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1209113578, now seen corresponding path program 766 times [2020-02-10 19:54:28,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:28,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273348385] [2020-02-10 19:54:28,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:28,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:29,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:29,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273348385] [2020-02-10 19:54:29,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:29,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:54:29,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195481955] [2020-02-10 19:54:29,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:54:29,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:29,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:54:29,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:29,321 INFO L87 Difference]: Start difference. First operand 1582 states and 7073 transitions. Second operand 11 states. [2020-02-10 19:54:29,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:29,533 INFO L93 Difference]: Finished difference Result 2973 states and 11752 transitions. [2020-02-10 19:54:29,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:54:29,533 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:54:29,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:29,540 INFO L225 Difference]: With dead ends: 2973 [2020-02-10 19:54:29,540 INFO L226 Difference]: Without dead ends: 2950 [2020-02-10 19:54:29,540 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:54:29,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2020-02-10 19:54:29,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 1576. [2020-02-10 19:54:29,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 19:54:29,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7056 transitions. [2020-02-10 19:54:29,608 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7056 transitions. Word has length 28 [2020-02-10 19:54:29,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:29,608 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7056 transitions. [2020-02-10 19:54:29,608 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:54:29,608 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7056 transitions. [2020-02-10 19:54:29,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:54:29,610 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:29,610 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:29,610 INFO L427 AbstractCegarLoop]: === Iteration 775 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:29,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:29,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1648160452, now seen corresponding path program 767 times [2020-02-10 19:54:29,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:29,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696504358] [2020-02-10 19:54:29,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:29,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:30,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:30,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696504358] [2020-02-10 19:54:30,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:30,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:54:30,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944085547] [2020-02-10 19:54:30,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:54:30,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:30,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:54:30,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:30,148 INFO L87 Difference]: Start difference. First operand 1576 states and 7056 transitions. Second operand 11 states. [2020-02-10 19:54:30,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:30,302 INFO L93 Difference]: Finished difference Result 2982 states and 11769 transitions. [2020-02-10 19:54:30,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:54:30,303 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:54:30,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:30,309 INFO L225 Difference]: With dead ends: 2982 [2020-02-10 19:54:30,309 INFO L226 Difference]: Without dead ends: 2962 [2020-02-10 19:54:30,309 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:54:30,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2962 states. [2020-02-10 19:54:30,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2962 to 1584. [2020-02-10 19:54:30,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1584 states. [2020-02-10 19:54:30,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 7070 transitions. [2020-02-10 19:54:30,379 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 7070 transitions. Word has length 28 [2020-02-10 19:54:30,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:30,379 INFO L479 AbstractCegarLoop]: Abstraction has 1584 states and 7070 transitions. [2020-02-10 19:54:30,379 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:54:30,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 7070 transitions. [2020-02-10 19:54:30,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:54:30,381 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:30,381 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:30,381 INFO L427 AbstractCegarLoop]: === Iteration 776 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:30,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:30,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1474912760, now seen corresponding path program 768 times [2020-02-10 19:54:30,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:30,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840564339] [2020-02-10 19:54:30,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:30,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:30,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:30,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840564339] [2020-02-10 19:54:30,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:30,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:54:30,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742530727] [2020-02-10 19:54:30,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:54:30,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:30,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:54:30,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:30,935 INFO L87 Difference]: Start difference. First operand 1584 states and 7070 transitions. Second operand 11 states. [2020-02-10 19:54:31,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:31,120 INFO L93 Difference]: Finished difference Result 2979 states and 11756 transitions. [2020-02-10 19:54:31,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:54:31,121 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:54:31,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:31,128 INFO L225 Difference]: With dead ends: 2979 [2020-02-10 19:54:31,128 INFO L226 Difference]: Without dead ends: 2941 [2020-02-10 19:54:31,128 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:54:31,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2941 states. [2020-02-10 19:54:31,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2941 to 1563. [2020-02-10 19:54:31,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2020-02-10 19:54:31,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 7026 transitions. [2020-02-10 19:54:31,196 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 7026 transitions. Word has length 28 [2020-02-10 19:54:31,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:31,197 INFO L479 AbstractCegarLoop]: Abstraction has 1563 states and 7026 transitions. [2020-02-10 19:54:31,197 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:54:31,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 7026 transitions. [2020-02-10 19:54:31,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:54:31,199 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:31,199 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:31,199 INFO L427 AbstractCegarLoop]: === Iteration 777 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:31,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:31,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1292451582, now seen corresponding path program 769 times [2020-02-10 19:54:31,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:31,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093761688] [2020-02-10 19:54:31,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:31,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:31,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:31,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093761688] [2020-02-10 19:54:31,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:31,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:54:31,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696607220] [2020-02-10 19:54:31,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:54:31,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:31,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:54:31,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:31,723 INFO L87 Difference]: Start difference. First operand 1563 states and 7026 transitions. Second operand 11 states. [2020-02-10 19:54:31,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:31,989 INFO L93 Difference]: Finished difference Result 2948 states and 11716 transitions. [2020-02-10 19:54:31,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:54:31,989 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:54:31,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:31,996 INFO L225 Difference]: With dead ends: 2948 [2020-02-10 19:54:31,996 INFO L226 Difference]: Without dead ends: 2933 [2020-02-10 19:54:31,997 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:54:32,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2933 states. [2020-02-10 19:54:32,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2933 to 1578. [2020-02-10 19:54:32,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 19:54:32,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7078 transitions. [2020-02-10 19:54:32,063 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7078 transitions. Word has length 28 [2020-02-10 19:54:32,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:32,063 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7078 transitions. [2020-02-10 19:54:32,063 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:54:32,063 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7078 transitions. [2020-02-10 19:54:32,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:54:32,066 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:32,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] [2020-02-10 19:54:32,066 INFO L427 AbstractCegarLoop]: === Iteration 778 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:32,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:32,066 INFO L82 PathProgramCache]: Analyzing trace with hash -547749084, now seen corresponding path program 770 times [2020-02-10 19:54:32,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:32,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313354980] [2020-02-10 19:54:32,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:32,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:32,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 19:54:32,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313354980] [2020-02-10 19:54:32,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:32,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:54:32,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638575868] [2020-02-10 19:54:32,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:54:32,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:32,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:54:32,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:32,597 INFO L87 Difference]: Start difference. First operand 1578 states and 7078 transitions. Second operand 11 states. [2020-02-10 19:54:32,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:32,790 INFO L93 Difference]: Finished difference Result 2949 states and 11713 transitions. [2020-02-10 19:54:32,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:54:32,791 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:54:32,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:32,798 INFO L225 Difference]: With dead ends: 2949 [2020-02-10 19:54:32,798 INFO L226 Difference]: Without dead ends: 2928 [2020-02-10 19:54:32,798 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:54:32,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2928 states. [2020-02-10 19:54:32,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2928 to 1573. [2020-02-10 19:54:32,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 19:54:32,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7064 transitions. [2020-02-10 19:54:32,866 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7064 transitions. Word has length 28 [2020-02-10 19:54:32,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:32,866 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7064 transitions. [2020-02-10 19:54:32,866 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:54:32,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7064 transitions. [2020-02-10 19:54:32,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:54:32,869 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:32,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] [2020-02-10 19:54:32,869 INFO L427 AbstractCegarLoop]: === Iteration 779 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:32,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:32,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1929430334, now seen corresponding path program 771 times [2020-02-10 19:54:32,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:32,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964830848] [2020-02-10 19:54:32,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:32,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:33,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:33,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964830848] [2020-02-10 19:54:33,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:33,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:54:33,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843811014] [2020-02-10 19:54:33,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:54:33,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:33,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:54:33,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:33,399 INFO L87 Difference]: Start difference. First operand 1573 states and 7064 transitions. Second operand 11 states. [2020-02-10 19:54:33,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:33,629 INFO L93 Difference]: Finished difference Result 2950 states and 11715 transitions. [2020-02-10 19:54:33,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:54:33,629 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:54:33,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:33,637 INFO L225 Difference]: With dead ends: 2950 [2020-02-10 19:54:33,637 INFO L226 Difference]: Without dead ends: 2935 [2020-02-10 19:54:33,637 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:54:33,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2935 states. [2020-02-10 19:54:33,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2935 to 1578. [2020-02-10 19:54:33,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 19:54:33,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7073 transitions. [2020-02-10 19:54:33,705 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7073 transitions. Word has length 28 [2020-02-10 19:54:33,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:33,705 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7073 transitions. [2020-02-10 19:54:33,705 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:54:33,705 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7073 transitions. [2020-02-10 19:54:33,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:54:33,707 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:33,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] [2020-02-10 19:54:33,707 INFO L427 AbstractCegarLoop]: === Iteration 780 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:33,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:33,707 INFO L82 PathProgramCache]: Analyzing trace with hash -131429468, now seen corresponding path program 772 times [2020-02-10 19:54:33,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:33,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123206448] [2020-02-10 19:54:33,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:33,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:34,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 19:54:34,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123206448] [2020-02-10 19:54:34,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:34,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:54:34,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148782811] [2020-02-10 19:54:34,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:54:34,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:34,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:54:34,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:34,234 INFO L87 Difference]: Start difference. First operand 1578 states and 7073 transitions. Second operand 11 states. [2020-02-10 19:54:34,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:34,431 INFO L93 Difference]: Finished difference Result 2953 states and 11716 transitions. [2020-02-10 19:54:34,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:54:34,432 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:54:34,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:34,439 INFO L225 Difference]: With dead ends: 2953 [2020-02-10 19:54:34,439 INFO L226 Difference]: Without dead ends: 2930 [2020-02-10 19:54:34,439 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:54:34,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2020-02-10 19:54:34,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 1573. [2020-02-10 19:54:34,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 19:54:34,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7059 transitions. [2020-02-10 19:54:34,506 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7059 transitions. Word has length 28 [2020-02-10 19:54:34,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:34,506 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7059 transitions. [2020-02-10 19:54:34,507 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:54:34,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7059 transitions. [2020-02-10 19:54:34,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:54:34,509 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:34,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] [2020-02-10 19:54:34,509 INFO L427 AbstractCegarLoop]: === Iteration 781 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:34,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:34,509 INFO L82 PathProgramCache]: Analyzing trace with hash -9893506, now seen corresponding path program 773 times [2020-02-10 19:54:34,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:34,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326018939] [2020-02-10 19:54:34,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:34,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:35,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:35,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326018939] [2020-02-10 19:54:35,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:35,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:54:35,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375659824] [2020-02-10 19:54:35,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:54:35,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:35,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:54:35,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:35,037 INFO L87 Difference]: Start difference. First operand 1573 states and 7059 transitions. Second operand 11 states. [2020-02-10 19:54:35,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:35,236 INFO L93 Difference]: Finished difference Result 2953 states and 11717 transitions. [2020-02-10 19:54:35,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:54:35,237 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:54:35,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:35,243 INFO L225 Difference]: With dead ends: 2953 [2020-02-10 19:54:35,243 INFO L226 Difference]: Without dead ends: 2937 [2020-02-10 19:54:35,243 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:54:35,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2937 states. [2020-02-10 19:54:35,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2937 to 1579. [2020-02-10 19:54:35,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 19:54:35,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7070 transitions. [2020-02-10 19:54:35,310 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7070 transitions. Word has length 28 [2020-02-10 19:54:35,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:35,310 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7070 transitions. [2020-02-10 19:54:35,310 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:54:35,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7070 transitions. [2020-02-10 19:54:35,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:54:35,313 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:35,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] [2020-02-10 19:54:35,313 INFO L427 AbstractCegarLoop]: === Iteration 782 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:35,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:35,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1479511490, now seen corresponding path program 774 times [2020-02-10 19:54:35,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:35,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181767326] [2020-02-10 19:54:35,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:35,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:35,842 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 19:54:35,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 19:54:35,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181767326] [2020-02-10 19:54:35,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:35,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:54:35,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328415571] [2020-02-10 19:54:35,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:54:35,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:35,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:54:35,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:35,850 INFO L87 Difference]: Start difference. First operand 1579 states and 7070 transitions. Second operand 11 states. [2020-02-10 19:54:36,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:36,033 INFO L93 Difference]: Finished difference Result 2955 states and 11715 transitions. [2020-02-10 19:54:36,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:54:36,033 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:54:36,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:36,041 INFO L225 Difference]: With dead ends: 2955 [2020-02-10 19:54:36,041 INFO L226 Difference]: Without dead ends: 2926 [2020-02-10 19:54:36,041 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:54:36,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2926 states. [2020-02-10 19:54:36,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2926 to 1568. [2020-02-10 19:54:36,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 19:54:36,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7045 transitions. [2020-02-10 19:54:36,108 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7045 transitions. Word has length 28 [2020-02-10 19:54:36,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:36,108 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7045 transitions. [2020-02-10 19:54:36,108 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:54:36,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7045 transitions. [2020-02-10 19:54:36,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:54:36,110 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:36,110 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:36,111 INFO L427 AbstractCegarLoop]: === Iteration 783 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:36,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:36,111 INFO L82 PathProgramCache]: Analyzing trace with hash -704706260, now seen corresponding path program 775 times [2020-02-10 19:54:36,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:36,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718437280] [2020-02-10 19:54:36,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:36,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:36,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 19:54:36,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718437280] [2020-02-10 19:54:36,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:36,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:54:36,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715716446] [2020-02-10 19:54:36,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:54:36,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:36,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:54:36,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:36,649 INFO L87 Difference]: Start difference. First operand 1568 states and 7045 transitions. Second operand 11 states. [2020-02-10 19:54:36,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:36,829 INFO L93 Difference]: Finished difference Result 2947 states and 11709 transitions. [2020-02-10 19:54:36,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:54:36,829 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:54:36,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:36,836 INFO L225 Difference]: With dead ends: 2947 [2020-02-10 19:54:36,837 INFO L226 Difference]: Without dead ends: 2932 [2020-02-10 19:54:36,837 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:54:36,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2932 states. [2020-02-10 19:54:36,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2932 to 1578. [2020-02-10 19:54:36,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 19:54:36,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7073 transitions. [2020-02-10 19:54:36,929 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7073 transitions. Word has length 28 [2020-02-10 19:54:36,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:36,929 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7073 transitions. [2020-02-10 19:54:36,929 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:54:36,930 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7073 transitions. [2020-02-10 19:54:36,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:54:36,932 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:36,932 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:36,932 INFO L427 AbstractCegarLoop]: === Iteration 784 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:36,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:36,932 INFO L82 PathProgramCache]: Analyzing trace with hash 39996238, now seen corresponding path program 776 times [2020-02-10 19:54:36,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:36,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338933512] [2020-02-10 19:54:36,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:36,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:37,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 19:54:37,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338933512] [2020-02-10 19:54:37,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:37,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:54:37,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604430640] [2020-02-10 19:54:37,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:54:37,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:37,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:54:37,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:37,459 INFO L87 Difference]: Start difference. First operand 1578 states and 7073 transitions. Second operand 11 states. [2020-02-10 19:54:37,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:37,637 INFO L93 Difference]: Finished difference Result 2948 states and 11706 transitions. [2020-02-10 19:54:37,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:54:37,638 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:54:37,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:37,645 INFO L225 Difference]: With dead ends: 2948 [2020-02-10 19:54:37,645 INFO L226 Difference]: Without dead ends: 2927 [2020-02-10 19:54:37,645 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:54:37,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2927 states. [2020-02-10 19:54:37,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2927 to 1573. [2020-02-10 19:54:37,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 19:54:37,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7059 transitions. [2020-02-10 19:54:37,713 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7059 transitions. Word has length 28 [2020-02-10 19:54:37,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:37,713 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7059 transitions. [2020-02-10 19:54:37,713 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:54:37,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7059 transitions. [2020-02-10 19:54:37,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:54:37,715 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:37,715 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:37,715 INFO L427 AbstractCegarLoop]: === Iteration 785 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:37,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:37,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1981945854, now seen corresponding path program 777 times [2020-02-10 19:54:37,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:37,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698805067] [2020-02-10 19:54:37,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:37,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:38,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:38,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698805067] [2020-02-10 19:54:38,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:38,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:54:38,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012529076] [2020-02-10 19:54:38,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:54:38,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:38,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:54:38,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:38,235 INFO L87 Difference]: Start difference. First operand 1573 states and 7059 transitions. Second operand 11 states. [2020-02-10 19:54:38,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:38,414 INFO L93 Difference]: Finished difference Result 2948 states and 11706 transitions. [2020-02-10 19:54:38,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:54:38,415 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:54:38,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:38,422 INFO L225 Difference]: With dead ends: 2948 [2020-02-10 19:54:38,422 INFO L226 Difference]: Without dead ends: 2933 [2020-02-10 19:54:38,422 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:54:38,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2933 states. [2020-02-10 19:54:38,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2933 to 1578. [2020-02-10 19:54:38,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 19:54:38,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7068 transitions. [2020-02-10 19:54:38,489 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7068 transitions. Word has length 28 [2020-02-10 19:54:38,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:38,489 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7068 transitions. [2020-02-10 19:54:38,489 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:54:38,489 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7068 transitions. [2020-02-10 19:54:38,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:54:38,492 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:38,492 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:38,492 INFO L427 AbstractCegarLoop]: === Iteration 786 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:38,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:38,492 INFO L82 PathProgramCache]: Analyzing trace with hash -650368754, now seen corresponding path program 778 times [2020-02-10 19:54:38,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:38,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116135673] [2020-02-10 19:54:38,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:38,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:39,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:39,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116135673] [2020-02-10 19:54:39,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:39,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:54:39,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911275045] [2020-02-10 19:54:39,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:54:39,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:39,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:54:39,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:39,020 INFO L87 Difference]: Start difference. First operand 1578 states and 7068 transitions. Second operand 11 states. [2020-02-10 19:54:39,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:39,202 INFO L93 Difference]: Finished difference Result 2950 states and 11705 transitions. [2020-02-10 19:54:39,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:54:39,203 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:54:39,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:39,210 INFO L225 Difference]: With dead ends: 2950 [2020-02-10 19:54:39,210 INFO L226 Difference]: Without dead ends: 2928 [2020-02-10 19:54:39,210 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:54:39,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2928 states. [2020-02-10 19:54:39,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2928 to 1573. [2020-02-10 19:54:39,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 19:54:39,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7054 transitions. [2020-02-10 19:54:39,277 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7054 transitions. Word has length 28 [2020-02-10 19:54:39,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:39,277 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7054 transitions. [2020-02-10 19:54:39,277 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:54:39,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7054 transitions. [2020-02-10 19:54:39,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:54:39,280 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:39,280 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:39,280 INFO L427 AbstractCegarLoop]: === Iteration 787 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:39,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:39,280 INFO L82 PathProgramCache]: Analyzing trace with hash 42622014, now seen corresponding path program 779 times [2020-02-10 19:54:39,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:39,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325450288] [2020-02-10 19:54:39,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:39,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:39,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 19:54:39,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325450288] [2020-02-10 19:54:39,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:39,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:54:39,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821910219] [2020-02-10 19:54:39,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:54:39,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:39,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:54:39,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:39,828 INFO L87 Difference]: Start difference. First operand 1573 states and 7054 transitions. Second operand 11 states. [2020-02-10 19:54:40,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:40,038 INFO L93 Difference]: Finished difference Result 2951 states and 11708 transitions. [2020-02-10 19:54:40,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:54:40,039 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:54:40,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:40,046 INFO L225 Difference]: With dead ends: 2951 [2020-02-10 19:54:40,046 INFO L226 Difference]: Without dead ends: 2935 [2020-02-10 19:54:40,046 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:54:40,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2935 states. [2020-02-10 19:54:40,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2935 to 1579. [2020-02-10 19:54:40,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 19:54:40,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7065 transitions. [2020-02-10 19:54:40,114 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7065 transitions. Word has length 28 [2020-02-10 19:54:40,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:40,114 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7065 transitions. [2020-02-10 19:54:40,114 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:54:40,114 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7065 transitions. [2020-02-10 19:54:40,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:54:40,116 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:40,116 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:40,116 INFO L427 AbstractCegarLoop]: === Iteration 788 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:40,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:40,116 INFO L82 PathProgramCache]: Analyzing trace with hash 960572204, now seen corresponding path program 780 times [2020-02-10 19:54:40,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:40,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540284495] [2020-02-10 19:54:40,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:40,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:40,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 19:54:40,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540284495] [2020-02-10 19:54:40,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:40,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:54:40,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449484312] [2020-02-10 19:54:40,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:54:40,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:40,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:54:40,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:40,659 INFO L87 Difference]: Start difference. First operand 1579 states and 7065 transitions. Second operand 11 states. [2020-02-10 19:54:40,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:40,831 INFO L93 Difference]: Finished difference Result 2952 states and 11704 transitions. [2020-02-10 19:54:40,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:54:40,831 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:54:40,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:40,838 INFO L225 Difference]: With dead ends: 2952 [2020-02-10 19:54:40,838 INFO L226 Difference]: Without dead ends: 2924 [2020-02-10 19:54:40,838 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:54:40,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2924 states. [2020-02-10 19:54:40,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2924 to 1568. [2020-02-10 19:54:40,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 19:54:40,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7040 transitions. [2020-02-10 19:54:40,906 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7040 transitions. Word has length 28 [2020-02-10 19:54:40,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:40,906 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7040 transitions. [2020-02-10 19:54:40,906 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:54:40,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7040 transitions. [2020-02-10 19:54:40,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:54:40,908 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:40,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] [2020-02-10 19:54:40,908 INFO L427 AbstractCegarLoop]: === Iteration 789 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:40,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:40,909 INFO L82 PathProgramCache]: Analyzing trace with hash -683700052, now seen corresponding path program 781 times [2020-02-10 19:54:40,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:40,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134568013] [2020-02-10 19:54:40,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:40,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:41,427 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 19:54:41,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 19:54:41,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134568013] [2020-02-10 19:54:41,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:41,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:54:41,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417973408] [2020-02-10 19:54:41,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:54:41,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:41,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:54:41,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:41,436 INFO L87 Difference]: Start difference. First operand 1568 states and 7040 transitions. Second operand 11 states. [2020-02-10 19:54:41,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:41,615 INFO L93 Difference]: Finished difference Result 2952 states and 11715 transitions. [2020-02-10 19:54:41,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:54:41,615 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:54:41,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:41,622 INFO L225 Difference]: With dead ends: 2952 [2020-02-10 19:54:41,623 INFO L226 Difference]: Without dead ends: 2937 [2020-02-10 19:54:41,623 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:54:41,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2937 states. [2020-02-10 19:54:41,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2937 to 1578. [2020-02-10 19:54:41,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 19:54:41,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7068 transitions. [2020-02-10 19:54:41,690 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7068 transitions. Word has length 28 [2020-02-10 19:54:41,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:41,690 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7068 transitions. [2020-02-10 19:54:41,690 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:54:41,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7068 transitions. [2020-02-10 19:54:41,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:54:41,692 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:41,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] [2020-02-10 19:54:41,693 INFO L427 AbstractCegarLoop]: === Iteration 790 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:41,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:41,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1550407442, now seen corresponding path program 782 times [2020-02-10 19:54:41,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:41,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301065137] [2020-02-10 19:54:41,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:41,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:42,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 19:54:42,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301065137] [2020-02-10 19:54:42,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:42,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:54:42,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527723682] [2020-02-10 19:54:42,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:54:42,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:42,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:54:42,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:42,218 INFO L87 Difference]: Start difference. First operand 1578 states and 7068 transitions. Second operand 11 states. [2020-02-10 19:54:42,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:42,400 INFO L93 Difference]: Finished difference Result 2955 states and 11716 transitions. [2020-02-10 19:54:42,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:54:42,401 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:54:42,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:42,408 INFO L225 Difference]: With dead ends: 2955 [2020-02-10 19:54:42,408 INFO L226 Difference]: Without dead ends: 2932 [2020-02-10 19:54:42,408 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:54:42,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2932 states. [2020-02-10 19:54:42,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2932 to 1573. [2020-02-10 19:54:42,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 19:54:42,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7054 transitions. [2020-02-10 19:54:42,474 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7054 transitions. Word has length 28 [2020-02-10 19:54:42,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:42,475 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7054 transitions. [2020-02-10 19:54:42,475 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:54:42,475 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7054 transitions. [2020-02-10 19:54:42,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:54:42,477 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:42,477 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:42,477 INFO L427 AbstractCegarLoop]: === Iteration 791 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:42,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:42,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1218929854, now seen corresponding path program 783 times [2020-02-10 19:54:42,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:42,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310489572] [2020-02-10 19:54:42,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:42,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:43,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:43,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310489572] [2020-02-10 19:54:43,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:43,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:54:43,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864671132] [2020-02-10 19:54:43,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:54:43,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:43,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:54:43,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:43,007 INFO L87 Difference]: Start difference. First operand 1573 states and 7054 transitions. Second operand 11 states. [2020-02-10 19:54:43,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:43,179 INFO L93 Difference]: Finished difference Result 2951 states and 11708 transitions. [2020-02-10 19:54:43,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:54:43,179 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:54:43,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:43,185 INFO L225 Difference]: With dead ends: 2951 [2020-02-10 19:54:43,185 INFO L226 Difference]: Without dead ends: 2936 [2020-02-10 19:54:43,186 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:54:43,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2936 states. [2020-02-10 19:54:43,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2936 to 1578. [2020-02-10 19:54:43,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 19:54:43,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7063 transitions. [2020-02-10 19:54:43,274 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7063 transitions. Word has length 28 [2020-02-10 19:54:43,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:43,274 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7063 transitions. [2020-02-10 19:54:43,274 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:54:43,274 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7063 transitions. [2020-02-10 19:54:43,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:54:43,276 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:43,276 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:43,276 INFO L427 AbstractCegarLoop]: === Iteration 792 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:43,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:43,277 INFO L82 PathProgramCache]: Analyzing trace with hash 443722834, now seen corresponding path program 784 times [2020-02-10 19:54:43,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:43,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036343663] [2020-02-10 19:54:43,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:43,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:43,793 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 30 [2020-02-10 19:54:43,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:43,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036343663] [2020-02-10 19:54:43,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:43,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:54:43,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288706200] [2020-02-10 19:54:43,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:54:43,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:43,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:54:43,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:43,802 INFO L87 Difference]: Start difference. First operand 1578 states and 7063 transitions. Second operand 11 states. [2020-02-10 19:54:43,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:43,987 INFO L93 Difference]: Finished difference Result 2953 states and 11707 transitions. [2020-02-10 19:54:43,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:54:43,987 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:54:43,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:43,994 INFO L225 Difference]: With dead ends: 2953 [2020-02-10 19:54:43,994 INFO L226 Difference]: Without dead ends: 2931 [2020-02-10 19:54:43,994 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:54:44,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2931 states. [2020-02-10 19:54:44,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2931 to 1573. [2020-02-10 19:54:44,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 19:54:44,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7049 transitions. [2020-02-10 19:54:44,063 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7049 transitions. Word has length 28 [2020-02-10 19:54:44,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:44,063 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7049 transitions. [2020-02-10 19:54:44,063 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:54:44,063 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7049 transitions. [2020-02-10 19:54:44,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:54:44,065 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:44,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] [2020-02-10 19:54:44,066 INFO L427 AbstractCegarLoop]: === Iteration 793 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:44,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:44,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1553033218, now seen corresponding path program 785 times [2020-02-10 19:54:44,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:44,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355562879] [2020-02-10 19:54:44,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:44,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:44,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 19:54:44,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355562879] [2020-02-10 19:54:44,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:44,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:54:44,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220268262] [2020-02-10 19:54:44,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:54:44,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:44,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:54:44,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:44,596 INFO L87 Difference]: Start difference. First operand 1573 states and 7049 transitions. Second operand 11 states. [2020-02-10 19:54:44,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:44,809 INFO L93 Difference]: Finished difference Result 2959 states and 11721 transitions. [2020-02-10 19:54:44,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:54:44,809 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:54:44,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:44,816 INFO L225 Difference]: With dead ends: 2959 [2020-02-10 19:54:44,816 INFO L226 Difference]: Without dead ends: 2941 [2020-02-10 19:54:44,816 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:54:44,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2941 states. [2020-02-10 19:54:44,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2941 to 1580. [2020-02-10 19:54:44,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 19:54:44,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7062 transitions. [2020-02-10 19:54:44,885 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7062 transitions. Word has length 28 [2020-02-10 19:54:44,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:44,885 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7062 transitions. [2020-02-10 19:54:44,885 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:54:44,885 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7062 transitions. [2020-02-10 19:54:44,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:54:44,888 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:44,888 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:44,888 INFO L427 AbstractCegarLoop]: === Iteration 794 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:44,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:44,888 INFO L82 PathProgramCache]: Analyzing trace with hash 981578412, now seen corresponding path program 786 times [2020-02-10 19:54:44,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:44,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998794775] [2020-02-10 19:54:44,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:44,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:45,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 19:54:45,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998794775] [2020-02-10 19:54:45,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:45,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:54:45,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187627155] [2020-02-10 19:54:45,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:54:45,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:45,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:54:45,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:45,417 INFO L87 Difference]: Start difference. First operand 1580 states and 7062 transitions. Second operand 11 states. [2020-02-10 19:54:45,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:45,636 INFO L93 Difference]: Finished difference Result 2958 states and 11712 transitions. [2020-02-10 19:54:45,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:54:45,637 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:54:45,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:45,644 INFO L225 Difference]: With dead ends: 2958 [2020-02-10 19:54:45,644 INFO L226 Difference]: Without dead ends: 2929 [2020-02-10 19:54:45,644 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:54:45,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2929 states. [2020-02-10 19:54:45,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2929 to 1568. [2020-02-10 19:54:45,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 19:54:45,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7035 transitions. [2020-02-10 19:54:45,714 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7035 transitions. Word has length 28 [2020-02-10 19:54:45,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:45,714 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7035 transitions. [2020-02-10 19:54:45,714 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:54:45,714 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7035 transitions. [2020-02-10 19:54:45,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:54:45,716 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:45,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] [2020-02-10 19:54:45,716 INFO L427 AbstractCegarLoop]: === Iteration 795 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:45,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:45,717 INFO L82 PathProgramCache]: Analyzing trace with hash 71505550, now seen corresponding path program 787 times [2020-02-10 19:54:45,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:45,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050583918] [2020-02-10 19:54:45,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:45,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:46,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:46,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050583918] [2020-02-10 19:54:46,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:46,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:54:46,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583801688] [2020-02-10 19:54:46,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:54:46,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:46,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:54:46,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:46,255 INFO L87 Difference]: Start difference. First operand 1568 states and 7035 transitions. Second operand 11 states. [2020-02-10 19:54:46,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:46,488 INFO L93 Difference]: Finished difference Result 2959 states and 11729 transitions. [2020-02-10 19:54:46,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:54:46,489 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:54:46,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:46,496 INFO L225 Difference]: With dead ends: 2959 [2020-02-10 19:54:46,496 INFO L226 Difference]: Without dead ends: 2943 [2020-02-10 19:54:46,496 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:54:46,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2943 states. [2020-02-10 19:54:46,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2943 to 1580. [2020-02-10 19:54:46,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 19:54:46,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7069 transitions. [2020-02-10 19:54:46,565 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7069 transitions. Word has length 28 [2020-02-10 19:54:46,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:46,566 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7069 transitions. [2020-02-10 19:54:46,566 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:54:46,566 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7069 transitions. [2020-02-10 19:54:46,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:54:46,568 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:46,568 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:46,568 INFO L427 AbstractCegarLoop]: === Iteration 796 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:46,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:46,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1560910546, now seen corresponding path program 788 times [2020-02-10 19:54:46,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:46,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284867779] [2020-02-10 19:54:46,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:46,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:47,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 19:54:47,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284867779] [2020-02-10 19:54:47,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:47,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:54:47,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175227481] [2020-02-10 19:54:47,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:54:47,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:47,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:54:47,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:47,099 INFO L87 Difference]: Start difference. First operand 1580 states and 7069 transitions. Second operand 11 states. [2020-02-10 19:54:47,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:47,327 INFO L93 Difference]: Finished difference Result 2961 states and 11727 transitions. [2020-02-10 19:54:47,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:54:47,328 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:54:47,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:47,335 INFO L225 Difference]: With dead ends: 2961 [2020-02-10 19:54:47,336 INFO L226 Difference]: Without dead ends: 2937 [2020-02-10 19:54:47,336 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:54:47,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2937 states. [2020-02-10 19:54:47,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2937 to 1574. [2020-02-10 19:54:47,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 19:54:47,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7052 transitions. [2020-02-10 19:54:47,403 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7052 transitions. Word has length 28 [2020-02-10 19:54:47,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:47,403 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7052 transitions. [2020-02-10 19:54:47,403 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:54:47,403 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7052 transitions. [2020-02-10 19:54:47,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:54:47,405 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:47,405 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:47,405 INFO L427 AbstractCegarLoop]: === Iteration 797 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:47,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:47,406 INFO L82 PathProgramCache]: Analyzing trace with hash -463724252, now seen corresponding path program 789 times [2020-02-10 19:54:47,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:47,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324412154] [2020-02-10 19:54:47,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:47,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:47,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:47,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324412154] [2020-02-10 19:54:47,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:47,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:54:47,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911936861] [2020-02-10 19:54:47,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:54:47,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:47,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:54:47,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:47,962 INFO L87 Difference]: Start difference. First operand 1574 states and 7052 transitions. Second operand 11 states. [2020-02-10 19:54:48,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:48,162 INFO L93 Difference]: Finished difference Result 2958 states and 11721 transitions. [2020-02-10 19:54:48,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:54:48,163 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:54:48,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:48,170 INFO L225 Difference]: With dead ends: 2958 [2020-02-10 19:54:48,170 INFO L226 Difference]: Without dead ends: 2942 [2020-02-10 19:54:48,170 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:54:48,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2942 states. [2020-02-10 19:54:48,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2942 to 1580. [2020-02-10 19:54:48,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 19:54:48,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7063 transitions. [2020-02-10 19:54:48,239 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7063 transitions. Word has length 28 [2020-02-10 19:54:48,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:48,240 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7063 transitions. [2020-02-10 19:54:48,240 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:54:48,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7063 transitions. [2020-02-10 19:54:48,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:54:48,242 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:48,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] [2020-02-10 19:54:48,242 INFO L427 AbstractCegarLoop]: === Iteration 798 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:48,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:48,242 INFO L82 PathProgramCache]: Analyzing trace with hash 454225938, now seen corresponding path program 790 times [2020-02-10 19:54:48,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:48,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142460743] [2020-02-10 19:54:48,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:48,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:48,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:48,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142460743] [2020-02-10 19:54:48,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:48,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:54:48,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112099612] [2020-02-10 19:54:48,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:54:48,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:48,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:54:48,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:48,798 INFO L87 Difference]: Start difference. First operand 1580 states and 7063 transitions. Second operand 11 states. [2020-02-10 19:54:49,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:49,009 INFO L93 Difference]: Finished difference Result 2959 states and 11717 transitions. [2020-02-10 19:54:49,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:54:49,009 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:54:49,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:49,016 INFO L225 Difference]: With dead ends: 2959 [2020-02-10 19:54:49,016 INFO L226 Difference]: Without dead ends: 2936 [2020-02-10 19:54:49,016 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:54:49,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2936 states. [2020-02-10 19:54:49,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2936 to 1574. [2020-02-10 19:54:49,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 19:54:49,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7046 transitions. [2020-02-10 19:54:49,084 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7046 transitions. Word has length 28 [2020-02-10 19:54:49,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:49,085 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7046 transitions. [2020-02-10 19:54:49,085 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:54:49,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7046 transitions. [2020-02-10 19:54:49,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:54:49,087 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:49,087 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:49,087 INFO L427 AbstractCegarLoop]: === Iteration 799 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:49,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:49,087 INFO L82 PathProgramCache]: Analyzing trace with hash -47404636, now seen corresponding path program 791 times [2020-02-10 19:54:49,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:49,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759165085] [2020-02-10 19:54:49,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:49,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:49,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 19:54:49,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759165085] [2020-02-10 19:54:49,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:49,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:54:49,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945982902] [2020-02-10 19:54:49,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:54:49,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:49,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:54:49,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:49,624 INFO L87 Difference]: Start difference. First operand 1574 states and 7046 transitions. Second operand 11 states. [2020-02-10 19:54:49,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:49,811 INFO L93 Difference]: Finished difference Result 2963 states and 11726 transitions. [2020-02-10 19:54:49,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:54:49,812 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:54:49,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:49,819 INFO L225 Difference]: With dead ends: 2963 [2020-02-10 19:54:49,820 INFO L226 Difference]: Without dead ends: 2945 [2020-02-10 19:54:49,820 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:54:49,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2945 states. [2020-02-10 19:54:49,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2945 to 1581. [2020-02-10 19:54:49,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 19:54:49,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7059 transitions. [2020-02-10 19:54:49,889 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7059 transitions. Word has length 28 [2020-02-10 19:54:49,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:49,889 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7059 transitions. [2020-02-10 19:54:49,889 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:54:49,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7059 transitions. [2020-02-10 19:54:49,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:54:49,891 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:49,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] [2020-02-10 19:54:49,891 INFO L427 AbstractCegarLoop]: === Iteration 800 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:49,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:49,892 INFO L82 PathProgramCache]: Analyzing trace with hash -618859442, now seen corresponding path program 792 times [2020-02-10 19:54:49,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:49,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152905190] [2020-02-10 19:54:49,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:49,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:50,444 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 31 [2020-02-10 19:54:50,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:50,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152905190] [2020-02-10 19:54:50,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:50,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:54:50,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139487758] [2020-02-10 19:54:50,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:54:50,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:50,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:54:50,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:50,453 INFO L87 Difference]: Start difference. First operand 1581 states and 7059 transitions. Second operand 11 states. [2020-02-10 19:54:50,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:50,675 INFO L93 Difference]: Finished difference Result 2962 states and 11717 transitions. [2020-02-10 19:54:50,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:54:50,676 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:54:50,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:50,682 INFO L225 Difference]: With dead ends: 2962 [2020-02-10 19:54:50,683 INFO L226 Difference]: Without dead ends: 2927 [2020-02-10 19:54:50,683 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:54:50,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2927 states. [2020-02-10 19:54:50,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2927 to 1563. [2020-02-10 19:54:50,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2020-02-10 19:54:50,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 7021 transitions. [2020-02-10 19:54:50,752 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 7021 transitions. Word has length 28 [2020-02-10 19:54:50,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:50,752 INFO L479 AbstractCegarLoop]: Abstraction has 1563 states and 7021 transitions. [2020-02-10 19:54:50,753 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:54:50,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 7021 transitions. [2020-02-10 19:54:50,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:54:50,755 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:50,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] [2020-02-10 19:54:50,755 INFO L427 AbstractCegarLoop]: === Iteration 801 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:50,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:50,755 INFO L82 PathProgramCache]: Analyzing trace with hash 644085600, now seen corresponding path program 793 times [2020-02-10 19:54:50,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:50,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711415076] [2020-02-10 19:54:50,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:50,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:51,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 19:54:51,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711415076] [2020-02-10 19:54:51,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:51,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:54:51,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686475373] [2020-02-10 19:54:51,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:54:51,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:51,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:54:51,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:51,288 INFO L87 Difference]: Start difference. First operand 1563 states and 7021 transitions. Second operand 11 states. [2020-02-10 19:54:51,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:51,470 INFO L93 Difference]: Finished difference Result 2985 states and 11793 transitions. [2020-02-10 19:54:51,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:54:51,471 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:54:51,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:51,478 INFO L225 Difference]: With dead ends: 2985 [2020-02-10 19:54:51,478 INFO L226 Difference]: Without dead ends: 2970 [2020-02-10 19:54:51,478 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:54:51,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2970 states. [2020-02-10 19:54:51,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2970 to 1584. [2020-02-10 19:54:51,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1584 states. [2020-02-10 19:54:51,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 7089 transitions. [2020-02-10 19:54:51,547 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 7089 transitions. Word has length 28 [2020-02-10 19:54:51,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:51,547 INFO L479 AbstractCegarLoop]: Abstraction has 1584 states and 7089 transitions. [2020-02-10 19:54:51,547 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:54:51,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 7089 transitions. [2020-02-10 19:54:51,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:54:51,549 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:51,549 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:51,549 INFO L427 AbstractCegarLoop]: === Iteration 802 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:51,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:51,549 INFO L82 PathProgramCache]: Analyzing trace with hash 2133490596, now seen corresponding path program 794 times [2020-02-10 19:54:51,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:51,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705965459] [2020-02-10 19:54:51,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:51,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:52,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 19:54:52,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705965459] [2020-02-10 19:54:52,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:52,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:54:52,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913194446] [2020-02-10 19:54:52,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:54:52,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:52,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:54:52,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:52,099 INFO L87 Difference]: Start difference. First operand 1584 states and 7089 transitions. Second operand 11 states. [2020-02-10 19:54:52,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:52,263 INFO L93 Difference]: Finished difference Result 2990 states and 11797 transitions. [2020-02-10 19:54:52,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:54:52,264 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:54:52,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:52,270 INFO L225 Difference]: With dead ends: 2990 [2020-02-10 19:54:52,271 INFO L226 Difference]: Without dead ends: 2964 [2020-02-10 19:54:52,271 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:54:52,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2964 states. [2020-02-10 19:54:52,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2964 to 1578. [2020-02-10 19:54:52,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 19:54:52,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7072 transitions. [2020-02-10 19:54:52,340 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7072 transitions. Word has length 28 [2020-02-10 19:54:52,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:52,340 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7072 transitions. [2020-02-10 19:54:52,340 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:54:52,340 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7072 transitions. [2020-02-10 19:54:52,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:54:52,342 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:52,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] [2020-02-10 19:54:52,342 INFO L427 AbstractCegarLoop]: === Iteration 803 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:52,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:52,342 INFO L82 PathProgramCache]: Analyzing trace with hash -2039940738, now seen corresponding path program 795 times [2020-02-10 19:54:52,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:52,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704196917] [2020-02-10 19:54:52,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:52,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:52,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:52,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704196917] [2020-02-10 19:54:52,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:52,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:54:52,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928616957] [2020-02-10 19:54:52,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:54:52,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:52,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:54:52,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:52,870 INFO L87 Difference]: Start difference. First operand 1578 states and 7072 transitions. Second operand 11 states. [2020-02-10 19:54:53,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:53,068 INFO L93 Difference]: Finished difference Result 2982 states and 11782 transitions. [2020-02-10 19:54:53,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:54:53,068 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:54:53,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:53,076 INFO L225 Difference]: With dead ends: 2982 [2020-02-10 19:54:53,076 INFO L226 Difference]: Without dead ends: 2967 [2020-02-10 19:54:53,076 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:54:53,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2967 states. [2020-02-10 19:54:53,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2967 to 1583. [2020-02-10 19:54:53,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 19:54:53,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7081 transitions. [2020-02-10 19:54:53,145 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7081 transitions. Word has length 28 [2020-02-10 19:54:53,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:53,145 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7081 transitions. [2020-02-10 19:54:53,145 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:54:53,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7081 transitions. [2020-02-10 19:54:53,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:54:53,147 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:53,147 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:53,147 INFO L427 AbstractCegarLoop]: === Iteration 804 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:53,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:53,148 INFO L82 PathProgramCache]: Analyzing trace with hash 194166756, now seen corresponding path program 796 times [2020-02-10 19:54:53,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:53,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893213147] [2020-02-10 19:54:53,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:53,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:53,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:53,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893213147] [2020-02-10 19:54:53,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:53,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:54:53,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086742135] [2020-02-10 19:54:53,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:54:53,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:53,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:54:53,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:53,696 INFO L87 Difference]: Start difference. First operand 1583 states and 7081 transitions. Second operand 11 states. [2020-02-10 19:54:53,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:53,898 INFO L93 Difference]: Finished difference Result 2985 states and 11783 transitions. [2020-02-10 19:54:53,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:54:53,899 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:54:53,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:53,906 INFO L225 Difference]: With dead ends: 2985 [2020-02-10 19:54:53,906 INFO L226 Difference]: Without dead ends: 2962 [2020-02-10 19:54:53,907 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:54:53,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2962 states. [2020-02-10 19:54:53,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2962 to 1578. [2020-02-10 19:54:53,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 19:54:53,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7067 transitions. [2020-02-10 19:54:53,974 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7067 transitions. Word has length 28 [2020-02-10 19:54:53,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:53,975 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7067 transitions. [2020-02-10 19:54:53,975 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:54:53,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7067 transitions. [2020-02-10 19:54:53,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:54:53,977 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:53,977 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:53,977 INFO L427 AbstractCegarLoop]: === Iteration 805 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:53,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:53,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1623621122, now seen corresponding path program 797 times [2020-02-10 19:54:53,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:53,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117574673] [2020-02-10 19:54:53,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:53,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:54,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:54,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117574673] [2020-02-10 19:54:54,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:54,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:54:54,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183155209] [2020-02-10 19:54:54,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:54:54,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:54,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:54:54,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:54,526 INFO L87 Difference]: Start difference. First operand 1578 states and 7067 transitions. Second operand 11 states. [2020-02-10 19:54:54,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:54,670 INFO L93 Difference]: Finished difference Result 2997 states and 11807 transitions. [2020-02-10 19:54:54,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:54:54,670 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:54:54,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:54,677 INFO L225 Difference]: With dead ends: 2997 [2020-02-10 19:54:54,677 INFO L226 Difference]: Without dead ends: 2977 [2020-02-10 19:54:54,677 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:54:54,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2977 states. [2020-02-10 19:54:54,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2977 to 1588. [2020-02-10 19:54:54,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1588 states. [2020-02-10 19:54:54,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 7084 transitions. [2020-02-10 19:54:54,746 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 7084 transitions. Word has length 28 [2020-02-10 19:54:54,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:54,746 INFO L479 AbstractCegarLoop]: Abstraction has 1588 states and 7084 transitions. [2020-02-10 19:54:54,746 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:54:54,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 7084 transitions. [2020-02-10 19:54:54,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:54:54,748 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:54,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] [2020-02-10 19:54:54,748 INFO L427 AbstractCegarLoop]: === Iteration 806 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:54,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:54,748 INFO L82 PathProgramCache]: Analyzing trace with hash -878918624, now seen corresponding path program 798 times [2020-02-10 19:54:54,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:54,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452616205] [2020-02-10 19:54:54,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:54,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:55,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:55,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452616205] [2020-02-10 19:54:55,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:55,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:54:55,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863128144] [2020-02-10 19:54:55,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:54:55,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:55,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:54:55,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:55,287 INFO L87 Difference]: Start difference. First operand 1588 states and 7084 transitions. Second operand 11 states. [2020-02-10 19:54:55,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:55,494 INFO L93 Difference]: Finished difference Result 2995 states and 11795 transitions. [2020-02-10 19:54:55,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:54:55,494 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:54:55,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:55,501 INFO L225 Difference]: With dead ends: 2995 [2020-02-10 19:54:55,501 INFO L226 Difference]: Without dead ends: 2960 [2020-02-10 19:54:55,501 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:54:55,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2960 states. [2020-02-10 19:54:55,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2960 to 1571. [2020-02-10 19:54:55,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 19:54:55,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7047 transitions. [2020-02-10 19:54:55,568 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7047 transitions. Word has length 28 [2020-02-10 19:54:55,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:55,568 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7047 transitions. [2020-02-10 19:54:55,568 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:54:55,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7047 transitions. [2020-02-10 19:54:55,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:54:55,571 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:55,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] [2020-02-10 19:54:55,571 INFO L427 AbstractCegarLoop]: === Iteration 807 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:55,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:55,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1231830922, now seen corresponding path program 799 times [2020-02-10 19:54:55,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:55,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723304813] [2020-02-10 19:54:55,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:55,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:56,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:56,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723304813] [2020-02-10 19:54:56,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:56,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:54:56,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412008568] [2020-02-10 19:54:56,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:54:56,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:56,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:54:56,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:56,112 INFO L87 Difference]: Start difference. First operand 1571 states and 7047 transitions. Second operand 11 states. [2020-02-10 19:54:56,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:56,292 INFO L93 Difference]: Finished difference Result 2981 states and 11778 transitions. [2020-02-10 19:54:56,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:54:56,292 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:54:56,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:56,299 INFO L225 Difference]: With dead ends: 2981 [2020-02-10 19:54:56,299 INFO L226 Difference]: Without dead ends: 2966 [2020-02-10 19:54:56,299 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:54:56,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2966 states. [2020-02-10 19:54:56,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2966 to 1583. [2020-02-10 19:54:56,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 19:54:56,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7080 transitions. [2020-02-10 19:54:56,367 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7080 transitions. Word has length 28 [2020-02-10 19:54:56,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:56,367 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7080 transitions. [2020-02-10 19:54:56,367 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:54:56,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7080 transitions. [2020-02-10 19:54:56,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:54:56,370 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:56,370 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:56,370 INFO L427 AbstractCegarLoop]: === Iteration 808 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:56,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:56,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1573731378, now seen corresponding path program 800 times [2020-02-10 19:54:56,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:56,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699968266] [2020-02-10 19:54:56,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:56,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:56,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:56,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699968266] [2020-02-10 19:54:56,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:56,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:54:56,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152400029] [2020-02-10 19:54:56,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:54:56,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:56,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:54:56,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:56,917 INFO L87 Difference]: Start difference. First operand 1583 states and 7080 transitions. Second operand 11 states. [2020-02-10 19:54:57,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:57,063 INFO L93 Difference]: Finished difference Result 2986 states and 11782 transitions. [2020-02-10 19:54:57,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:54:57,063 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:54:57,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:57,071 INFO L225 Difference]: With dead ends: 2986 [2020-02-10 19:54:57,071 INFO L226 Difference]: Without dead ends: 2960 [2020-02-10 19:54:57,071 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:54:57,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2960 states. [2020-02-10 19:54:57,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2960 to 1577. [2020-02-10 19:54:57,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 19:54:57,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7063 transitions. [2020-02-10 19:54:57,138 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7063 transitions. Word has length 28 [2020-02-10 19:54:57,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:57,138 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7063 transitions. [2020-02-10 19:54:57,138 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:54:57,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7063 transitions. [2020-02-10 19:54:57,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:54:57,140 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:57,140 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:57,141 INFO L427 AbstractCegarLoop]: === Iteration 809 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:57,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:57,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1987425218, now seen corresponding path program 801 times [2020-02-10 19:54:57,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:57,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102132542] [2020-02-10 19:54:57,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:57,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:57,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 19:54:57,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102132542] [2020-02-10 19:54:57,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:57,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:54:57,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490597993] [2020-02-10 19:54:57,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:54:57,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:57,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:54:57,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:57,668 INFO L87 Difference]: Start difference. First operand 1577 states and 7063 transitions. Second operand 11 states. [2020-02-10 19:54:57,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:57,889 INFO L93 Difference]: Finished difference Result 2977 states and 11765 transitions. [2020-02-10 19:54:57,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:54:57,889 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:54:57,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:57,897 INFO L225 Difference]: With dead ends: 2977 [2020-02-10 19:54:57,897 INFO L226 Difference]: Without dead ends: 2962 [2020-02-10 19:54:57,897 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:54:57,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2962 states. [2020-02-10 19:54:57,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2962 to 1582. [2020-02-10 19:54:57,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2020-02-10 19:54:57,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 7072 transitions. [2020-02-10 19:54:57,965 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 7072 transitions. Word has length 28 [2020-02-10 19:54:57,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:57,965 INFO L479 AbstractCegarLoop]: Abstraction has 1582 states and 7072 transitions. [2020-02-10 19:54:57,965 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:54:57,965 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 7072 transitions. [2020-02-10 19:54:57,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:54:57,967 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:57,967 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:57,967 INFO L427 AbstractCegarLoop]: === Iteration 810 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:57,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:57,967 INFO L82 PathProgramCache]: Analyzing trace with hash -324772530, now seen corresponding path program 802 times [2020-02-10 19:54:57,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:57,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705987889] [2020-02-10 19:54:57,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:57,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:58,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:58,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705987889] [2020-02-10 19:54:58,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:58,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:54:58,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783889534] [2020-02-10 19:54:58,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:54:58,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:58,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:54:58,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:58,499 INFO L87 Difference]: Start difference. First operand 1582 states and 7072 transitions. Second operand 11 states. [2020-02-10 19:54:58,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:58,682 INFO L93 Difference]: Finished difference Result 2979 states and 11764 transitions. [2020-02-10 19:54:58,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:54:58,682 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:54:58,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:58,690 INFO L225 Difference]: With dead ends: 2979 [2020-02-10 19:54:58,690 INFO L226 Difference]: Without dead ends: 2957 [2020-02-10 19:54:58,690 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:54:58,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2957 states. [2020-02-10 19:54:58,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2957 to 1577. [2020-02-10 19:54:58,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 19:54:58,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7058 transitions. [2020-02-10 19:54:58,758 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7058 transitions. Word has length 28 [2020-02-10 19:54:58,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:58,758 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7058 transitions. [2020-02-10 19:54:58,758 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:54:58,758 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7058 transitions. [2020-02-10 19:54:58,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:54:58,760 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:58,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] [2020-02-10 19:54:58,760 INFO L427 AbstractCegarLoop]: === Iteration 811 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:58,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:58,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1571105602, now seen corresponding path program 803 times [2020-02-10 19:54:58,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:58,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901731595] [2020-02-10 19:54:58,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:58,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:54:59,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:54:59,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901731595] [2020-02-10 19:54:59,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:54:59,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:54:59,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876839021] [2020-02-10 19:54:59,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:54:59,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:54:59,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:54:59,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:54:59,302 INFO L87 Difference]: Start difference. First operand 1577 states and 7058 transitions. Second operand 11 states. [2020-02-10 19:54:59,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:54:59,479 INFO L93 Difference]: Finished difference Result 2990 states and 11786 transitions. [2020-02-10 19:54:59,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:54:59,479 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:54:59,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:54:59,486 INFO L225 Difference]: With dead ends: 2990 [2020-02-10 19:54:59,486 INFO L226 Difference]: Without dead ends: 2970 [2020-02-10 19:54:59,486 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:54:59,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2970 states. [2020-02-10 19:54:59,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2970 to 1585. [2020-02-10 19:54:59,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1585 states. [2020-02-10 19:54:59,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 7072 transitions. [2020-02-10 19:54:59,554 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 7072 transitions. Word has length 28 [2020-02-10 19:54:59,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:54:59,555 INFO L479 AbstractCegarLoop]: Abstraction has 1585 states and 7072 transitions. [2020-02-10 19:54:59,555 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:54:59,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 7072 transitions. [2020-02-10 19:54:59,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:54:59,557 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:54:59,557 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:54:59,557 INFO L427 AbstractCegarLoop]: === Iteration 812 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:54:59,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:54:59,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1397857910, now seen corresponding path program 804 times [2020-02-10 19:54:59,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:54:59,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308056531] [2020-02-10 19:54:59,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:54:59,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:00,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:00,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308056531] [2020-02-10 19:55:00,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:00,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:55:00,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880812723] [2020-02-10 19:55:00,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:55:00,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:00,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:55:00,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:00,107 INFO L87 Difference]: Start difference. First operand 1585 states and 7072 transitions. Second operand 11 states. [2020-02-10 19:55:00,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:00,279 INFO L93 Difference]: Finished difference Result 2987 states and 11773 transitions. [2020-02-10 19:55:00,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:55:00,280 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:55:00,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:00,287 INFO L225 Difference]: With dead ends: 2987 [2020-02-10 19:55:00,287 INFO L226 Difference]: Without dead ends: 2956 [2020-02-10 19:55:00,287 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:55:00,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2020-02-10 19:55:00,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 1571. [2020-02-10 19:55:00,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 19:55:00,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7041 transitions. [2020-02-10 19:55:00,355 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7041 transitions. Word has length 28 [2020-02-10 19:55:00,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:00,355 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7041 transitions. [2020-02-10 19:55:00,355 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:55:00,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7041 transitions. [2020-02-10 19:55:00,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:55:00,357 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:00,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] [2020-02-10 19:55:00,358 INFO L427 AbstractCegarLoop]: === Iteration 813 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:00,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:00,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1242334026, now seen corresponding path program 805 times [2020-02-10 19:55:00,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:00,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575142319] [2020-02-10 19:55:00,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:00,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:00,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:00,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575142319] [2020-02-10 19:55:00,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:00,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:55:00,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014667854] [2020-02-10 19:55:00,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:55:00,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:00,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:55:00,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:00,895 INFO L87 Difference]: Start difference. First operand 1571 states and 7041 transitions. Second operand 11 states. [2020-02-10 19:55:01,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:01,074 INFO L93 Difference]: Finished difference Result 2973 states and 11757 transitions. [2020-02-10 19:55:01,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:55:01,075 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:55:01,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:01,082 INFO L225 Difference]: With dead ends: 2973 [2020-02-10 19:55:01,083 INFO L226 Difference]: Without dead ends: 2958 [2020-02-10 19:55:01,083 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:55:01,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2958 states. [2020-02-10 19:55:01,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2958 to 1581. [2020-02-10 19:55:01,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 19:55:01,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7069 transitions. [2020-02-10 19:55:01,151 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7069 transitions. Word has length 28 [2020-02-10 19:55:01,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:01,151 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7069 transitions. [2020-02-10 19:55:01,151 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:55:01,151 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7069 transitions. [2020-02-10 19:55:01,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:55:01,153 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:01,153 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:01,153 INFO L427 AbstractCegarLoop]: === Iteration 814 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:01,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:01,154 INFO L82 PathProgramCache]: Analyzing trace with hash -818525776, now seen corresponding path program 806 times [2020-02-10 19:55:01,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:01,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724398146] [2020-02-10 19:55:01,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:01,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:01,503 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 25 [2020-02-10 19:55:01,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 19:55:01,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724398146] [2020-02-10 19:55:01,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:01,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:55:01,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373141902] [2020-02-10 19:55:01,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:55:01,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:01,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:55:01,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:01,734 INFO L87 Difference]: Start difference. First operand 1581 states and 7069 transitions. Second operand 11 states. [2020-02-10 19:55:01,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:01,945 INFO L93 Difference]: Finished difference Result 2976 states and 11758 transitions. [2020-02-10 19:55:01,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:55:01,945 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:55:01,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:01,952 INFO L225 Difference]: With dead ends: 2976 [2020-02-10 19:55:01,952 INFO L226 Difference]: Without dead ends: 2953 [2020-02-10 19:55:01,952 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:55:01,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2953 states. [2020-02-10 19:55:02,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2953 to 1576. [2020-02-10 19:55:02,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 19:55:02,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7055 transitions. [2020-02-10 19:55:02,021 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7055 transitions. Word has length 28 [2020-02-10 19:55:02,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:02,021 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7055 transitions. [2020-02-10 19:55:02,021 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:55:02,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7055 transitions. [2020-02-10 19:55:02,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:55:02,023 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:02,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] [2020-02-10 19:55:02,024 INFO L427 AbstractCegarLoop]: === Iteration 815 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:02,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:02,024 INFO L82 PathProgramCache]: Analyzing trace with hash 707104224, now seen corresponding path program 807 times [2020-02-10 19:55:02,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:02,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652286217] [2020-02-10 19:55:02,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:02,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:02,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 19:55:02,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652286217] [2020-02-10 19:55:02,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:02,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:55:02,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263761064] [2020-02-10 19:55:02,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:55:02,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:02,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:55:02,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:02,550 INFO L87 Difference]: Start difference. First operand 1576 states and 7055 transitions. Second operand 11 states. [2020-02-10 19:55:02,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:02,741 INFO L93 Difference]: Finished difference Result 2972 states and 11750 transitions. [2020-02-10 19:55:02,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:55:02,741 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:55:02,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:02,748 INFO L225 Difference]: With dead ends: 2972 [2020-02-10 19:55:02,749 INFO L226 Difference]: Without dead ends: 2957 [2020-02-10 19:55:02,749 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:55:02,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2957 states. [2020-02-10 19:55:02,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2957 to 1581. [2020-02-10 19:55:02,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 19:55:02,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7064 transitions. [2020-02-10 19:55:02,816 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7064 transitions. Word has length 28 [2020-02-10 19:55:02,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:02,816 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7064 transitions. [2020-02-10 19:55:02,817 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:55:02,817 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7064 transitions. [2020-02-10 19:55:02,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:55:02,819 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:02,819 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:02,819 INFO L427 AbstractCegarLoop]: === Iteration 816 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:02,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:02,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1925210384, now seen corresponding path program 808 times [2020-02-10 19:55:02,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:02,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297111083] [2020-02-10 19:55:02,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:02,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:03,337 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 30 [2020-02-10 19:55:03,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:03,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297111083] [2020-02-10 19:55:03,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:03,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:55:03,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68748729] [2020-02-10 19:55:03,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:55:03,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:03,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:55:03,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:03,346 INFO L87 Difference]: Start difference. First operand 1581 states and 7064 transitions. Second operand 11 states. [2020-02-10 19:55:03,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:03,560 INFO L93 Difference]: Finished difference Result 2974 states and 11749 transitions. [2020-02-10 19:55:03,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:55:03,561 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:55:03,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:03,568 INFO L225 Difference]: With dead ends: 2974 [2020-02-10 19:55:03,568 INFO L226 Difference]: Without dead ends: 2952 [2020-02-10 19:55:03,569 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:55:03,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2952 states. [2020-02-10 19:55:03,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2952 to 1576. [2020-02-10 19:55:03,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 19:55:03,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7050 transitions. [2020-02-10 19:55:03,637 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7050 transitions. Word has length 28 [2020-02-10 19:55:03,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:03,637 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7050 transitions. [2020-02-10 19:55:03,637 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:55:03,637 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7050 transitions. [2020-02-10 19:55:03,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:55:03,639 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:03,639 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:03,640 INFO L427 AbstractCegarLoop]: === Iteration 817 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:03,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:03,640 INFO L82 PathProgramCache]: Analyzing trace with hash -815900000, now seen corresponding path program 809 times [2020-02-10 19:55:03,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:03,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931343114] [2020-02-10 19:55:03,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:03,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:04,160 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 19:55:04,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 19:55:04,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931343114] [2020-02-10 19:55:04,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:04,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:55:04,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825651469] [2020-02-10 19:55:04,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:55:04,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:04,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:55:04,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:04,168 INFO L87 Difference]: Start difference. First operand 1576 states and 7050 transitions. Second operand 11 states. [2020-02-10 19:55:04,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:04,395 INFO L93 Difference]: Finished difference Result 2980 states and 11763 transitions. [2020-02-10 19:55:04,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:55:04,396 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:55:04,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:04,403 INFO L225 Difference]: With dead ends: 2980 [2020-02-10 19:55:04,403 INFO L226 Difference]: Without dead ends: 2962 [2020-02-10 19:55:04,403 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:55:04,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2962 states. [2020-02-10 19:55:04,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2962 to 1583. [2020-02-10 19:55:04,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 19:55:04,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7063 transitions. [2020-02-10 19:55:04,482 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7063 transitions. Word has length 28 [2020-02-10 19:55:04,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:04,482 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7063 transitions. [2020-02-10 19:55:04,482 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:55:04,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7063 transitions. [2020-02-10 19:55:04,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:55:04,484 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:04,485 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:04,485 INFO L427 AbstractCegarLoop]: === Iteration 818 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:04,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:04,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1387354806, now seen corresponding path program 810 times [2020-02-10 19:55:04,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:04,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958029745] [2020-02-10 19:55:04,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:04,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:05,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:05,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958029745] [2020-02-10 19:55:05,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:05,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:55:05,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44217413] [2020-02-10 19:55:05,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:55:05,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:05,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:55:05,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:05,024 INFO L87 Difference]: Start difference. First operand 1583 states and 7063 transitions. Second operand 11 states. [2020-02-10 19:55:05,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:05,285 INFO L93 Difference]: Finished difference Result 2979 states and 11754 transitions. [2020-02-10 19:55:05,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:55:05,285 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:55:05,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:05,292 INFO L225 Difference]: With dead ends: 2979 [2020-02-10 19:55:05,292 INFO L226 Difference]: Without dead ends: 2950 [2020-02-10 19:55:05,292 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:55:05,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2020-02-10 19:55:05,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 1571. [2020-02-10 19:55:05,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 19:55:05,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7036 transitions. [2020-02-10 19:55:05,360 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7036 transitions. Word has length 28 [2020-02-10 19:55:05,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:05,361 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7036 transitions. [2020-02-10 19:55:05,361 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:55:05,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7036 transitions. [2020-02-10 19:55:05,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:55:05,363 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:05,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] [2020-02-10 19:55:05,363 INFO L427 AbstractCegarLoop]: === Iteration 819 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:05,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:05,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1542222066, now seen corresponding path program 811 times [2020-02-10 19:55:05,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:05,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859508348] [2020-02-10 19:55:05,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:05,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:05,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 19:55:05,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859508348] [2020-02-10 19:55:05,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:05,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:55:05,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501428719] [2020-02-10 19:55:05,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:55:05,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:05,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:55:05,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:05,924 INFO L87 Difference]: Start difference. First operand 1571 states and 7036 transitions. Second operand 11 states. [2020-02-10 19:55:06,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:06,116 INFO L93 Difference]: Finished difference Result 3006 states and 11825 transitions. [2020-02-10 19:55:06,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:55:06,117 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:55:06,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:06,124 INFO L225 Difference]: With dead ends: 3006 [2020-02-10 19:55:06,124 INFO L226 Difference]: Without dead ends: 2986 [2020-02-10 19:55:06,124 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:55:06,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2986 states. [2020-02-10 19:55:06,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2986 to 1591. [2020-02-10 19:55:06,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1591 states. [2020-02-10 19:55:06,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1591 states and 7086 transitions. [2020-02-10 19:55:06,202 INFO L78 Accepts]: Start accepts. Automaton has 1591 states and 7086 transitions. Word has length 28 [2020-02-10 19:55:06,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:06,202 INFO L479 AbstractCegarLoop]: Abstraction has 1591 states and 7086 transitions. [2020-02-10 19:55:06,202 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:55:06,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1591 states and 7086 transitions. [2020-02-10 19:55:06,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:55:06,204 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:06,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] [2020-02-10 19:55:06,205 INFO L427 AbstractCegarLoop]: === Iteration 820 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:06,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:06,205 INFO L82 PathProgramCache]: Analyzing trace with hash -797519568, now seen corresponding path program 812 times [2020-02-10 19:55:06,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:06,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845722047] [2020-02-10 19:55:06,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:06,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:06,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 19:55:06,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845722047] [2020-02-10 19:55:06,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:06,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:55:06,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682277013] [2020-02-10 19:55:06,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:55:06,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:06,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:55:06,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:06,756 INFO L87 Difference]: Start difference. First operand 1591 states and 7086 transitions. Second operand 11 states. [2020-02-10 19:55:07,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:07,019 INFO L93 Difference]: Finished difference Result 3004 states and 11813 transitions. [2020-02-10 19:55:07,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:55:07,019 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:55:07,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:07,026 INFO L225 Difference]: With dead ends: 3004 [2020-02-10 19:55:07,026 INFO L226 Difference]: Without dead ends: 2976 [2020-02-10 19:55:07,026 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:55:07,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2976 states. [2020-02-10 19:55:07,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2976 to 1581. [2020-02-10 19:55:07,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 19:55:07,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7060 transitions. [2020-02-10 19:55:07,093 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7060 transitions. Word has length 28 [2020-02-10 19:55:07,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:07,094 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7060 transitions. [2020-02-10 19:55:07,094 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:55:07,094 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7060 transitions. [2020-02-10 19:55:07,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:55:07,096 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:07,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] [2020-02-10 19:55:07,096 INFO L427 AbstractCegarLoop]: === Iteration 821 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:07,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:07,096 INFO L82 PathProgramCache]: Analyzing trace with hash -2077451868, now seen corresponding path program 813 times [2020-02-10 19:55:07,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:07,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853560167] [2020-02-10 19:55:07,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:07,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:07,550 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 29 [2020-02-10 19:55:07,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:07,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853560167] [2020-02-10 19:55:07,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:07,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:55:07,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480325263] [2020-02-10 19:55:07,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:55:07,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:07,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:55:07,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:07,671 INFO L87 Difference]: Start difference. First operand 1581 states and 7060 transitions. Second operand 11 states. [2020-02-10 19:55:07,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:07,841 INFO L93 Difference]: Finished difference Result 3003 states and 11810 transitions. [2020-02-10 19:55:07,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:55:07,842 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:55:07,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:07,849 INFO L225 Difference]: With dead ends: 3003 [2020-02-10 19:55:07,849 INFO L226 Difference]: Without dead ends: 2983 [2020-02-10 19:55:07,849 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:55:07,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2983 states. [2020-02-10 19:55:07,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2983 to 1589. [2020-02-10 19:55:07,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1589 states. [2020-02-10 19:55:07,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1589 states and 7074 transitions. [2020-02-10 19:55:07,917 INFO L78 Accepts]: Start accepts. Automaton has 1589 states and 7074 transitions. Word has length 28 [2020-02-10 19:55:07,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:07,917 INFO L479 AbstractCegarLoop]: Abstraction has 1589 states and 7074 transitions. [2020-02-10 19:55:07,917 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:55:07,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 7074 transitions. [2020-02-10 19:55:07,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:55:07,919 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:07,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] [2020-02-10 19:55:07,920 INFO L427 AbstractCegarLoop]: === Iteration 822 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:07,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:07,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1904204176, now seen corresponding path program 814 times [2020-02-10 19:55:07,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:07,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097499217] [2020-02-10 19:55:07,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:07,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:08,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:08,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097499217] [2020-02-10 19:55:08,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:08,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:55:08,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920533247] [2020-02-10 19:55:08,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:55:08,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:08,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:55:08,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:08,453 INFO L87 Difference]: Start difference. First operand 1589 states and 7074 transitions. Second operand 11 states. [2020-02-10 19:55:08,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:08,647 INFO L93 Difference]: Finished difference Result 3000 states and 11797 transitions. [2020-02-10 19:55:08,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:55:08,648 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:55:08,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:08,655 INFO L225 Difference]: With dead ends: 3000 [2020-02-10 19:55:08,655 INFO L226 Difference]: Without dead ends: 2975 [2020-02-10 19:55:08,655 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:55:08,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2975 states. [2020-02-10 19:55:08,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2975 to 1581. [2020-02-10 19:55:08,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 19:55:08,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7052 transitions. [2020-02-10 19:55:08,722 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7052 transitions. Word has length 28 [2020-02-10 19:55:08,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:08,722 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7052 transitions. [2020-02-10 19:55:08,722 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:55:08,723 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7052 transitions. [2020-02-10 19:55:08,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:55:08,725 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:08,725 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:08,725 INFO L427 AbstractCegarLoop]: === Iteration 823 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:08,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:08,725 INFO L82 PathProgramCache]: Analyzing trace with hash 278191588, now seen corresponding path program 815 times [2020-02-10 19:55:08,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:08,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048463538] [2020-02-10 19:55:08,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:08,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:09,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:09,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048463538] [2020-02-10 19:55:09,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:09,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:55:09,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687132572] [2020-02-10 19:55:09,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:55:09,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:09,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:55:09,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:09,258 INFO L87 Difference]: Start difference. First operand 1581 states and 7052 transitions. Second operand 11 states. [2020-02-10 19:55:09,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:09,457 INFO L93 Difference]: Finished difference Result 2998 states and 11794 transitions. [2020-02-10 19:55:09,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:55:09,457 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:55:09,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:09,464 INFO L225 Difference]: With dead ends: 2998 [2020-02-10 19:55:09,464 INFO L226 Difference]: Without dead ends: 2980 [2020-02-10 19:55:09,464 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:55:09,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2980 states. [2020-02-10 19:55:09,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2980 to 1588. [2020-02-10 19:55:09,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1588 states. [2020-02-10 19:55:09,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 7065 transitions. [2020-02-10 19:55:09,532 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 7065 transitions. Word has length 28 [2020-02-10 19:55:09,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:09,532 INFO L479 AbstractCegarLoop]: Abstraction has 1588 states and 7065 transitions. [2020-02-10 19:55:09,532 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:55:09,532 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 7065 transitions. [2020-02-10 19:55:09,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:55:09,534 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:09,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] [2020-02-10 19:55:09,535 INFO L427 AbstractCegarLoop]: === Iteration 824 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:09,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:09,535 INFO L82 PathProgramCache]: Analyzing trace with hash -293263218, now seen corresponding path program 816 times [2020-02-10 19:55:09,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:09,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249439708] [2020-02-10 19:55:09,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:09,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:10,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:10,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249439708] [2020-02-10 19:55:10,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:10,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:55:10,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832814199] [2020-02-10 19:55:10,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:55:10,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:10,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:55:10,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:10,073 INFO L87 Difference]: Start difference. First operand 1588 states and 7065 transitions. Second operand 11 states. [2020-02-10 19:55:10,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:10,345 INFO L93 Difference]: Finished difference Result 2997 states and 11785 transitions. [2020-02-10 19:55:10,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:55:10,345 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:55:10,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:10,352 INFO L225 Difference]: With dead ends: 2997 [2020-02-10 19:55:10,352 INFO L226 Difference]: Without dead ends: 2955 [2020-02-10 19:55:10,352 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:55:10,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2955 states. [2020-02-10 19:55:10,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2955 to 1563. [2020-02-10 19:55:10,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2020-02-10 19:55:10,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 7013 transitions. [2020-02-10 19:55:10,419 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 7013 transitions. Word has length 28 [2020-02-10 19:55:10,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:10,420 INFO L479 AbstractCegarLoop]: Abstraction has 1563 states and 7013 transitions. [2020-02-10 19:55:10,420 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:55:10,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 7013 transitions. [2020-02-10 19:55:10,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:55:10,422 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:10,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] [2020-02-10 19:55:10,422 INFO L427 AbstractCegarLoop]: === Iteration 825 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:10,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:10,422 INFO L82 PathProgramCache]: Analyzing trace with hash -969642016, now seen corresponding path program 817 times [2020-02-10 19:55:10,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:10,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272147472] [2020-02-10 19:55:10,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:10,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:10,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:10,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272147472] [2020-02-10 19:55:10,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:10,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:55:10,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643487655] [2020-02-10 19:55:10,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:55:10,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:10,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:55:10,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:10,962 INFO L87 Difference]: Start difference. First operand 1563 states and 7013 transitions. Second operand 11 states. [2020-02-10 19:55:11,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:11,139 INFO L93 Difference]: Finished difference Result 3001 states and 11833 transitions. [2020-02-10 19:55:11,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:55:11,139 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:55:11,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:11,147 INFO L225 Difference]: With dead ends: 3001 [2020-02-10 19:55:11,147 INFO L226 Difference]: Without dead ends: 2985 [2020-02-10 19:55:11,147 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:55:11,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2985 states. [2020-02-10 19:55:11,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2985 to 1588. [2020-02-10 19:55:11,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1588 states. [2020-02-10 19:55:11,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 7093 transitions. [2020-02-10 19:55:11,215 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 7093 transitions. Word has length 28 [2020-02-10 19:55:11,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:11,215 INFO L479 AbstractCegarLoop]: Abstraction has 1588 states and 7093 transitions. [2020-02-10 19:55:11,215 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:55:11,215 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 7093 transitions. [2020-02-10 19:55:11,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:55:11,217 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:11,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] [2020-02-10 19:55:11,218 INFO L427 AbstractCegarLoop]: === Iteration 826 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:11,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:11,218 INFO L82 PathProgramCache]: Analyzing trace with hash -224939518, now seen corresponding path program 818 times [2020-02-10 19:55:11,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:11,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131596886] [2020-02-10 19:55:11,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:11,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:11,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:11,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131596886] [2020-02-10 19:55:11,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:11,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:55:11,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607118388] [2020-02-10 19:55:11,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:55:11,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:11,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:55:11,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:11,767 INFO L87 Difference]: Start difference. First operand 1588 states and 7093 transitions. Second operand 11 states. [2020-02-10 19:55:11,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:11,905 INFO L93 Difference]: Finished difference Result 3005 states and 11834 transitions. [2020-02-10 19:55:11,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:55:11,906 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:55:11,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:11,913 INFO L225 Difference]: With dead ends: 3005 [2020-02-10 19:55:11,913 INFO L226 Difference]: Without dead ends: 2978 [2020-02-10 19:55:11,913 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:55:11,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2978 states. [2020-02-10 19:55:11,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2978 to 1581. [2020-02-10 19:55:11,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 19:55:11,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7073 transitions. [2020-02-10 19:55:11,981 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7073 transitions. Word has length 28 [2020-02-10 19:55:11,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:11,981 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7073 transitions. [2020-02-10 19:55:11,981 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:55:11,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7073 transitions. [2020-02-10 19:55:11,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:55:11,984 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:11,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] [2020-02-10 19:55:11,984 INFO L427 AbstractCegarLoop]: === Iteration 827 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:11,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:11,984 INFO L82 PathProgramCache]: Analyzing trace with hash 641298942, now seen corresponding path program 819 times [2020-02-10 19:55:11,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:11,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850287562] [2020-02-10 19:55:11,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:11,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:12,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 19:55:12,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850287562] [2020-02-10 19:55:12,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:12,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:55:12,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855707198] [2020-02-10 19:55:12,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:55:12,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:12,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:55:12,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:12,515 INFO L87 Difference]: Start difference. First operand 1581 states and 7073 transitions. Second operand 11 states. [2020-02-10 19:55:12,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:12,685 INFO L93 Difference]: Finished difference Result 2998 states and 11821 transitions. [2020-02-10 19:55:12,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:55:12,685 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:55:12,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:12,693 INFO L225 Difference]: With dead ends: 2998 [2020-02-10 19:55:12,693 INFO L226 Difference]: Without dead ends: 2982 [2020-02-10 19:55:12,693 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:55:12,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2982 states. [2020-02-10 19:55:12,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2982 to 1587. [2020-02-10 19:55:12,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1587 states. [2020-02-10 19:55:12,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 7084 transitions. [2020-02-10 19:55:12,761 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 7084 transitions. Word has length 28 [2020-02-10 19:55:12,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:12,761 INFO L479 AbstractCegarLoop]: Abstraction has 1587 states and 7084 transitions. [2020-02-10 19:55:12,761 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:55:12,761 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 7084 transitions. [2020-02-10 19:55:12,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:55:12,764 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:12,764 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:12,764 INFO L427 AbstractCegarLoop]: === Iteration 828 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:12,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:12,764 INFO L82 PathProgramCache]: Analyzing trace with hash 2130703938, now seen corresponding path program 820 times [2020-02-10 19:55:12,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:12,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796602608] [2020-02-10 19:55:12,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:12,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:13,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 19:55:13,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796602608] [2020-02-10 19:55:13,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:13,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:55:13,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850580278] [2020-02-10 19:55:13,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:55:13,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:13,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:55:13,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:13,296 INFO L87 Difference]: Start difference. First operand 1587 states and 7084 transitions. Second operand 11 states. [2020-02-10 19:55:13,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:13,515 INFO L93 Difference]: Finished difference Result 3000 states and 11819 transitions. [2020-02-10 19:55:13,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:55:13,516 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:55:13,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:13,523 INFO L225 Difference]: With dead ends: 3000 [2020-02-10 19:55:13,524 INFO L226 Difference]: Without dead ends: 2976 [2020-02-10 19:55:13,524 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:55:13,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2976 states. [2020-02-10 19:55:13,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2976 to 1581. [2020-02-10 19:55:13,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2020-02-10 19:55:13,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 7067 transitions. [2020-02-10 19:55:13,591 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 7067 transitions. Word has length 28 [2020-02-10 19:55:13,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:13,591 INFO L479 AbstractCegarLoop]: Abstraction has 1581 states and 7067 transitions. [2020-02-10 19:55:13,591 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:55:13,591 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 7067 transitions. [2020-02-10 19:55:13,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:55:13,594 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:13,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] [2020-02-10 19:55:13,594 INFO L427 AbstractCegarLoop]: === Iteration 829 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:13,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:13,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1298024898, now seen corresponding path program 821 times [2020-02-10 19:55:13,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:13,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529609762] [2020-02-10 19:55:13,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:13,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:14,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:14,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529609762] [2020-02-10 19:55:14,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:14,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:55:14,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207209479] [2020-02-10 19:55:14,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:55:14,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:14,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:55:14,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:14,148 INFO L87 Difference]: Start difference. First operand 1581 states and 7067 transitions. Second operand 11 states. [2020-02-10 19:55:14,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:14,276 INFO L93 Difference]: Finished difference Result 3010 states and 11838 transitions. [2020-02-10 19:55:14,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:55:14,277 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:55:14,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:14,284 INFO L225 Difference]: With dead ends: 3010 [2020-02-10 19:55:14,284 INFO L226 Difference]: Without dead ends: 2990 [2020-02-10 19:55:14,284 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:55:14,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2990 states. [2020-02-10 19:55:14,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2990 to 1591. [2020-02-10 19:55:14,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1591 states. [2020-02-10 19:55:14,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1591 states and 7084 transitions. [2020-02-10 19:55:14,352 INFO L78 Accepts]: Start accepts. Automaton has 1591 states and 7084 transitions. Word has length 28 [2020-02-10 19:55:14,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:14,352 INFO L479 AbstractCegarLoop]: Abstraction has 1591 states and 7084 transitions. [2020-02-10 19:55:14,352 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:55:14,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1591 states and 7084 transitions. [2020-02-10 19:55:14,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:55:14,354 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:14,354 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:14,354 INFO L427 AbstractCegarLoop]: === Iteration 830 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:14,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:14,355 INFO L82 PathProgramCache]: Analyzing trace with hash -553322400, now seen corresponding path program 822 times [2020-02-10 19:55:14,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:14,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455421351] [2020-02-10 19:55:14,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:14,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:14,916 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 19:55:14,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 19:55:14,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455421351] [2020-02-10 19:55:14,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:14,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:55:14,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913339976] [2020-02-10 19:55:14,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:55:14,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:14,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:55:14,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:14,924 INFO L87 Difference]: Start difference. First operand 1591 states and 7084 transitions. Second operand 11 states. [2020-02-10 19:55:15,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:15,090 INFO L93 Difference]: Finished difference Result 3008 states and 11826 transitions. [2020-02-10 19:55:15,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:55:15,091 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:55:15,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:15,098 INFO L225 Difference]: With dead ends: 3008 [2020-02-10 19:55:15,098 INFO L226 Difference]: Without dead ends: 2972 [2020-02-10 19:55:15,098 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:55:15,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2972 states. [2020-02-10 19:55:15,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2972 to 1573. [2020-02-10 19:55:15,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 19:55:15,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7044 transitions. [2020-02-10 19:55:15,165 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7044 transitions. Word has length 28 [2020-02-10 19:55:15,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:15,165 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7044 transitions. [2020-02-10 19:55:15,165 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:55:15,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7044 transitions. [2020-02-10 19:55:15,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:55:15,168 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:15,168 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:15,168 INFO L427 AbstractCegarLoop]: === Iteration 831 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:15,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:15,168 INFO L82 PathProgramCache]: Analyzing trace with hash -381896694, now seen corresponding path program 823 times [2020-02-10 19:55:15,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:15,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756353435] [2020-02-10 19:55:15,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:15,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:15,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 19:55:15,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756353435] [2020-02-10 19:55:15,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:15,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:55:15,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040929335] [2020-02-10 19:55:15,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:55:15,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:15,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:55:15,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:15,695 INFO L87 Difference]: Start difference. First operand 1573 states and 7044 transitions. Second operand 11 states. [2020-02-10 19:55:15,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:15,875 INFO L93 Difference]: Finished difference Result 2997 states and 11817 transitions. [2020-02-10 19:55:15,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:55:15,875 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:55:15,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:15,882 INFO L225 Difference]: With dead ends: 2997 [2020-02-10 19:55:15,883 INFO L226 Difference]: Without dead ends: 2981 [2020-02-10 19:55:15,883 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:55:15,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2981 states. [2020-02-10 19:55:15,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2981 to 1587. [2020-02-10 19:55:15,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1587 states. [2020-02-10 19:55:15,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 7083 transitions. [2020-02-10 19:55:15,950 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 7083 transitions. Word has length 28 [2020-02-10 19:55:15,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:15,950 INFO L479 AbstractCegarLoop]: Abstraction has 1587 states and 7083 transitions. [2020-02-10 19:55:15,950 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:55:15,950 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 7083 transitions. [2020-02-10 19:55:15,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:55:15,952 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:15,952 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:15,953 INFO L427 AbstractCegarLoop]: === Iteration 832 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:15,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:15,953 INFO L82 PathProgramCache]: Analyzing trace with hash 362805804, now seen corresponding path program 824 times [2020-02-10 19:55:15,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:15,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027409693] [2020-02-10 19:55:15,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:15,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:16,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:16,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027409693] [2020-02-10 19:55:16,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:16,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:55:16,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940948816] [2020-02-10 19:55:16,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:55:16,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:16,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:55:16,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:16,498 INFO L87 Difference]: Start difference. First operand 1587 states and 7083 transitions. Second operand 11 states. [2020-02-10 19:55:16,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:16,630 INFO L93 Difference]: Finished difference Result 3001 states and 11818 transitions. [2020-02-10 19:55:16,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:55:16,630 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:55:16,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:16,637 INFO L225 Difference]: With dead ends: 3001 [2020-02-10 19:55:16,637 INFO L226 Difference]: Without dead ends: 2974 [2020-02-10 19:55:16,637 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:55:16,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2974 states. [2020-02-10 19:55:16,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2974 to 1580. [2020-02-10 19:55:16,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 19:55:16,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7063 transitions. [2020-02-10 19:55:16,705 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7063 transitions. Word has length 28 [2020-02-10 19:55:16,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:16,706 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7063 transitions. [2020-02-10 19:55:16,706 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:55:16,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7063 transitions. [2020-02-10 19:55:16,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:55:16,708 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:16,708 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:16,708 INFO L427 AbstractCegarLoop]: === Iteration 833 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:16,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:16,708 INFO L82 PathProgramCache]: Analyzing trace with hash 693814462, now seen corresponding path program 825 times [2020-02-10 19:55:16,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:16,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047237262] [2020-02-10 19:55:16,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:16,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:17,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 19:55:17,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047237262] [2020-02-10 19:55:17,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:17,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:55:17,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807258442] [2020-02-10 19:55:17,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:55:17,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:17,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:55:17,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:17,243 INFO L87 Difference]: Start difference. First operand 1580 states and 7063 transitions. Second operand 11 states. [2020-02-10 19:55:17,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:17,404 INFO L93 Difference]: Finished difference Result 2993 states and 11803 transitions. [2020-02-10 19:55:17,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:55:17,405 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:55:17,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:17,413 INFO L225 Difference]: With dead ends: 2993 [2020-02-10 19:55:17,413 INFO L226 Difference]: Without dead ends: 2977 [2020-02-10 19:55:17,413 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:55:17,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2977 states. [2020-02-10 19:55:17,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2977 to 1586. [2020-02-10 19:55:17,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1586 states. [2020-02-10 19:55:17,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1586 states and 7074 transitions. [2020-02-10 19:55:17,481 INFO L78 Accepts]: Start accepts. Automaton has 1586 states and 7074 transitions. Word has length 28 [2020-02-10 19:55:17,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:17,482 INFO L479 AbstractCegarLoop]: Abstraction has 1586 states and 7074 transitions. [2020-02-10 19:55:17,482 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:55:17,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1586 states and 7074 transitions. [2020-02-10 19:55:17,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:55:17,484 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:17,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] [2020-02-10 19:55:17,484 INFO L427 AbstractCegarLoop]: === Iteration 834 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:17,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:17,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1611764652, now seen corresponding path program 826 times [2020-02-10 19:55:17,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:17,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200462291] [2020-02-10 19:55:17,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:17,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:18,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:18,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200462291] [2020-02-10 19:55:18,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:18,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:55:18,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694986425] [2020-02-10 19:55:18,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:55:18,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:18,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:55:18,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:18,024 INFO L87 Difference]: Start difference. First operand 1586 states and 7074 transitions. Second operand 11 states. [2020-02-10 19:55:18,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:18,192 INFO L93 Difference]: Finished difference Result 2994 states and 11799 transitions. [2020-02-10 19:55:18,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:55:18,192 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:55:18,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:18,199 INFO L225 Difference]: With dead ends: 2994 [2020-02-10 19:55:18,200 INFO L226 Difference]: Without dead ends: 2971 [2020-02-10 19:55:18,200 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:55:18,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2971 states. [2020-02-10 19:55:18,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2971 to 1580. [2020-02-10 19:55:18,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 19:55:18,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7057 transitions. [2020-02-10 19:55:18,267 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7057 transitions. Word has length 28 [2020-02-10 19:55:18,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:18,267 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7057 transitions. [2020-02-10 19:55:18,267 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:55:18,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7057 transitions. [2020-02-10 19:55:18,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:55:18,270 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:18,270 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:18,270 INFO L427 AbstractCegarLoop]: === Iteration 835 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:18,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:18,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1245509378, now seen corresponding path program 827 times [2020-02-10 19:55:18,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:18,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875188823] [2020-02-10 19:55:18,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:18,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:18,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:18,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875188823] [2020-02-10 19:55:18,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:18,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:55:18,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81676922] [2020-02-10 19:55:18,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:55:18,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:18,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:55:18,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:18,812 INFO L87 Difference]: Start difference. First operand 1580 states and 7057 transitions. Second operand 11 states. [2020-02-10 19:55:18,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:18,958 INFO L93 Difference]: Finished difference Result 3003 states and 11816 transitions. [2020-02-10 19:55:18,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:55:18,958 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:55:18,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:18,965 INFO L225 Difference]: With dead ends: 3003 [2020-02-10 19:55:18,966 INFO L226 Difference]: Without dead ends: 2983 [2020-02-10 19:55:18,966 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:55:19,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2983 states. [2020-02-10 19:55:19,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2983 to 1588. [2020-02-10 19:55:19,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1588 states. [2020-02-10 19:55:19,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 7071 transitions. [2020-02-10 19:55:19,033 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 7071 transitions. Word has length 28 [2020-02-10 19:55:19,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:19,033 INFO L479 AbstractCegarLoop]: Abstraction has 1588 states and 7071 transitions. [2020-02-10 19:55:19,033 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:55:19,033 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 7071 transitions. [2020-02-10 19:55:19,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:55:19,035 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:19,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] [2020-02-10 19:55:19,035 INFO L427 AbstractCegarLoop]: === Iteration 836 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:19,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:19,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1072261686, now seen corresponding path program 828 times [2020-02-10 19:55:19,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:19,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436715676] [2020-02-10 19:55:19,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:19,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:19,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 19:55:19,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436715676] [2020-02-10 19:55:19,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:19,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:55:19,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751738253] [2020-02-10 19:55:19,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:55:19,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:19,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:55:19,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:19,620 INFO L87 Difference]: Start difference. First operand 1588 states and 7071 transitions. Second operand 11 states. [2020-02-10 19:55:19,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:19,822 INFO L93 Difference]: Finished difference Result 3000 states and 11803 transitions. [2020-02-10 19:55:19,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:55:19,822 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:55:19,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:19,830 INFO L225 Difference]: With dead ends: 3000 [2020-02-10 19:55:19,830 INFO L226 Difference]: Without dead ends: 2968 [2020-02-10 19:55:19,830 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:55:19,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2968 states. [2020-02-10 19:55:19,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2968 to 1573. [2020-02-10 19:55:19,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 19:55:19,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7037 transitions. [2020-02-10 19:55:19,898 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7037 transitions. Word has length 28 [2020-02-10 19:55:19,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:19,898 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7037 transitions. [2020-02-10 19:55:19,898 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:55:19,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7037 transitions. [2020-02-10 19:55:19,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:55:19,900 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:19,900 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:19,900 INFO L427 AbstractCegarLoop]: === Iteration 837 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:19,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:19,901 INFO L82 PathProgramCache]: Analyzing trace with hash -371393590, now seen corresponding path program 829 times [2020-02-10 19:55:19,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:19,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609346510] [2020-02-10 19:55:19,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:19,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:20,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 19:55:20,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609346510] [2020-02-10 19:55:20,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:20,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:55:20,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250780968] [2020-02-10 19:55:20,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:55:20,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:20,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:55:20,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:20,450 INFO L87 Difference]: Start difference. First operand 1573 states and 7037 transitions. Second operand 11 states. [2020-02-10 19:55:20,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:20,678 INFO L93 Difference]: Finished difference Result 2989 states and 11795 transitions. [2020-02-10 19:55:20,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:55:20,679 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:55:20,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:20,686 INFO L225 Difference]: With dead ends: 2989 [2020-02-10 19:55:20,687 INFO L226 Difference]: Without dead ends: 2973 [2020-02-10 19:55:20,687 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:55:20,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2973 states. [2020-02-10 19:55:20,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2973 to 1585. [2020-02-10 19:55:20,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1585 states. [2020-02-10 19:55:20,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 7071 transitions. [2020-02-10 19:55:20,755 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 7071 transitions. Word has length 28 [2020-02-10 19:55:20,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:20,755 INFO L479 AbstractCegarLoop]: Abstraction has 1585 states and 7071 transitions. [2020-02-10 19:55:20,756 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:55:20,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 7071 transitions. [2020-02-10 19:55:20,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:55:20,758 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:20,758 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:20,758 INFO L427 AbstractCegarLoop]: === Iteration 838 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:20,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:20,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1118011406, now seen corresponding path program 830 times [2020-02-10 19:55:20,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:20,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043751] [2020-02-10 19:55:20,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:20,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:21,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:21,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043751] [2020-02-10 19:55:21,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:21,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:55:21,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27577293] [2020-02-10 19:55:21,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:55:21,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:21,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:55:21,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:21,305 INFO L87 Difference]: Start difference. First operand 1585 states and 7071 transitions. Second operand 11 states. [2020-02-10 19:55:21,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:21,490 INFO L93 Difference]: Finished difference Result 2991 states and 11793 transitions. [2020-02-10 19:55:21,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:55:21,491 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:55:21,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:21,497 INFO L225 Difference]: With dead ends: 2991 [2020-02-10 19:55:21,497 INFO L226 Difference]: Without dead ends: 2967 [2020-02-10 19:55:21,498 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:55:21,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2967 states. [2020-02-10 19:55:21,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2967 to 1579. [2020-02-10 19:55:21,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 19:55:21,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7054 transitions. [2020-02-10 19:55:21,565 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7054 transitions. Word has length 28 [2020-02-10 19:55:21,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:21,565 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7054 transitions. [2020-02-10 19:55:21,565 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:55:21,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7054 transitions. [2020-02-10 19:55:21,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:55:21,567 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:21,568 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:21,568 INFO L427 AbstractCegarLoop]: === Iteration 839 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:21,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:21,568 INFO L82 PathProgramCache]: Analyzing trace with hash -906623392, now seen corresponding path program 831 times [2020-02-10 19:55:21,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:21,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855583620] [2020-02-10 19:55:21,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:21,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:22,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 19:55:22,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855583620] [2020-02-10 19:55:22,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:22,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:55:22,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456353555] [2020-02-10 19:55:22,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:55:22,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:22,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:55:22,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:22,110 INFO L87 Difference]: Start difference. First operand 1579 states and 7054 transitions. Second operand 11 states. [2020-02-10 19:55:22,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:22,288 INFO L93 Difference]: Finished difference Result 2988 states and 11787 transitions. [2020-02-10 19:55:22,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:55:22,288 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:55:22,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:22,296 INFO L225 Difference]: With dead ends: 2988 [2020-02-10 19:55:22,296 INFO L226 Difference]: Without dead ends: 2972 [2020-02-10 19:55:22,296 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:55:22,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2972 states. [2020-02-10 19:55:22,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2972 to 1585. [2020-02-10 19:55:22,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1585 states. [2020-02-10 19:55:22,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 7065 transitions. [2020-02-10 19:55:22,364 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 7065 transitions. Word has length 28 [2020-02-10 19:55:22,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:22,364 INFO L479 AbstractCegarLoop]: Abstraction has 1585 states and 7065 transitions. [2020-02-10 19:55:22,364 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:55:22,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 7065 transitions. [2020-02-10 19:55:22,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:55:22,366 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:22,366 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:22,366 INFO L427 AbstractCegarLoop]: === Iteration 840 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:22,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:22,367 INFO L82 PathProgramCache]: Analyzing trace with hash 11326798, now seen corresponding path program 832 times [2020-02-10 19:55:22,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:22,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070216695] [2020-02-10 19:55:22,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:22,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:22,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:22,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070216695] [2020-02-10 19:55:22,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:22,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:55:22,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249837644] [2020-02-10 19:55:22,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:55:22,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:22,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:55:22,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:22,910 INFO L87 Difference]: Start difference. First operand 1585 states and 7065 transitions. Second operand 11 states. [2020-02-10 19:55:23,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:23,084 INFO L93 Difference]: Finished difference Result 2989 states and 11783 transitions. [2020-02-10 19:55:23,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:55:23,085 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:55:23,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:23,093 INFO L225 Difference]: With dead ends: 2989 [2020-02-10 19:55:23,093 INFO L226 Difference]: Without dead ends: 2966 [2020-02-10 19:55:23,093 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:55:23,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2966 states. [2020-02-10 19:55:23,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2966 to 1579. [2020-02-10 19:55:23,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 19:55:23,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7048 transitions. [2020-02-10 19:55:23,161 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7048 transitions. Word has length 28 [2020-02-10 19:55:23,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:23,161 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7048 transitions. [2020-02-10 19:55:23,161 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:55:23,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7048 transitions. [2020-02-10 19:55:23,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:55:23,163 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:23,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] [2020-02-10 19:55:23,163 INFO L427 AbstractCegarLoop]: === Iteration 841 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:23,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:23,164 INFO L82 PathProgramCache]: Analyzing trace with hash -490303776, now seen corresponding path program 833 times [2020-02-10 19:55:23,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:23,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471311658] [2020-02-10 19:55:23,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:23,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:23,705 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 19:55:23,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:23,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471311658] [2020-02-10 19:55:23,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:23,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:55:23,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703533074] [2020-02-10 19:55:23,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:55:23,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:23,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:55:23,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:23,713 INFO L87 Difference]: Start difference. First operand 1579 states and 7048 transitions. Second operand 11 states. [2020-02-10 19:55:23,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:23,891 INFO L93 Difference]: Finished difference Result 2993 states and 11792 transitions. [2020-02-10 19:55:23,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:55:23,892 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:55:23,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:23,899 INFO L225 Difference]: With dead ends: 2993 [2020-02-10 19:55:23,900 INFO L226 Difference]: Without dead ends: 2975 [2020-02-10 19:55:23,900 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:55:23,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2975 states. [2020-02-10 19:55:23,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2975 to 1586. [2020-02-10 19:55:23,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1586 states. [2020-02-10 19:55:23,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1586 states and 7061 transitions. [2020-02-10 19:55:23,968 INFO L78 Accepts]: Start accepts. Automaton has 1586 states and 7061 transitions. Word has length 28 [2020-02-10 19:55:23,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:23,968 INFO L479 AbstractCegarLoop]: Abstraction has 1586 states and 7061 transitions. [2020-02-10 19:55:23,968 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:55:23,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1586 states and 7061 transitions. [2020-02-10 19:55:23,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:55:23,971 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:23,971 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:23,971 INFO L427 AbstractCegarLoop]: === Iteration 842 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:23,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:23,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1061758582, now seen corresponding path program 834 times [2020-02-10 19:55:23,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:23,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130894194] [2020-02-10 19:55:23,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:23,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:24,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:24,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130894194] [2020-02-10 19:55:24,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:24,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:55:24,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42468649] [2020-02-10 19:55:24,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:55:24,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:24,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:55:24,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:24,525 INFO L87 Difference]: Start difference. First operand 1586 states and 7061 transitions. Second operand 11 states. [2020-02-10 19:55:24,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:24,703 INFO L93 Difference]: Finished difference Result 2992 states and 11783 transitions. [2020-02-10 19:55:24,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:55:24,704 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:55:24,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:24,710 INFO L225 Difference]: With dead ends: 2992 [2020-02-10 19:55:24,710 INFO L226 Difference]: Without dead ends: 2962 [2020-02-10 19:55:24,711 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:55:24,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2962 states. [2020-02-10 19:55:24,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2962 to 1573. [2020-02-10 19:55:24,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 19:55:24,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7031 transitions. [2020-02-10 19:55:24,778 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7031 transitions. Word has length 28 [2020-02-10 19:55:24,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:24,778 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7031 transitions. [2020-02-10 19:55:24,778 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:55:24,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7031 transitions. [2020-02-10 19:55:24,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:55:24,781 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:24,781 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:24,781 INFO L427 AbstractCegarLoop]: === Iteration 843 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:24,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:24,781 INFO L82 PathProgramCache]: Analyzing trace with hash 383812012, now seen corresponding path program 835 times [2020-02-10 19:55:24,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:24,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150409973] [2020-02-10 19:55:24,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:24,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:25,250 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 31 [2020-02-10 19:55:25,367 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 31 [2020-02-10 19:55:25,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:25,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150409973] [2020-02-10 19:55:25,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:25,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:55:25,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308923616] [2020-02-10 19:55:25,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:55:25,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:25,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:55:25,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:25,376 INFO L87 Difference]: Start difference. First operand 1573 states and 7031 transitions. Second operand 11 states. [2020-02-10 19:55:25,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:25,546 INFO L93 Difference]: Finished difference Result 3015 states and 11843 transitions. [2020-02-10 19:55:25,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:55:25,546 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:55:25,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:25,553 INFO L225 Difference]: With dead ends: 3015 [2020-02-10 19:55:25,553 INFO L226 Difference]: Without dead ends: 2995 [2020-02-10 19:55:25,553 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:55:25,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2995 states. [2020-02-10 19:55:25,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2995 to 1593. [2020-02-10 19:55:25,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1593 states. [2020-02-10 19:55:25,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 7081 transitions. [2020-02-10 19:55:25,622 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 7081 transitions. Word has length 28 [2020-02-10 19:55:25,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:25,622 INFO L479 AbstractCegarLoop]: Abstraction has 1593 states and 7081 transitions. [2020-02-10 19:55:25,622 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:55:25,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 7081 transitions. [2020-02-10 19:55:25,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:55:25,624 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:25,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] [2020-02-10 19:55:25,624 INFO L427 AbstractCegarLoop]: === Iteration 844 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:25,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:25,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1128514510, now seen corresponding path program 836 times [2020-02-10 19:55:25,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:25,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662104145] [2020-02-10 19:55:25,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:25,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:26,167 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 32 [2020-02-10 19:55:26,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:26,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662104145] [2020-02-10 19:55:26,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:26,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:55:26,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619485394] [2020-02-10 19:55:26,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:55:26,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:26,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:55:26,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:26,175 INFO L87 Difference]: Start difference. First operand 1593 states and 7081 transitions. Second operand 11 states. [2020-02-10 19:55:26,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:26,354 INFO L93 Difference]: Finished difference Result 3013 states and 11831 transitions. [2020-02-10 19:55:26,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:55:26,354 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:55:26,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:26,361 INFO L225 Difference]: With dead ends: 3013 [2020-02-10 19:55:26,362 INFO L226 Difference]: Without dead ends: 2985 [2020-02-10 19:55:26,362 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:55:26,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2985 states. [2020-02-10 19:55:26,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2985 to 1583. [2020-02-10 19:55:26,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 19:55:26,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7055 transitions. [2020-02-10 19:55:26,440 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7055 transitions. Word has length 28 [2020-02-10 19:55:26,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:26,440 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7055 transitions. [2020-02-10 19:55:26,440 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:55:26,440 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7055 transitions. [2020-02-10 19:55:26,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:55:26,443 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:26,443 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:26,443 INFO L427 AbstractCegarLoop]: === Iteration 845 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:26,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:26,443 INFO L82 PathProgramCache]: Analyzing trace with hash -151417790, now seen corresponding path program 837 times [2020-02-10 19:55:26,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:26,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453897955] [2020-02-10 19:55:26,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:26,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:26,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 19:55:26,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453897955] [2020-02-10 19:55:26,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:26,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:55:26,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283579636] [2020-02-10 19:55:26,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:55:26,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:26,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:55:26,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:26,994 INFO L87 Difference]: Start difference. First operand 1583 states and 7055 transitions. Second operand 11 states. [2020-02-10 19:55:27,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:27,134 INFO L93 Difference]: Finished difference Result 3012 states and 11828 transitions. [2020-02-10 19:55:27,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:55:27,134 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:55:27,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:27,142 INFO L225 Difference]: With dead ends: 3012 [2020-02-10 19:55:27,142 INFO L226 Difference]: Without dead ends: 2992 [2020-02-10 19:55:27,142 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:55:27,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2992 states. [2020-02-10 19:55:27,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2992 to 1591. [2020-02-10 19:55:27,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1591 states. [2020-02-10 19:55:27,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1591 states and 7069 transitions. [2020-02-10 19:55:27,210 INFO L78 Accepts]: Start accepts. Automaton has 1591 states and 7069 transitions. Word has length 28 [2020-02-10 19:55:27,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:27,211 INFO L479 AbstractCegarLoop]: Abstraction has 1591 states and 7069 transitions. [2020-02-10 19:55:27,211 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:55:27,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1591 states and 7069 transitions. [2020-02-10 19:55:27,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:55:27,213 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:27,213 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:27,213 INFO L427 AbstractCegarLoop]: === Iteration 846 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:27,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:27,213 INFO L82 PathProgramCache]: Analyzing trace with hash 21829902, now seen corresponding path program 838 times [2020-02-10 19:55:27,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:27,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704520644] [2020-02-10 19:55:27,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:27,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:27,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 19:55:27,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704520644] [2020-02-10 19:55:27,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:27,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:55:27,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134564577] [2020-02-10 19:55:27,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:55:27,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:27,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:55:27,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:27,770 INFO L87 Difference]: Start difference. First operand 1591 states and 7069 transitions. Second operand 11 states. [2020-02-10 19:55:27,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:27,955 INFO L93 Difference]: Finished difference Result 3009 states and 11815 transitions. [2020-02-10 19:55:27,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:55:27,955 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:55:27,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:27,963 INFO L225 Difference]: With dead ends: 3009 [2020-02-10 19:55:27,963 INFO L226 Difference]: Without dead ends: 2984 [2020-02-10 19:55:27,963 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:55:28,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2984 states. [2020-02-10 19:55:28,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2984 to 1583. [2020-02-10 19:55:28,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 19:55:28,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7047 transitions. [2020-02-10 19:55:28,030 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7047 transitions. Word has length 28 [2020-02-10 19:55:28,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:28,030 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7047 transitions. [2020-02-10 19:55:28,030 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:55:28,031 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7047 transitions. [2020-02-10 19:55:28,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:55:28,033 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:28,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] [2020-02-10 19:55:28,033 INFO L427 AbstractCegarLoop]: === Iteration 847 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:28,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:28,033 INFO L82 PathProgramCache]: Analyzing trace with hash -2090741630, now seen corresponding path program 839 times [2020-02-10 19:55:28,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:28,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495950157] [2020-02-10 19:55:28,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:28,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:28,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 19:55:28,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495950157] [2020-02-10 19:55:28,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:28,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:55:28,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426137026] [2020-02-10 19:55:28,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:55:28,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:28,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:55:28,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:28,578 INFO L87 Difference]: Start difference. First operand 1583 states and 7047 transitions. Second operand 11 states. [2020-02-10 19:55:28,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:28,770 INFO L93 Difference]: Finished difference Result 3007 states and 11812 transitions. [2020-02-10 19:55:28,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:55:28,770 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:55:28,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:28,778 INFO L225 Difference]: With dead ends: 3007 [2020-02-10 19:55:28,778 INFO L226 Difference]: Without dead ends: 2989 [2020-02-10 19:55:28,778 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:55:28,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2989 states. [2020-02-10 19:55:28,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2989 to 1590. [2020-02-10 19:55:28,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1590 states. [2020-02-10 19:55:28,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1590 states to 1590 states and 7060 transitions. [2020-02-10 19:55:28,846 INFO L78 Accepts]: Start accepts. Automaton has 1590 states and 7060 transitions. Word has length 28 [2020-02-10 19:55:28,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:28,846 INFO L479 AbstractCegarLoop]: Abstraction has 1590 states and 7060 transitions. [2020-02-10 19:55:28,846 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:55:28,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1590 states and 7060 transitions. [2020-02-10 19:55:28,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:55:28,849 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:28,849 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:28,849 INFO L427 AbstractCegarLoop]: === Iteration 848 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:28,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:28,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1632770860, now seen corresponding path program 840 times [2020-02-10 19:55:28,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:28,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931619260] [2020-02-10 19:55:28,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:28,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:29,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:29,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931619260] [2020-02-10 19:55:29,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:29,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:55:29,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235746296] [2020-02-10 19:55:29,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:55:29,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:29,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:55:29,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:29,394 INFO L87 Difference]: Start difference. First operand 1590 states and 7060 transitions. Second operand 11 states. [2020-02-10 19:55:29,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:29,580 INFO L93 Difference]: Finished difference Result 3006 states and 11803 transitions. [2020-02-10 19:55:29,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:55:29,580 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:55:29,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:29,587 INFO L225 Difference]: With dead ends: 3006 [2020-02-10 19:55:29,587 INFO L226 Difference]: Without dead ends: 2952 [2020-02-10 19:55:29,587 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:55:29,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2952 states. [2020-02-10 19:55:29,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2952 to 1553. [2020-02-10 19:55:29,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1553 states. [2020-02-10 19:55:29,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1553 states to 1553 states and 6987 transitions. [2020-02-10 19:55:29,655 INFO L78 Accepts]: Start accepts. Automaton has 1553 states and 6987 transitions. Word has length 28 [2020-02-10 19:55:29,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:29,655 INFO L479 AbstractCegarLoop]: Abstraction has 1553 states and 6987 transitions. [2020-02-10 19:55:29,655 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:55:29,655 INFO L276 IsEmpty]: Start isEmpty. Operand 1553 states and 6987 transitions. [2020-02-10 19:55:29,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:55:29,657 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:29,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] [2020-02-10 19:55:29,657 INFO L427 AbstractCegarLoop]: === Iteration 849 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:29,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:29,657 INFO L82 PathProgramCache]: Analyzing trace with hash -471497986, now seen corresponding path program 841 times [2020-02-10 19:55:29,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:29,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483068026] [2020-02-10 19:55:29,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:29,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:30,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:30,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483068026] [2020-02-10 19:55:30,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:30,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:55:30,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151631279] [2020-02-10 19:55:30,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:55:30,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:30,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:55:30,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:30,186 INFO L87 Difference]: Start difference. First operand 1553 states and 6987 transitions. Second operand 11 states. [2020-02-10 19:55:30,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:30,368 INFO L93 Difference]: Finished difference Result 2917 states and 11586 transitions. [2020-02-10 19:55:30,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:55:30,368 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:55:30,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:30,376 INFO L225 Difference]: With dead ends: 2917 [2020-02-10 19:55:30,376 INFO L226 Difference]: Without dead ends: 2902 [2020-02-10 19:55:30,376 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:55:30,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2902 states. [2020-02-10 19:55:30,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2902 to 1576. [2020-02-10 19:55:30,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 19:55:30,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7075 transitions. [2020-02-10 19:55:30,443 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7075 transitions. Word has length 28 [2020-02-10 19:55:30,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:30,443 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7075 transitions. [2020-02-10 19:55:30,443 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:55:30,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7075 transitions. [2020-02-10 19:55:30,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:55:30,446 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:30,446 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:30,446 INFO L427 AbstractCegarLoop]: === Iteration 850 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:30,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:30,446 INFO L82 PathProgramCache]: Analyzing trace with hash 273204512, now seen corresponding path program 842 times [2020-02-10 19:55:30,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:30,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029123578] [2020-02-10 19:55:30,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:30,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:30,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:30,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029123578] [2020-02-10 19:55:30,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:30,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:55:30,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052465937] [2020-02-10 19:55:30,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:55:30,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:30,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:55:30,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:30,984 INFO L87 Difference]: Start difference. First operand 1576 states and 7075 transitions. Second operand 11 states. [2020-02-10 19:55:31,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:31,160 INFO L93 Difference]: Finished difference Result 2918 states and 11583 transitions. [2020-02-10 19:55:31,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:55:31,160 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:55:31,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:31,167 INFO L225 Difference]: With dead ends: 2918 [2020-02-10 19:55:31,168 INFO L226 Difference]: Without dead ends: 2897 [2020-02-10 19:55:31,168 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:55:31,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2897 states. [2020-02-10 19:55:31,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2897 to 1571. [2020-02-10 19:55:31,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 19:55:31,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7061 transitions. [2020-02-10 19:55:31,263 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7061 transitions. Word has length 28 [2020-02-10 19:55:31,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:31,263 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7061 transitions. [2020-02-10 19:55:31,263 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:55:31,263 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7061 transitions. [2020-02-10 19:55:31,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:55:31,266 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:31,266 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:31,266 INFO L427 AbstractCegarLoop]: === Iteration 851 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:31,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:31,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1139442972, now seen corresponding path program 843 times [2020-02-10 19:55:31,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:31,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545339385] [2020-02-10 19:55:31,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:31,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:31,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:31,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545339385] [2020-02-10 19:55:31,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:31,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:55:31,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622456538] [2020-02-10 19:55:31,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:55:31,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:31,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:55:31,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:31,790 INFO L87 Difference]: Start difference. First operand 1571 states and 7061 transitions. Second operand 11 states. [2020-02-10 19:55:31,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:31,986 INFO L93 Difference]: Finished difference Result 2922 states and 11590 transitions. [2020-02-10 19:55:31,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:55:31,986 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:55:31,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:31,993 INFO L225 Difference]: With dead ends: 2922 [2020-02-10 19:55:31,993 INFO L226 Difference]: Without dead ends: 2907 [2020-02-10 19:55:31,994 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:55:32,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2907 states. [2020-02-10 19:55:32,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2907 to 1577. [2020-02-10 19:55:32,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 19:55:32,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7072 transitions. [2020-02-10 19:55:32,061 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7072 transitions. Word has length 28 [2020-02-10 19:55:32,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:32,062 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7072 transitions. [2020-02-10 19:55:32,062 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:55:32,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7072 transitions. [2020-02-10 19:55:32,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:55:32,064 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:32,064 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:32,064 INFO L427 AbstractCegarLoop]: === Iteration 852 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:32,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:32,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1666119328, now seen corresponding path program 844 times [2020-02-10 19:55:32,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:32,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548465600] [2020-02-10 19:55:32,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:32,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:32,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 19:55:32,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548465600] [2020-02-10 19:55:32,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:32,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:55:32,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422749746] [2020-02-10 19:55:32,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:55:32,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:32,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:55:32,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:32,585 INFO L87 Difference]: Start difference. First operand 1577 states and 7072 transitions. Second operand 11 states. [2020-02-10 19:55:32,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:32,732 INFO L93 Difference]: Finished difference Result 2927 states and 11594 transitions. [2020-02-10 19:55:32,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:55:32,733 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:55:32,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:32,739 INFO L225 Difference]: With dead ends: 2927 [2020-02-10 19:55:32,740 INFO L226 Difference]: Without dead ends: 2901 [2020-02-10 19:55:32,740 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:55:32,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2901 states. [2020-02-10 19:55:32,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2901 to 1571. [2020-02-10 19:55:32,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 19:55:32,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7055 transitions. [2020-02-10 19:55:32,806 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7055 transitions. Word has length 28 [2020-02-10 19:55:32,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:32,806 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7055 transitions. [2020-02-10 19:55:32,806 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:55:32,807 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7055 transitions. [2020-02-10 19:55:32,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:55:32,809 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:32,809 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:32,809 INFO L427 AbstractCegarLoop]: === Iteration 853 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:32,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:32,809 INFO L82 PathProgramCache]: Analyzing trace with hash -799880868, now seen corresponding path program 845 times [2020-02-10 19:55:32,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:32,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291031282] [2020-02-10 19:55:32,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:32,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:33,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 19:55:33,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291031282] [2020-02-10 19:55:33,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:33,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:55:33,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873352974] [2020-02-10 19:55:33,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:55:33,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:33,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:55:33,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:33,336 INFO L87 Difference]: Start difference. First operand 1571 states and 7055 transitions. Second operand 11 states. [2020-02-10 19:55:33,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:33,513 INFO L93 Difference]: Finished difference Result 2925 states and 11591 transitions. [2020-02-10 19:55:33,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:55:33,513 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:55:33,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:33,520 INFO L225 Difference]: With dead ends: 2925 [2020-02-10 19:55:33,521 INFO L226 Difference]: Without dead ends: 2909 [2020-02-10 19:55:33,521 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:55:33,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2909 states. [2020-02-10 19:55:33,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2909 to 1578. [2020-02-10 19:55:33,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 19:55:33,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7068 transitions. [2020-02-10 19:55:33,588 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7068 transitions. Word has length 28 [2020-02-10 19:55:33,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:33,588 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7068 transitions. [2020-02-10 19:55:33,588 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:55:33,588 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7068 transitions. [2020-02-10 19:55:33,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:55:33,590 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:33,590 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:33,591 INFO L427 AbstractCegarLoop]: === Iteration 854 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:33,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:33,591 INFO L82 PathProgramCache]: Analyzing trace with hash -55178370, now seen corresponding path program 846 times [2020-02-10 19:55:33,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:33,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763957898] [2020-02-10 19:55:33,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:33,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:34,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:34,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763957898] [2020-02-10 19:55:34,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:34,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:55:34,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017911559] [2020-02-10 19:55:34,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:55:34,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:34,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:55:34,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:34,140 INFO L87 Difference]: Start difference. First operand 1578 states and 7068 transitions. Second operand 11 states. [2020-02-10 19:55:34,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:34,288 INFO L93 Difference]: Finished difference Result 2929 states and 11592 transitions. [2020-02-10 19:55:34,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:55:34,288 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:55:34,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:34,296 INFO L225 Difference]: With dead ends: 2929 [2020-02-10 19:55:34,296 INFO L226 Difference]: Without dead ends: 2896 [2020-02-10 19:55:34,296 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:55:34,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2896 states. [2020-02-10 19:55:34,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2896 to 1565. [2020-02-10 19:55:34,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1565 states. [2020-02-10 19:55:34,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 7038 transitions. [2020-02-10 19:55:34,362 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 7038 transitions. Word has length 28 [2020-02-10 19:55:34,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:34,362 INFO L479 AbstractCegarLoop]: Abstraction has 1565 states and 7038 transitions. [2020-02-10 19:55:34,362 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:55:34,363 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 7038 transitions. [2020-02-10 19:55:34,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:55:34,365 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:34,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] [2020-02-10 19:55:34,365 INFO L427 AbstractCegarLoop]: === Iteration 855 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:34,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:34,365 INFO L82 PathProgramCache]: Analyzing trace with hash 248514488, now seen corresponding path program 847 times [2020-02-10 19:55:34,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:34,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417723650] [2020-02-10 19:55:34,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:34,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:34,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:34,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417723650] [2020-02-10 19:55:34,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:34,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:55:34,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555979943] [2020-02-10 19:55:34,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:55:34,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:34,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:55:34,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:34,901 INFO L87 Difference]: Start difference. First operand 1565 states and 7038 transitions. Second operand 11 states. [2020-02-10 19:55:35,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:35,090 INFO L93 Difference]: Finished difference Result 2912 states and 11570 transitions. [2020-02-10 19:55:35,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:55:35,091 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:55:35,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:35,097 INFO L225 Difference]: With dead ends: 2912 [2020-02-10 19:55:35,097 INFO L226 Difference]: Without dead ends: 2897 [2020-02-10 19:55:35,098 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:55:35,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2897 states. [2020-02-10 19:55:35,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2897 to 1575. [2020-02-10 19:55:35,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 19:55:35,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7066 transitions. [2020-02-10 19:55:35,165 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7066 transitions. Word has length 28 [2020-02-10 19:55:35,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:35,165 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7066 transitions. [2020-02-10 19:55:35,165 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:55:35,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7066 transitions. [2020-02-10 19:55:35,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:55:35,168 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:35,168 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:35,168 INFO L427 AbstractCegarLoop]: === Iteration 856 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:35,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:35,168 INFO L82 PathProgramCache]: Analyzing trace with hash 993216986, now seen corresponding path program 848 times [2020-02-10 19:55:35,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:35,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340067023] [2020-02-10 19:55:35,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:35,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:35,688 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 19:55:35,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:35,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340067023] [2020-02-10 19:55:35,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:35,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:55:35,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881778584] [2020-02-10 19:55:35,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:55:35,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:35,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:55:35,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:35,696 INFO L87 Difference]: Start difference. First operand 1575 states and 7066 transitions. Second operand 11 states. [2020-02-10 19:55:35,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:35,912 INFO L93 Difference]: Finished difference Result 2913 states and 11567 transitions. [2020-02-10 19:55:35,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:55:35,913 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:55:35,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:35,920 INFO L225 Difference]: With dead ends: 2913 [2020-02-10 19:55:35,921 INFO L226 Difference]: Without dead ends: 2892 [2020-02-10 19:55:35,921 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:55:35,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2892 states. [2020-02-10 19:55:35,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2892 to 1570. [2020-02-10 19:55:35,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 19:55:35,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7052 transitions. [2020-02-10 19:55:35,987 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7052 transitions. Word has length 28 [2020-02-10 19:55:35,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:35,988 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7052 transitions. [2020-02-10 19:55:35,988 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:55:35,988 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7052 transitions. [2020-02-10 19:55:35,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:55:35,990 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:35,990 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:35,990 INFO L427 AbstractCegarLoop]: === Iteration 857 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:35,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:35,990 INFO L82 PathProgramCache]: Analyzing trace with hash -824570892, now seen corresponding path program 849 times [2020-02-10 19:55:35,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:35,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399810488] [2020-02-10 19:55:35,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:35,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:36,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 19:55:36,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399810488] [2020-02-10 19:55:36,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:36,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:55:36,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762853418] [2020-02-10 19:55:36,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:55:36,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:36,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:55:36,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:36,507 INFO L87 Difference]: Start difference. First operand 1570 states and 7052 transitions. Second operand 11 states. [2020-02-10 19:55:36,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:36,769 INFO L93 Difference]: Finished difference Result 2914 states and 11569 transitions. [2020-02-10 19:55:36,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:55:36,769 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:55:36,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:36,775 INFO L225 Difference]: With dead ends: 2914 [2020-02-10 19:55:36,775 INFO L226 Difference]: Without dead ends: 2899 [2020-02-10 19:55:36,776 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:55:36,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2899 states. [2020-02-10 19:55:36,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2899 to 1575. [2020-02-10 19:55:36,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 19:55:36,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7061 transitions. [2020-02-10 19:55:36,843 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7061 transitions. Word has length 28 [2020-02-10 19:55:36,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:36,843 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7061 transitions. [2020-02-10 19:55:36,843 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:55:36,843 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7061 transitions. [2020-02-10 19:55:36,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:55:36,845 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:36,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] [2020-02-10 19:55:36,845 INFO L427 AbstractCegarLoop]: === Iteration 858 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:36,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:36,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1409536602, now seen corresponding path program 850 times [2020-02-10 19:55:36,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:36,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824567673] [2020-02-10 19:55:36,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:36,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:37,396 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 30 [2020-02-10 19:55:37,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 19:55:37,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824567673] [2020-02-10 19:55:37,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:37,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:55:37,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008748434] [2020-02-10 19:55:37,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:55:37,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:37,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:55:37,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:37,405 INFO L87 Difference]: Start difference. First operand 1575 states and 7061 transitions. Second operand 11 states. [2020-02-10 19:55:37,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:37,608 INFO L93 Difference]: Finished difference Result 2917 states and 11570 transitions. [2020-02-10 19:55:37,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:55:37,608 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:55:37,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:37,616 INFO L225 Difference]: With dead ends: 2917 [2020-02-10 19:55:37,616 INFO L226 Difference]: Without dead ends: 2894 [2020-02-10 19:55:37,616 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:55:37,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2894 states. [2020-02-10 19:55:37,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2894 to 1570. [2020-02-10 19:55:37,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 19:55:37,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7047 transitions. [2020-02-10 19:55:37,683 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7047 transitions. Word has length 28 [2020-02-10 19:55:37,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:37,683 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7047 transitions. [2020-02-10 19:55:37,683 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:55:37,683 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7047 transitions. [2020-02-10 19:55:37,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:55:37,685 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:37,685 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:37,685 INFO L427 AbstractCegarLoop]: === Iteration 859 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:37,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:37,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1531072564, now seen corresponding path program 851 times [2020-02-10 19:55:37,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:37,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097773522] [2020-02-10 19:55:37,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:37,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:38,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 19:55:38,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097773522] [2020-02-10 19:55:38,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:38,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:55:38,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285141992] [2020-02-10 19:55:38,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:55:38,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:38,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:55:38,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:38,201 INFO L87 Difference]: Start difference. First operand 1570 states and 7047 transitions. Second operand 11 states. [2020-02-10 19:55:38,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:38,417 INFO L93 Difference]: Finished difference Result 2917 states and 11571 transitions. [2020-02-10 19:55:38,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:55:38,417 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:55:38,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:38,423 INFO L225 Difference]: With dead ends: 2917 [2020-02-10 19:55:38,423 INFO L226 Difference]: Without dead ends: 2901 [2020-02-10 19:55:38,424 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:55:38,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2901 states. [2020-02-10 19:55:38,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2901 to 1576. [2020-02-10 19:55:38,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 19:55:38,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7058 transitions. [2020-02-10 19:55:38,491 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7058 transitions. Word has length 28 [2020-02-10 19:55:38,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:38,491 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7058 transitions. [2020-02-10 19:55:38,491 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:55:38,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7058 transitions. [2020-02-10 19:55:38,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:55:38,493 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:38,493 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:38,493 INFO L427 AbstractCegarLoop]: === Iteration 860 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:38,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:38,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1274489736, now seen corresponding path program 852 times [2020-02-10 19:55:38,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:38,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707027435] [2020-02-10 19:55:38,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:38,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:38,996 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 19:55:39,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:39,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707027435] [2020-02-10 19:55:39,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:39,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:55:39,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722710341] [2020-02-10 19:55:39,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:55:39,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:39,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:55:39,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:39,005 INFO L87 Difference]: Start difference. First operand 1576 states and 7058 transitions. Second operand 11 states. [2020-02-10 19:55:39,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:39,207 INFO L93 Difference]: Finished difference Result 2919 states and 11569 transitions. [2020-02-10 19:55:39,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:55:39,207 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:55:39,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:39,215 INFO L225 Difference]: With dead ends: 2919 [2020-02-10 19:55:39,215 INFO L226 Difference]: Without dead ends: 2890 [2020-02-10 19:55:39,215 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:55:39,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2890 states. [2020-02-10 19:55:39,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2890 to 1565. [2020-02-10 19:55:39,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1565 states. [2020-02-10 19:55:39,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 7033 transitions. [2020-02-10 19:55:39,283 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 7033 transitions. Word has length 28 [2020-02-10 19:55:39,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:39,283 INFO L479 AbstractCegarLoop]: Abstraction has 1565 states and 7033 transitions. [2020-02-10 19:55:39,283 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:55:39,283 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 7033 transitions. [2020-02-10 19:55:39,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:55:39,286 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:39,286 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:39,286 INFO L427 AbstractCegarLoop]: === Iteration 861 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:39,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:39,286 INFO L82 PathProgramCache]: Analyzing trace with hash 259017592, now seen corresponding path program 853 times [2020-02-10 19:55:39,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:39,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123534612] [2020-02-10 19:55:39,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:39,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:39,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:39,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123534612] [2020-02-10 19:55:39,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:39,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:55:39,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885498843] [2020-02-10 19:55:39,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:55:39,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:39,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:55:39,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:39,797 INFO L87 Difference]: Start difference. First operand 1565 states and 7033 transitions. Second operand 11 states. [2020-02-10 19:55:39,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:39,999 INFO L93 Difference]: Finished difference Result 2928 states and 11597 transitions. [2020-02-10 19:55:39,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:55:39,999 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:55:40,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:40,006 INFO L225 Difference]: With dead ends: 2928 [2020-02-10 19:55:40,006 INFO L226 Difference]: Without dead ends: 2913 [2020-02-10 19:55:40,006 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:55:40,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2913 states. [2020-02-10 19:55:40,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2913 to 1578. [2020-02-10 19:55:40,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-02-10 19:55:40,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 7068 transitions. [2020-02-10 19:55:40,075 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 7068 transitions. Word has length 28 [2020-02-10 19:55:40,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:40,075 INFO L479 AbstractCegarLoop]: Abstraction has 1578 states and 7068 transitions. [2020-02-10 19:55:40,075 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:55:40,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 7068 transitions. [2020-02-10 19:55:40,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:55:40,078 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:40,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] [2020-02-10 19:55:40,078 INFO L427 AbstractCegarLoop]: === Iteration 862 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:40,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:40,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1748422588, now seen corresponding path program 854 times [2020-02-10 19:55:40,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:40,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655690048] [2020-02-10 19:55:40,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:40,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:40,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:40,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655690048] [2020-02-10 19:55:40,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:40,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:55:40,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711014019] [2020-02-10 19:55:40,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:55:40,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:40,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:55:40,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:40,604 INFO L87 Difference]: Start difference. First operand 1578 states and 7068 transitions. Second operand 11 states. [2020-02-10 19:55:40,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:40,770 INFO L93 Difference]: Finished difference Result 2933 states and 11601 transitions. [2020-02-10 19:55:40,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:55:40,771 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:55:40,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:40,778 INFO L225 Difference]: With dead ends: 2933 [2020-02-10 19:55:40,778 INFO L226 Difference]: Without dead ends: 2907 [2020-02-10 19:55:40,779 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:55:40,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2907 states. [2020-02-10 19:55:40,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2907 to 1572. [2020-02-10 19:55:40,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 19:55:40,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7051 transitions. [2020-02-10 19:55:40,845 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7051 transitions. Word has length 28 [2020-02-10 19:55:40,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:40,845 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7051 transitions. [2020-02-10 19:55:40,845 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:55:40,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7051 transitions. [2020-02-10 19:55:40,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:55:40,848 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:40,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] [2020-02-10 19:55:40,848 INFO L427 AbstractCegarLoop]: === Iteration 863 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:40,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:40,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1869958550, now seen corresponding path program 855 times [2020-02-10 19:55:40,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:40,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168912557] [2020-02-10 19:55:40,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:40,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:41,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 19:55:41,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168912557] [2020-02-10 19:55:41,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:41,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:55:41,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091252158] [2020-02-10 19:55:41,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:55:41,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:41,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:55:41,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:41,370 INFO L87 Difference]: Start difference. First operand 1572 states and 7051 transitions. Second operand 11 states. [2020-02-10 19:55:41,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:41,594 INFO L93 Difference]: Finished difference Result 2925 states and 11586 transitions. [2020-02-10 19:55:41,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:55:41,594 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:55:41,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:41,602 INFO L225 Difference]: With dead ends: 2925 [2020-02-10 19:55:41,602 INFO L226 Difference]: Without dead ends: 2910 [2020-02-10 19:55:41,602 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:55:41,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2910 states. [2020-02-10 19:55:41,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2910 to 1577. [2020-02-10 19:55:41,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2020-02-10 19:55:41,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 7060 transitions. [2020-02-10 19:55:41,671 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 7060 transitions. Word has length 28 [2020-02-10 19:55:41,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:41,671 INFO L479 AbstractCegarLoop]: Abstraction has 1577 states and 7060 transitions. [2020-02-10 19:55:41,671 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:55:41,671 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 7060 transitions. [2020-02-10 19:55:41,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:55:41,673 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:41,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] [2020-02-10 19:55:41,674 INFO L427 AbstractCegarLoop]: === Iteration 864 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:41,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:41,674 INFO L82 PathProgramCache]: Analyzing trace with hash -190901252, now seen corresponding path program 856 times [2020-02-10 19:55:41,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:41,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751568073] [2020-02-10 19:55:41,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:41,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:42,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 19:55:42,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751568073] [2020-02-10 19:55:42,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:42,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:55:42,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274337854] [2020-02-10 19:55:42,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:55:42,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:42,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:55:42,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:42,200 INFO L87 Difference]: Start difference. First operand 1577 states and 7060 transitions. Second operand 11 states. [2020-02-10 19:55:42,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:42,393 INFO L93 Difference]: Finished difference Result 2928 states and 11587 transitions. [2020-02-10 19:55:42,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:55:42,394 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:55:42,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:42,401 INFO L225 Difference]: With dead ends: 2928 [2020-02-10 19:55:42,401 INFO L226 Difference]: Without dead ends: 2905 [2020-02-10 19:55:42,402 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:55:42,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2905 states. [2020-02-10 19:55:42,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2905 to 1572. [2020-02-10 19:55:42,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 19:55:42,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7046 transitions. [2020-02-10 19:55:42,468 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7046 transitions. Word has length 28 [2020-02-10 19:55:42,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:42,469 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7046 transitions. [2020-02-10 19:55:42,469 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:55:42,469 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7046 transitions. [2020-02-10 19:55:42,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:55:42,471 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:42,471 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:42,471 INFO L427 AbstractCegarLoop]: === Iteration 865 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:42,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:42,471 INFO L82 PathProgramCache]: Analyzing trace with hash -2008689130, now seen corresponding path program 857 times [2020-02-10 19:55:42,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:42,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987625862] [2020-02-10 19:55:42,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:42,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:43,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:43,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987625862] [2020-02-10 19:55:43,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:43,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:55:43,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447035099] [2020-02-10 19:55:43,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:55:43,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:43,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:55:43,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:43,005 INFO L87 Difference]: Start difference. First operand 1572 states and 7046 transitions. Second operand 11 states. [2020-02-10 19:55:43,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:43,209 INFO L93 Difference]: Finished difference Result 2940 states and 11611 transitions. [2020-02-10 19:55:43,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:55:43,210 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:55:43,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:43,217 INFO L225 Difference]: With dead ends: 2940 [2020-02-10 19:55:43,217 INFO L226 Difference]: Without dead ends: 2920 [2020-02-10 19:55:43,217 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:55:43,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2920 states. [2020-02-10 19:55:43,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2920 to 1582. [2020-02-10 19:55:43,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1582 states. [2020-02-10 19:55:43,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 7063 transitions. [2020-02-10 19:55:43,286 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 7063 transitions. Word has length 28 [2020-02-10 19:55:43,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:43,286 INFO L479 AbstractCegarLoop]: Abstraction has 1582 states and 7063 transitions. [2020-02-10 19:55:43,286 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:55:43,286 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 7063 transitions. [2020-02-10 19:55:43,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:55:43,288 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:43,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] [2020-02-10 19:55:43,289 INFO L427 AbstractCegarLoop]: === Iteration 866 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:43,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:43,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1263986632, now seen corresponding path program 858 times [2020-02-10 19:55:43,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:43,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139676457] [2020-02-10 19:55:43,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:43,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:43,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:43,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139676457] [2020-02-10 19:55:43,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:43,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:55:43,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703135221] [2020-02-10 19:55:43,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:55:43,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:43,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:55:43,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:43,836 INFO L87 Difference]: Start difference. First operand 1582 states and 7063 transitions. Second operand 11 states. [2020-02-10 19:55:44,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:44,034 INFO L93 Difference]: Finished difference Result 2938 states and 11599 transitions. [2020-02-10 19:55:44,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:55:44,034 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:55:44,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:44,042 INFO L225 Difference]: With dead ends: 2938 [2020-02-10 19:55:44,042 INFO L226 Difference]: Without dead ends: 2903 [2020-02-10 19:55:44,042 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:55:44,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2903 states. [2020-02-10 19:55:44,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2903 to 1565. [2020-02-10 19:55:44,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1565 states. [2020-02-10 19:55:44,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 7026 transitions. [2020-02-10 19:55:44,109 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 7026 transitions. Word has length 28 [2020-02-10 19:55:44,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:44,109 INFO L479 AbstractCegarLoop]: Abstraction has 1565 states and 7026 transitions. [2020-02-10 19:55:44,109 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:55:44,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 7026 transitions. [2020-02-10 19:55:44,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:55:44,111 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:44,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] [2020-02-10 19:55:44,112 INFO L427 AbstractCegarLoop]: === Iteration 867 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:44,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:44,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1014223194, now seen corresponding path program 859 times [2020-02-10 19:55:44,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:44,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128428167] [2020-02-10 19:55:44,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:44,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:44,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 19:55:44,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128428167] [2020-02-10 19:55:44,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:44,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:55:44,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704265483] [2020-02-10 19:55:44,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:55:44,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:44,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:55:44,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:44,659 INFO L87 Difference]: Start difference. First operand 1565 states and 7026 transitions. Second operand 11 states. [2020-02-10 19:55:44,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:44,848 INFO L93 Difference]: Finished difference Result 2935 states and 11609 transitions. [2020-02-10 19:55:44,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:55:44,849 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:55:44,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:44,856 INFO L225 Difference]: With dead ends: 2935 [2020-02-10 19:55:44,856 INFO L226 Difference]: Without dead ends: 2919 [2020-02-10 19:55:44,856 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:55:44,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2919 states. [2020-02-10 19:55:44,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2919 to 1580. [2020-02-10 19:55:44,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 19:55:44,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7067 transitions. [2020-02-10 19:55:44,925 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7067 transitions. Word has length 28 [2020-02-10 19:55:44,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:44,925 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7067 transitions. [2020-02-10 19:55:44,925 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:55:44,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7067 transitions. [2020-02-10 19:55:44,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:55:44,927 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:44,928 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:44,928 INFO L427 AbstractCegarLoop]: === Iteration 868 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:44,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:44,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1758925692, now seen corresponding path program 860 times [2020-02-10 19:55:44,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:44,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573999807] [2020-02-10 19:55:44,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:44,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:45,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 19:55:45,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573999807] [2020-02-10 19:55:45,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:45,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:55:45,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816047810] [2020-02-10 19:55:45,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:55:45,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:45,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:55:45,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:45,477 INFO L87 Difference]: Start difference. First operand 1580 states and 7067 transitions. Second operand 11 states. [2020-02-10 19:55:45,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:45,621 INFO L93 Difference]: Finished difference Result 2939 states and 11610 transitions. [2020-02-10 19:55:45,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:55:45,622 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:55:45,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:45,629 INFO L225 Difference]: With dead ends: 2939 [2020-02-10 19:55:45,630 INFO L226 Difference]: Without dead ends: 2912 [2020-02-10 19:55:45,630 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:55:45,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2912 states. [2020-02-10 19:55:45,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2912 to 1573. [2020-02-10 19:55:45,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 19:55:45,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7047 transitions. [2020-02-10 19:55:45,699 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7047 transitions. Word has length 28 [2020-02-10 19:55:45,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:45,699 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7047 transitions. [2020-02-10 19:55:45,699 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:55:45,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7047 transitions. [2020-02-10 19:55:45,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:55:45,701 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:45,702 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:45,702 INFO L427 AbstractCegarLoop]: === Iteration 869 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:45,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:45,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1669803144, now seen corresponding path program 861 times [2020-02-10 19:55:45,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:45,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637993705] [2020-02-10 19:55:45,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:45,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:46,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 19:55:46,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637993705] [2020-02-10 19:55:46,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:46,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:55:46,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652972192] [2020-02-10 19:55:46,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:55:46,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:46,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:55:46,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:46,229 INFO L87 Difference]: Start difference. First operand 1573 states and 7047 transitions. Second operand 11 states. [2020-02-10 19:55:46,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:46,425 INFO L93 Difference]: Finished difference Result 2932 states and 11597 transitions. [2020-02-10 19:55:46,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:55:46,426 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:55:46,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:46,433 INFO L225 Difference]: With dead ends: 2932 [2020-02-10 19:55:46,433 INFO L226 Difference]: Without dead ends: 2916 [2020-02-10 19:55:46,433 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:55:46,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2916 states. [2020-02-10 19:55:46,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2916 to 1579. [2020-02-10 19:55:46,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2020-02-10 19:55:46,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 7058 transitions. [2020-02-10 19:55:46,501 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 7058 transitions. Word has length 28 [2020-02-10 19:55:46,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:46,501 INFO L479 AbstractCegarLoop]: Abstraction has 1579 states and 7058 transitions. [2020-02-10 19:55:46,502 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:55:46,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 7058 transitions. [2020-02-10 19:55:46,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:55:46,504 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:46,504 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:46,504 INFO L427 AbstractCegarLoop]: === Iteration 870 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:46,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:46,504 INFO L82 PathProgramCache]: Analyzing trace with hash -180398148, now seen corresponding path program 862 times [2020-02-10 19:55:46,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:46,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814555349] [2020-02-10 19:55:46,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:46,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:47,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:47,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814555349] [2020-02-10 19:55:47,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:47,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:55:47,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160161248] [2020-02-10 19:55:47,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:55:47,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:47,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:55:47,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:47,025 INFO L87 Difference]: Start difference. First operand 1579 states and 7058 transitions. Second operand 11 states. [2020-02-10 19:55:47,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:47,203 INFO L93 Difference]: Finished difference Result 2934 states and 11595 transitions. [2020-02-10 19:55:47,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:55:47,203 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:55:47,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:47,210 INFO L225 Difference]: With dead ends: 2934 [2020-02-10 19:55:47,210 INFO L226 Difference]: Without dead ends: 2910 [2020-02-10 19:55:47,211 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:55:47,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2910 states. [2020-02-10 19:55:47,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2910 to 1573. [2020-02-10 19:55:47,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 19:55:47,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7041 transitions. [2020-02-10 19:55:47,279 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7041 transitions. Word has length 28 [2020-02-10 19:55:47,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:47,279 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7041 transitions. [2020-02-10 19:55:47,280 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:55:47,280 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7041 transitions. [2020-02-10 19:55:47,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:55:47,282 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:47,282 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:47,282 INFO L427 AbstractCegarLoop]: === Iteration 871 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:47,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:47,282 INFO L82 PathProgramCache]: Analyzing trace with hash 685840312, now seen corresponding path program 863 times [2020-02-10 19:55:47,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:47,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999103039] [2020-02-10 19:55:47,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:47,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:47,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:47,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999103039] [2020-02-10 19:55:47,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:47,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:55:47,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128838924] [2020-02-10 19:55:47,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:55:47,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:47,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:55:47,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:47,820 INFO L87 Difference]: Start difference. First operand 1573 states and 7041 transitions. Second operand 11 states. [2020-02-10 19:55:47,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:47,962 INFO L93 Difference]: Finished difference Result 2944 states and 11614 transitions. [2020-02-10 19:55:47,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:55:47,962 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:55:47,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:47,969 INFO L225 Difference]: With dead ends: 2944 [2020-02-10 19:55:47,969 INFO L226 Difference]: Without dead ends: 2924 [2020-02-10 19:55:47,969 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:55:48,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2924 states. [2020-02-10 19:55:48,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2924 to 1583. [2020-02-10 19:55:48,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1583 states. [2020-02-10 19:55:48,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 7058 transitions. [2020-02-10 19:55:48,036 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 7058 transitions. Word has length 28 [2020-02-10 19:55:48,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:48,037 INFO L479 AbstractCegarLoop]: Abstraction has 1583 states and 7058 transitions. [2020-02-10 19:55:48,037 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:55:48,037 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 7058 transitions. [2020-02-10 19:55:48,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:55:48,039 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:48,039 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:48,039 INFO L427 AbstractCegarLoop]: === Iteration 872 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:48,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:48,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1430542810, now seen corresponding path program 864 times [2020-02-10 19:55:48,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:48,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807742374] [2020-02-10 19:55:48,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:48,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:48,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:48,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807742374] [2020-02-10 19:55:48,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:48,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:55:48,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57705844] [2020-02-10 19:55:48,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:55:48,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:48,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:55:48,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:48,587 INFO L87 Difference]: Start difference. First operand 1583 states and 7058 transitions. Second operand 11 states. [2020-02-10 19:55:48,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:48,809 INFO L93 Difference]: Finished difference Result 2942 states and 11602 transitions. [2020-02-10 19:55:48,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:55:48,809 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:55:48,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:48,816 INFO L225 Difference]: With dead ends: 2942 [2020-02-10 19:55:48,816 INFO L226 Difference]: Without dead ends: 2899 [2020-02-10 19:55:48,816 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:55:48,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2899 states. [2020-02-10 19:55:48,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2899 to 1558. [2020-02-10 19:55:48,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2020-02-10 19:55:48,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 7008 transitions. [2020-02-10 19:55:48,885 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 7008 transitions. Word has length 28 [2020-02-10 19:55:48,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:48,886 INFO L479 AbstractCegarLoop]: Abstraction has 1558 states and 7008 transitions. [2020-02-10 19:55:48,886 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:55:48,886 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 7008 transitions. [2020-02-10 19:55:48,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:55:48,888 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:48,888 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:48,888 INFO L427 AbstractCegarLoop]: === Iteration 873 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:48,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:48,888 INFO L82 PathProgramCache]: Analyzing trace with hash -556215610, now seen corresponding path program 865 times [2020-02-10 19:55:48,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:48,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963675725] [2020-02-10 19:55:48,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:48,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:49,456 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 29 [2020-02-10 19:55:49,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:49,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963675725] [2020-02-10 19:55:49,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:49,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:55:49,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21050250] [2020-02-10 19:55:49,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:55:49,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:49,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:55:49,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:49,463 INFO L87 Difference]: Start difference. First operand 1558 states and 7008 transitions. Second operand 11 states. [2020-02-10 19:55:49,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:49,637 INFO L93 Difference]: Finished difference Result 2889 states and 11495 transitions. [2020-02-10 19:55:49,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:55:49,637 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:55:49,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:49,645 INFO L225 Difference]: With dead ends: 2889 [2020-02-10 19:55:49,645 INFO L226 Difference]: Without dead ends: 2874 [2020-02-10 19:55:49,645 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:55:49,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2874 states. [2020-02-10 19:55:49,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2874 to 1573. [2020-02-10 19:55:49,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 19:55:49,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7057 transitions. [2020-02-10 19:55:49,712 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7057 transitions. Word has length 28 [2020-02-10 19:55:49,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:49,712 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7057 transitions. [2020-02-10 19:55:49,712 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:55:49,712 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7057 transitions. [2020-02-10 19:55:49,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:55:49,714 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:49,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] [2020-02-10 19:55:49,714 INFO L427 AbstractCegarLoop]: === Iteration 874 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:49,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:49,715 INFO L82 PathProgramCache]: Analyzing trace with hash 188486888, now seen corresponding path program 866 times [2020-02-10 19:55:49,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:49,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954165697] [2020-02-10 19:55:49,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:49,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:50,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:50,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954165697] [2020-02-10 19:55:50,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:50,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:55:50,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148868903] [2020-02-10 19:55:50,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:55:50,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:50,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:55:50,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:50,238 INFO L87 Difference]: Start difference. First operand 1573 states and 7057 transitions. Second operand 11 states. [2020-02-10 19:55:50,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:50,411 INFO L93 Difference]: Finished difference Result 2890 states and 11492 transitions. [2020-02-10 19:55:50,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:55:50,411 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:55:50,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:50,418 INFO L225 Difference]: With dead ends: 2890 [2020-02-10 19:55:50,418 INFO L226 Difference]: Without dead ends: 2869 [2020-02-10 19:55:50,418 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:55:50,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2869 states. [2020-02-10 19:55:50,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2869 to 1568. [2020-02-10 19:55:50,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 19:55:50,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7043 transitions. [2020-02-10 19:55:50,485 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7043 transitions. Word has length 28 [2020-02-10 19:55:50,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:50,485 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7043 transitions. [2020-02-10 19:55:50,485 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:55:50,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7043 transitions. [2020-02-10 19:55:50,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:55:50,487 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:50,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] [2020-02-10 19:55:50,488 INFO L427 AbstractCegarLoop]: === Iteration 875 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:50,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:50,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1054725348, now seen corresponding path program 867 times [2020-02-10 19:55:50,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:50,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650238243] [2020-02-10 19:55:50,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:50,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:50,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 19:55:50,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650238243] [2020-02-10 19:55:50,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:50,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:55:50,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763179259] [2020-02-10 19:55:50,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:55:50,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:50,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:55:50,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:50,992 INFO L87 Difference]: Start difference. First operand 1568 states and 7043 transitions. Second operand 11 states. [2020-02-10 19:55:51,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:51,183 INFO L93 Difference]: Finished difference Result 2894 states and 11499 transitions. [2020-02-10 19:55:51,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:55:51,183 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:55:51,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:51,190 INFO L225 Difference]: With dead ends: 2894 [2020-02-10 19:55:51,190 INFO L226 Difference]: Without dead ends: 2879 [2020-02-10 19:55:51,190 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:55:51,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2879 states. [2020-02-10 19:55:51,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2879 to 1574. [2020-02-10 19:55:51,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2020-02-10 19:55:51,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 7054 transitions. [2020-02-10 19:55:51,257 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 7054 transitions. Word has length 28 [2020-02-10 19:55:51,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:51,257 INFO L479 AbstractCegarLoop]: Abstraction has 1574 states and 7054 transitions. [2020-02-10 19:55:51,257 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:55:51,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 7054 transitions. [2020-02-10 19:55:51,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:55:51,259 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:51,260 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:51,260 INFO L427 AbstractCegarLoop]: === Iteration 876 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:51,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:51,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1750836952, now seen corresponding path program 868 times [2020-02-10 19:55:51,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:51,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481441645] [2020-02-10 19:55:51,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:51,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:51,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:51,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481441645] [2020-02-10 19:55:51,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:51,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:55:51,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127135053] [2020-02-10 19:55:51,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:55:51,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:51,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:55:51,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:51,788 INFO L87 Difference]: Start difference. First operand 1574 states and 7054 transitions. Second operand 11 states. [2020-02-10 19:55:51,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:51,936 INFO L93 Difference]: Finished difference Result 2899 states and 11503 transitions. [2020-02-10 19:55:51,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:55:51,936 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:55:51,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:51,943 INFO L225 Difference]: With dead ends: 2899 [2020-02-10 19:55:51,944 INFO L226 Difference]: Without dead ends: 2873 [2020-02-10 19:55:51,944 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:55:51,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2873 states. [2020-02-10 19:55:52,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2873 to 1568. [2020-02-10 19:55:52,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 19:55:52,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7037 transitions. [2020-02-10 19:55:52,015 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7037 transitions. Word has length 28 [2020-02-10 19:55:52,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:52,015 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7037 transitions. [2020-02-10 19:55:52,015 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:55:52,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7037 transitions. [2020-02-10 19:55:52,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:55:52,017 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:52,017 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:52,018 INFO L427 AbstractCegarLoop]: === Iteration 877 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:52,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:52,018 INFO L82 PathProgramCache]: Analyzing trace with hash -884598492, now seen corresponding path program 869 times [2020-02-10 19:55:52,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:52,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670073870] [2020-02-10 19:55:52,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:52,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:52,536 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 30 [2020-02-10 19:55:52,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:52,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670073870] [2020-02-10 19:55:52,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:52,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:55:52,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805196271] [2020-02-10 19:55:52,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:55:52,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:52,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:55:52,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:52,543 INFO L87 Difference]: Start difference. First operand 1568 states and 7037 transitions. Second operand 11 states. [2020-02-10 19:55:52,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:52,721 INFO L93 Difference]: Finished difference Result 2897 states and 11500 transitions. [2020-02-10 19:55:52,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:55:52,721 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:55:52,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:52,728 INFO L225 Difference]: With dead ends: 2897 [2020-02-10 19:55:52,728 INFO L226 Difference]: Without dead ends: 2881 [2020-02-10 19:55:52,728 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:55:52,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2881 states. [2020-02-10 19:55:52,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2881 to 1575. [2020-02-10 19:55:52,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 19:55:52,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7050 transitions. [2020-02-10 19:55:52,797 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7050 transitions. Word has length 28 [2020-02-10 19:55:52,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:52,797 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7050 transitions. [2020-02-10 19:55:52,797 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:55:52,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7050 transitions. [2020-02-10 19:55:52,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:55:52,800 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:52,800 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:52,800 INFO L427 AbstractCegarLoop]: === Iteration 878 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:52,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:52,800 INFO L82 PathProgramCache]: Analyzing trace with hash -139895994, now seen corresponding path program 870 times [2020-02-10 19:55:52,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:52,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262022416] [2020-02-10 19:55:52,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:52,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:53,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:53,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262022416] [2020-02-10 19:55:53,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:53,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:55:53,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511728930] [2020-02-10 19:55:53,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:55:53,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:53,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:55:53,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:53,334 INFO L87 Difference]: Start difference. First operand 1575 states and 7050 transitions. Second operand 11 states. [2020-02-10 19:55:53,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:53,501 INFO L93 Difference]: Finished difference Result 2901 states and 11501 transitions. [2020-02-10 19:55:53,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:55:53,502 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:55:53,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:53,508 INFO L225 Difference]: With dead ends: 2901 [2020-02-10 19:55:53,508 INFO L226 Difference]: Without dead ends: 2868 [2020-02-10 19:55:53,508 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:55:53,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2868 states. [2020-02-10 19:55:53,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2868 to 1562. [2020-02-10 19:55:53,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1562 states. [2020-02-10 19:55:53,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1562 states to 1562 states and 7022 transitions. [2020-02-10 19:55:53,575 INFO L78 Accepts]: Start accepts. Automaton has 1562 states and 7022 transitions. Word has length 28 [2020-02-10 19:55:53,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:53,575 INFO L479 AbstractCegarLoop]: Abstraction has 1562 states and 7022 transitions. [2020-02-10 19:55:53,575 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:55:53,575 INFO L276 IsEmpty]: Start isEmpty. Operand 1562 states and 7022 transitions. [2020-02-10 19:55:53,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:55:53,577 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:53,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] [2020-02-10 19:55:53,577 INFO L427 AbstractCegarLoop]: === Iteration 879 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:53,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:53,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1913959506, now seen corresponding path program 871 times [2020-02-10 19:55:53,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:53,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585088349] [2020-02-10 19:55:53,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:53,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:54,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 19:55:54,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585088349] [2020-02-10 19:55:54,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:54,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:55:54,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858358811] [2020-02-10 19:55:54,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:55:54,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:54,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:55:54,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:54,099 INFO L87 Difference]: Start difference. First operand 1562 states and 7022 transitions. Second operand 11 states. [2020-02-10 19:55:54,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:54,284 INFO L93 Difference]: Finished difference Result 2872 states and 11448 transitions. [2020-02-10 19:55:54,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:55:54,285 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:55:54,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:54,292 INFO L225 Difference]: With dead ends: 2872 [2020-02-10 19:55:54,292 INFO L226 Difference]: Without dead ends: 2857 [2020-02-10 19:55:54,292 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:55:54,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2857 states. [2020-02-10 19:55:54,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2857 to 1570. [2020-02-10 19:55:54,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 19:55:54,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7042 transitions. [2020-02-10 19:55:54,359 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7042 transitions. Word has length 28 [2020-02-10 19:55:54,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:54,359 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7042 transitions. [2020-02-10 19:55:54,359 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:55:54,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7042 transitions. [2020-02-10 19:55:54,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:55:54,361 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:54,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] [2020-02-10 19:55:54,361 INFO L427 AbstractCegarLoop]: === Iteration 880 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:54,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:54,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1636305292, now seen corresponding path program 872 times [2020-02-10 19:55:54,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:54,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977815033] [2020-02-10 19:55:54,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:54,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:54,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 19:55:54,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977815033] [2020-02-10 19:55:54,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:54,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:55:54,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230341418] [2020-02-10 19:55:54,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:55:54,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:54,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:55:54,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:54,884 INFO L87 Difference]: Start difference. First operand 1570 states and 7042 transitions. Second operand 11 states. [2020-02-10 19:55:55,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:55,114 INFO L93 Difference]: Finished difference Result 2873 states and 11445 transitions. [2020-02-10 19:55:55,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:55:55,115 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:55:55,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:55,122 INFO L225 Difference]: With dead ends: 2873 [2020-02-10 19:55:55,122 INFO L226 Difference]: Without dead ends: 2852 [2020-02-10 19:55:55,122 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:55:55,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2020-02-10 19:55:55,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 1565. [2020-02-10 19:55:55,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1565 states. [2020-02-10 19:55:55,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 7030 transitions. [2020-02-10 19:55:55,189 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 7030 transitions. Word has length 28 [2020-02-10 19:55:55,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:55,189 INFO L479 AbstractCegarLoop]: Abstraction has 1565 states and 7030 transitions. [2020-02-10 19:55:55,189 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:55:55,189 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 7030 transitions. [2020-02-10 19:55:55,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:55:55,191 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:55,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] [2020-02-10 19:55:55,192 INFO L427 AbstractCegarLoop]: === Iteration 881 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:55,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:55,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1202891370, now seen corresponding path program 873 times [2020-02-10 19:55:55,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:55,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394175895] [2020-02-10 19:55:55,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:55,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:55,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 19:55:55,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394175895] [2020-02-10 19:55:55,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:55,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:55:55,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909150553] [2020-02-10 19:55:55,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:55:55,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:55,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:55:55,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:55,751 INFO L87 Difference]: Start difference. First operand 1565 states and 7030 transitions. Second operand 11 states. [2020-02-10 19:55:55,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:55,977 INFO L93 Difference]: Finished difference Result 2867 states and 11433 transitions. [2020-02-10 19:55:55,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:55:55,977 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:55:55,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:55,984 INFO L225 Difference]: With dead ends: 2867 [2020-02-10 19:55:55,984 INFO L226 Difference]: Without dead ends: 2852 [2020-02-10 19:55:55,984 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:55:56,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2020-02-10 19:55:56,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 1568. [2020-02-10 19:55:56,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 19:55:56,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7035 transitions. [2020-02-10 19:55:56,053 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7035 transitions. Word has length 28 [2020-02-10 19:55:56,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:56,053 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7035 transitions. [2020-02-10 19:55:56,054 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:55:56,054 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7035 transitions. [2020-02-10 19:55:56,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:55:56,056 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:56,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] [2020-02-10 19:55:56,056 INFO L427 AbstractCegarLoop]: === Iteration 882 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:56,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:56,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1744945170, now seen corresponding path program 874 times [2020-02-10 19:55:56,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:56,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420752562] [2020-02-10 19:55:56,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:56,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:56,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:56,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420752562] [2020-02-10 19:55:56,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:56,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:55:56,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852045350] [2020-02-10 19:55:56,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:55:56,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:56,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:55:56,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:56,560 INFO L87 Difference]: Start difference. First operand 1568 states and 7035 transitions. Second operand 11 states. [2020-02-10 19:55:56,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:56,793 INFO L93 Difference]: Finished difference Result 2865 states and 11426 transitions. [2020-02-10 19:55:56,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:55:56,794 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:55:56,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:56,800 INFO L225 Difference]: With dead ends: 2865 [2020-02-10 19:55:56,801 INFO L226 Difference]: Without dead ends: 2849 [2020-02-10 19:55:56,801 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:55:56,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2849 states. [2020-02-10 19:55:56,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2849 to 1565. [2020-02-10 19:55:56,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1565 states. [2020-02-10 19:55:56,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 7027 transitions. [2020-02-10 19:55:56,867 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 7027 transitions. Word has length 28 [2020-02-10 19:55:56,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:56,867 INFO L479 AbstractCegarLoop]: Abstraction has 1565 states and 7027 transitions. [2020-02-10 19:55:56,868 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:55:56,868 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 7027 transitions. [2020-02-10 19:55:56,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:55:56,870 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:56,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] [2020-02-10 19:55:56,870 INFO L427 AbstractCegarLoop]: === Iteration 883 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:56,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:56,870 INFO L82 PathProgramCache]: Analyzing trace with hash -447685768, now seen corresponding path program 875 times [2020-02-10 19:55:56,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:56,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688327360] [2020-02-10 19:55:56,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:56,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:57,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:57,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688327360] [2020-02-10 19:55:57,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:57,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:55:57,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899525470] [2020-02-10 19:55:57,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:55:57,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:57,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:55:57,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:57,384 INFO L87 Difference]: Start difference. First operand 1565 states and 7027 transitions. Second operand 11 states. [2020-02-10 19:55:57,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:57,572 INFO L93 Difference]: Finished difference Result 2869 states and 11434 transitions. [2020-02-10 19:55:57,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:55:57,572 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:55:57,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:57,580 INFO L225 Difference]: With dead ends: 2869 [2020-02-10 19:55:57,580 INFO L226 Difference]: Without dead ends: 2853 [2020-02-10 19:55:57,580 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:55:57,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2853 states. [2020-02-10 19:55:57,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2853 to 1568. [2020-02-10 19:55:57,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2020-02-10 19:55:57,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 7032 transitions. [2020-02-10 19:55:57,650 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 7032 transitions. Word has length 28 [2020-02-10 19:55:57,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:57,650 INFO L479 AbstractCegarLoop]: Abstraction has 1568 states and 7032 transitions. [2020-02-10 19:55:57,650 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:55:57,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 7032 transitions. [2020-02-10 19:55:57,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:55:57,652 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:57,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] [2020-02-10 19:55:57,652 INFO L427 AbstractCegarLoop]: === Iteration 884 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:57,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:57,653 INFO L82 PathProgramCache]: Analyzing trace with hash 144507316, now seen corresponding path program 876 times [2020-02-10 19:55:57,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:57,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721054212] [2020-02-10 19:55:57,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:57,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:58,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:55:58,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721054212] [2020-02-10 19:55:58,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:58,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:55:58,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615230132] [2020-02-10 19:55:58,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:55:58,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:58,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:55:58,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:58,157 INFO L87 Difference]: Start difference. First operand 1568 states and 7032 transitions. Second operand 11 states. [2020-02-10 19:55:58,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:58,362 INFO L93 Difference]: Finished difference Result 2866 states and 11425 transitions. [2020-02-10 19:55:58,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:55:58,363 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:55:58,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:58,370 INFO L225 Difference]: With dead ends: 2866 [2020-02-10 19:55:58,370 INFO L226 Difference]: Without dead ends: 2847 [2020-02-10 19:55:58,370 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:55:58,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2847 states. [2020-02-10 19:55:58,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2847 to 1562. [2020-02-10 19:55:58,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1562 states. [2020-02-10 19:55:58,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1562 states to 1562 states and 7019 transitions. [2020-02-10 19:55:58,440 INFO L78 Accepts]: Start accepts. Automaton has 1562 states and 7019 transitions. Word has length 28 [2020-02-10 19:55:58,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:58,440 INFO L479 AbstractCegarLoop]: Abstraction has 1562 states and 7019 transitions. [2020-02-10 19:55:58,440 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:55:58,440 INFO L276 IsEmpty]: Start isEmpty. Operand 1562 states and 7019 transitions. [2020-02-10 19:55:58,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:55:58,443 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:58,443 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:58,443 INFO L427 AbstractCegarLoop]: === Iteration 885 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:58,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:58,443 INFO L82 PathProgramCache]: Analyzing trace with hash -444470608, now seen corresponding path program 877 times [2020-02-10 19:55:58,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:58,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828482918] [2020-02-10 19:55:58,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:58,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:58,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 19:55:58,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828482918] [2020-02-10 19:55:58,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:58,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:55:58,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353888139] [2020-02-10 19:55:58,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:55:58,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:58,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:55:58,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:58,943 INFO L87 Difference]: Start difference. First operand 1562 states and 7019 transitions. Second operand 11 states. [2020-02-10 19:55:59,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:59,181 INFO L93 Difference]: Finished difference Result 2884 states and 11468 transitions. [2020-02-10 19:55:59,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:55:59,182 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:55:59,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:59,188 INFO L225 Difference]: With dead ends: 2884 [2020-02-10 19:55:59,189 INFO L226 Difference]: Without dead ends: 2869 [2020-02-10 19:55:59,189 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:55:59,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2869 states. [2020-02-10 19:55:59,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2869 to 1572. [2020-02-10 19:55:59,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 19:55:59,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7044 transitions. [2020-02-10 19:55:59,256 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7044 transitions. Word has length 28 [2020-02-10 19:55:59,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:59,256 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7044 transitions. [2020-02-10 19:55:59,256 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:55:59,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7044 transitions. [2020-02-10 19:55:59,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:55:59,258 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:59,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] [2020-02-10 19:55:59,258 INFO L427 AbstractCegarLoop]: === Iteration 886 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:59,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:59,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1044934388, now seen corresponding path program 878 times [2020-02-10 19:55:59,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:59,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698278128] [2020-02-10 19:55:59,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:59,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:55:59,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 19:55:59,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698278128] [2020-02-10 19:55:59,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:55:59,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:55:59,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250778300] [2020-02-10 19:55:59,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:55:59,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:55:59,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:55:59,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:55:59,765 INFO L87 Difference]: Start difference. First operand 1572 states and 7044 transitions. Second operand 11 states. [2020-02-10 19:55:59,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:55:59,912 INFO L93 Difference]: Finished difference Result 2889 states and 11472 transitions. [2020-02-10 19:55:59,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:55:59,913 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:55:59,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:55:59,920 INFO L225 Difference]: With dead ends: 2889 [2020-02-10 19:55:59,920 INFO L226 Difference]: Without dead ends: 2863 [2020-02-10 19:55:59,920 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:55:59,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2863 states. [2020-02-10 19:55:59,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2863 to 1566. [2020-02-10 19:55:59,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1566 states. [2020-02-10 19:55:59,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 7029 transitions. [2020-02-10 19:55:59,987 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 7029 transitions. Word has length 28 [2020-02-10 19:55:59,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:55:59,988 INFO L479 AbstractCegarLoop]: Abstraction has 1566 states and 7029 transitions. [2020-02-10 19:55:59,988 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:55:59,988 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 7029 transitions. [2020-02-10 19:55:59,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:55:59,990 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:55:59,990 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:55:59,990 INFO L427 AbstractCegarLoop]: === Iteration 887 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:55:59,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:55:59,990 INFO L82 PathProgramCache]: Analyzing trace with hash 723142708, now seen corresponding path program 879 times [2020-02-10 19:55:59,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:55:59,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297339104] [2020-02-10 19:55:59,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:55:59,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:00,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 19:56:00,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297339104] [2020-02-10 19:56:00,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:00,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:56:00,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720420271] [2020-02-10 19:56:00,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:56:00,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:00,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:56:00,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:00,508 INFO L87 Difference]: Start difference. First operand 1566 states and 7029 transitions. Second operand 11 states. [2020-02-10 19:56:00,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:00,703 INFO L93 Difference]: Finished difference Result 2874 states and 11443 transitions. [2020-02-10 19:56:00,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:56:00,703 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:56:00,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:00,710 INFO L225 Difference]: With dead ends: 2874 [2020-02-10 19:56:00,710 INFO L226 Difference]: Without dead ends: 2859 [2020-02-10 19:56:00,710 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:56:00,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2859 states. [2020-02-10 19:56:00,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2859 to 1569. [2020-02-10 19:56:00,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 19:56:00,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7034 transitions. [2020-02-10 19:56:00,777 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7034 transitions. Word has length 28 [2020-02-10 19:56:00,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:00,777 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7034 transitions. [2020-02-10 19:56:00,777 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:56:00,777 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7034 transitions. [2020-02-10 19:56:00,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:56:00,779 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:00,779 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:00,780 INFO L427 AbstractCegarLoop]: === Iteration 888 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:00,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:00,780 INFO L82 PathProgramCache]: Analyzing trace with hash -623988048, now seen corresponding path program 880 times [2020-02-10 19:56:00,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:00,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871237063] [2020-02-10 19:56:00,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:00,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:01,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 19:56:01,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871237063] [2020-02-10 19:56:01,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:01,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:56:01,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789004714] [2020-02-10 19:56:01,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:56:01,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:01,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:56:01,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:01,290 INFO L87 Difference]: Start difference. First operand 1569 states and 7034 transitions. Second operand 11 states. [2020-02-10 19:56:01,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:01,536 INFO L93 Difference]: Finished difference Result 2872 states and 11436 transitions. [2020-02-10 19:56:01,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:56:01,536 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:56:01,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:01,544 INFO L225 Difference]: With dead ends: 2872 [2020-02-10 19:56:01,544 INFO L226 Difference]: Without dead ends: 2856 [2020-02-10 19:56:01,544 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:56:01,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2856 states. [2020-02-10 19:56:01,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2856 to 1566. [2020-02-10 19:56:01,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1566 states. [2020-02-10 19:56:01,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 7026 transitions. [2020-02-10 19:56:01,652 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 7026 transitions. Word has length 28 [2020-02-10 19:56:01,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:01,652 INFO L479 AbstractCegarLoop]: Abstraction has 1566 states and 7026 transitions. [2020-02-10 19:56:01,652 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:56:01,652 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 7026 transitions. [2020-02-10 19:56:01,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:56:01,654 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:01,654 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:01,654 INFO L427 AbstractCegarLoop]: === Iteration 889 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:01,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:01,655 INFO L82 PathProgramCache]: Analyzing trace with hash -2061413384, now seen corresponding path program 881 times [2020-02-10 19:56:01,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:01,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201940784] [2020-02-10 19:56:01,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:01,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:02,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:02,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201940784] [2020-02-10 19:56:02,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:02,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:56:02,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091597866] [2020-02-10 19:56:02,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:56:02,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:02,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:56:02,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:02,152 INFO L87 Difference]: Start difference. First operand 1566 states and 7026 transitions. Second operand 11 states. [2020-02-10 19:56:02,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:02,347 INFO L93 Difference]: Finished difference Result 2885 states and 11460 transitions. [2020-02-10 19:56:02,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:56:02,348 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:56:02,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:02,354 INFO L225 Difference]: With dead ends: 2885 [2020-02-10 19:56:02,355 INFO L226 Difference]: Without dead ends: 2865 [2020-02-10 19:56:02,355 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:56:02,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2865 states. [2020-02-10 19:56:02,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2865 to 1570. [2020-02-10 19:56:02,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 19:56:02,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7032 transitions. [2020-02-10 19:56:02,422 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7032 transitions. Word has length 28 [2020-02-10 19:56:02,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:02,422 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7032 transitions. [2020-02-10 19:56:02,422 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:56:02,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7032 transitions. [2020-02-10 19:56:02,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:56:02,424 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:02,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] [2020-02-10 19:56:02,425 INFO L427 AbstractCegarLoop]: === Iteration 890 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:02,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:02,425 INFO L82 PathProgramCache]: Analyzing trace with hash 470103540, now seen corresponding path program 882 times [2020-02-10 19:56:02,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:02,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835004974] [2020-02-10 19:56:02,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:02,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:02,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:02,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835004974] [2020-02-10 19:56:02,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:02,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:56:02,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041548111] [2020-02-10 19:56:02,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:56:02,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:02,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:56:02,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:02,921 INFO L87 Difference]: Start difference. First operand 1570 states and 7032 transitions. Second operand 11 states. [2020-02-10 19:56:03,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:03,120 INFO L93 Difference]: Finished difference Result 2878 states and 11443 transitions. [2020-02-10 19:56:03,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:56:03,121 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:56:03,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:03,128 INFO L225 Difference]: With dead ends: 2878 [2020-02-10 19:56:03,128 INFO L226 Difference]: Without dead ends: 2857 [2020-02-10 19:56:03,128 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:56:03,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2857 states. [2020-02-10 19:56:03,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2857 to 1562. [2020-02-10 19:56:03,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1562 states. [2020-02-10 19:56:03,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1562 states to 1562 states and 7015 transitions. [2020-02-10 19:56:03,196 INFO L78 Accepts]: Start accepts. Automaton has 1562 states and 7015 transitions. Word has length 28 [2020-02-10 19:56:03,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:03,196 INFO L479 AbstractCegarLoop]: Abstraction has 1562 states and 7015 transitions. [2020-02-10 19:56:03,196 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:56:03,196 INFO L276 IsEmpty]: Start isEmpty. Operand 1562 states and 7015 transitions. [2020-02-10 19:56:03,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:56:03,198 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:03,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] [2020-02-10 19:56:03,198 INFO L427 AbstractCegarLoop]: === Iteration 891 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:03,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:03,199 INFO L82 PathProgramCache]: Analyzing trace with hash -2058198224, now seen corresponding path program 883 times [2020-02-10 19:56:03,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:03,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908931173] [2020-02-10 19:56:03,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:03,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:03,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:03,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908931173] [2020-02-10 19:56:03,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:03,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:56:03,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847312584] [2020-02-10 19:56:03,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:56:03,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:03,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:56:03,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:03,719 INFO L87 Difference]: Start difference. First operand 1562 states and 7015 transitions. Second operand 11 states. [2020-02-10 19:56:03,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:03,894 INFO L93 Difference]: Finished difference Result 2889 states and 11476 transitions. [2020-02-10 19:56:03,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:56:03,895 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:56:03,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:03,902 INFO L225 Difference]: With dead ends: 2889 [2020-02-10 19:56:03,902 INFO L226 Difference]: Without dead ends: 2873 [2020-02-10 19:56:03,902 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:56:03,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2873 states. [2020-02-10 19:56:03,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2873 to 1573. [2020-02-10 19:56:03,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 19:56:03,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7042 transitions. [2020-02-10 19:56:03,969 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7042 transitions. Word has length 28 [2020-02-10 19:56:03,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:03,969 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7042 transitions. [2020-02-10 19:56:03,969 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:56:03,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7042 transitions. [2020-02-10 19:56:03,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:56:03,972 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:03,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] [2020-02-10 19:56:03,972 INFO L427 AbstractCegarLoop]: === Iteration 892 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:03,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:03,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1313495726, now seen corresponding path program 884 times [2020-02-10 19:56:03,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:03,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860547485] [2020-02-10 19:56:03,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:03,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:04,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:04,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860547485] [2020-02-10 19:56:04,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:04,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:56:04,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143149077] [2020-02-10 19:56:04,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:56:04,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:04,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:56:04,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:04,512 INFO L87 Difference]: Start difference. First operand 1573 states and 7042 transitions. Second operand 11 states. [2020-02-10 19:56:04,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:04,654 INFO L93 Difference]: Finished difference Result 2893 states and 11477 transitions. [2020-02-10 19:56:04,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:56:04,655 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:56:04,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:04,662 INFO L225 Difference]: With dead ends: 2893 [2020-02-10 19:56:04,662 INFO L226 Difference]: Without dead ends: 2866 [2020-02-10 19:56:04,662 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:56:04,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2866 states. [2020-02-10 19:56:04,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2866 to 1566. [2020-02-10 19:56:04,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1566 states. [2020-02-10 19:56:04,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 7025 transitions. [2020-02-10 19:56:04,728 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 7025 transitions. Word has length 28 [2020-02-10 19:56:04,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:04,728 INFO L479 AbstractCegarLoop]: Abstraction has 1566 states and 7025 transitions. [2020-02-10 19:56:04,728 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:56:04,728 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 7025 transitions. [2020-02-10 19:56:04,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:56:04,731 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:04,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] [2020-02-10 19:56:04,731 INFO L427 AbstractCegarLoop]: === Iteration 893 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:04,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:04,731 INFO L82 PathProgramCache]: Analyzing trace with hash -890584908, now seen corresponding path program 885 times [2020-02-10 19:56:04,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:04,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56650719] [2020-02-10 19:56:04,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:04,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:05,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 19:56:05,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56650719] [2020-02-10 19:56:05,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:05,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:56:05,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372479872] [2020-02-10 19:56:05,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:56:05,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:05,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:56:05,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:05,252 INFO L87 Difference]: Start difference. First operand 1566 states and 7025 transitions. Second operand 11 states. [2020-02-10 19:56:05,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:05,463 INFO L93 Difference]: Finished difference Result 2878 states and 11448 transitions. [2020-02-10 19:56:05,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:56:05,463 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:56:05,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:05,470 INFO L225 Difference]: With dead ends: 2878 [2020-02-10 19:56:05,470 INFO L226 Difference]: Without dead ends: 2862 [2020-02-10 19:56:05,470 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:56:05,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2862 states. [2020-02-10 19:56:05,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2862 to 1569. [2020-02-10 19:56:05,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 19:56:05,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7030 transitions. [2020-02-10 19:56:05,537 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7030 transitions. Word has length 28 [2020-02-10 19:56:05,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:05,537 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7030 transitions. [2020-02-10 19:56:05,537 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:56:05,537 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7030 transitions. [2020-02-10 19:56:05,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:56:05,540 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:05,540 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:05,540 INFO L427 AbstractCegarLoop]: === Iteration 894 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:05,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:05,540 INFO L82 PathProgramCache]: Analyzing trace with hash -298391824, now seen corresponding path program 886 times [2020-02-10 19:56:05,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:05,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834299009] [2020-02-10 19:56:05,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:05,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:06,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 19:56:06,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834299009] [2020-02-10 19:56:06,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:06,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:56:06,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223858876] [2020-02-10 19:56:06,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:56:06,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:06,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:56:06,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:06,071 INFO L87 Difference]: Start difference. First operand 1569 states and 7030 transitions. Second operand 11 states. [2020-02-10 19:56:06,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:06,288 INFO L93 Difference]: Finished difference Result 2875 states and 11439 transitions. [2020-02-10 19:56:06,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:56:06,289 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:56:06,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:06,296 INFO L225 Difference]: With dead ends: 2875 [2020-02-10 19:56:06,296 INFO L226 Difference]: Without dead ends: 2859 [2020-02-10 19:56:06,296 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:56:06,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2859 states. [2020-02-10 19:56:06,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2859 to 1566. [2020-02-10 19:56:06,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1566 states. [2020-02-10 19:56:06,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 7022 transitions. [2020-02-10 19:56:06,364 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 7022 transitions. Word has length 28 [2020-02-10 19:56:06,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:06,364 INFO L479 AbstractCegarLoop]: Abstraction has 1566 states and 7022 transitions. [2020-02-10 19:56:06,364 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:56:06,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 7022 transitions. [2020-02-10 19:56:06,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:56:06,366 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:06,366 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:06,366 INFO L427 AbstractCegarLoop]: === Iteration 895 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:06,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:06,366 INFO L82 PathProgramCache]: Analyzing trace with hash -135379306, now seen corresponding path program 887 times [2020-02-10 19:56:06,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:06,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925958203] [2020-02-10 19:56:06,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:06,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:06,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 19:56:06,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925958203] [2020-02-10 19:56:06,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:06,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:56:06,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260241616] [2020-02-10 19:56:06,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:56:06,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:06,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:56:06,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:06,883 INFO L87 Difference]: Start difference. First operand 1566 states and 7022 transitions. Second operand 11 states. [2020-02-10 19:56:07,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:07,075 INFO L93 Difference]: Finished difference Result 2887 states and 11461 transitions. [2020-02-10 19:56:07,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:56:07,075 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:56:07,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:07,082 INFO L225 Difference]: With dead ends: 2887 [2020-02-10 19:56:07,082 INFO L226 Difference]: Without dead ends: 2867 [2020-02-10 19:56:07,082 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:56:07,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2867 states. [2020-02-10 19:56:07,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2867 to 1570. [2020-02-10 19:56:07,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 19:56:07,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7028 transitions. [2020-02-10 19:56:07,149 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7028 transitions. Word has length 28 [2020-02-10 19:56:07,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:07,149 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7028 transitions. [2020-02-10 19:56:07,149 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:56:07,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7028 transitions. [2020-02-10 19:56:07,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:56:07,152 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:07,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] [2020-02-10 19:56:07,152 INFO L427 AbstractCegarLoop]: === Iteration 896 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:07,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:07,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1898829678, now seen corresponding path program 888 times [2020-02-10 19:56:07,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:07,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607288669] [2020-02-10 19:56:07,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:07,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:07,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 19:56:07,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607288669] [2020-02-10 19:56:07,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:07,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:56:07,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426820861] [2020-02-10 19:56:07,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:56:07,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:07,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:56:07,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:07,668 INFO L87 Difference]: Start difference. First operand 1570 states and 7028 transitions. Second operand 11 states. [2020-02-10 19:56:07,869 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 31 [2020-02-10 19:56:07,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:07,890 INFO L93 Difference]: Finished difference Result 2880 states and 11444 transitions. [2020-02-10 19:56:07,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:56:07,890 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:56:07,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:07,897 INFO L225 Difference]: With dead ends: 2880 [2020-02-10 19:56:07,897 INFO L226 Difference]: Without dead ends: 2855 [2020-02-10 19:56:07,898 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:56:07,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2855 states. [2020-02-10 19:56:07,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2855 to 1558. [2020-02-10 19:56:07,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2020-02-10 19:56:07,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 7004 transitions. [2020-02-10 19:56:07,964 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 7004 transitions. Word has length 28 [2020-02-10 19:56:07,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:07,964 INFO L479 AbstractCegarLoop]: Abstraction has 1558 states and 7004 transitions. [2020-02-10 19:56:07,964 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:56:07,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 7004 transitions. [2020-02-10 19:56:07,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:56:07,966 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:07,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] [2020-02-10 19:56:07,966 INFO L427 AbstractCegarLoop]: === Iteration 897 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:07,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:07,966 INFO L82 PathProgramCache]: Analyzing trace with hash 236053416, now seen corresponding path program 889 times [2020-02-10 19:56:07,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:07,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75832984] [2020-02-10 19:56:07,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:07,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:08,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:08,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75832984] [2020-02-10 19:56:08,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:08,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:56:08,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178325654] [2020-02-10 19:56:08,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:56:08,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:08,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:56:08,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:08,489 INFO L87 Difference]: Start difference. First operand 1558 states and 7004 transitions. Second operand 11 states. [2020-02-10 19:56:08,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:08,723 INFO L93 Difference]: Finished difference Result 2875 states and 11459 transitions. [2020-02-10 19:56:08,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:56:08,724 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:56:08,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:08,730 INFO L225 Difference]: With dead ends: 2875 [2020-02-10 19:56:08,731 INFO L226 Difference]: Without dead ends: 2860 [2020-02-10 19:56:08,731 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:56:08,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2860 states. [2020-02-10 19:56:08,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2860 to 1571. [2020-02-10 19:56:08,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 19:56:08,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7046 transitions. [2020-02-10 19:56:08,798 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7046 transitions. Word has length 28 [2020-02-10 19:56:08,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:08,798 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7046 transitions. [2020-02-10 19:56:08,799 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:56:08,799 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7046 transitions. [2020-02-10 19:56:08,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:56:08,801 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:08,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] [2020-02-10 19:56:08,801 INFO L427 AbstractCegarLoop]: === Iteration 898 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:08,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:08,801 INFO L82 PathProgramCache]: Analyzing trace with hash 980755914, now seen corresponding path program 890 times [2020-02-10 19:56:08,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:08,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855012790] [2020-02-10 19:56:08,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:08,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:09,305 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 19:56:09,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 19:56:09,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855012790] [2020-02-10 19:56:09,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:09,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:56:09,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888233559] [2020-02-10 19:56:09,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:56:09,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:09,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:56:09,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:09,315 INFO L87 Difference]: Start difference. First operand 1571 states and 7046 transitions. Second operand 11 states. [2020-02-10 19:56:09,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:09,532 INFO L93 Difference]: Finished difference Result 2876 states and 11456 transitions. [2020-02-10 19:56:09,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:56:09,532 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:56:09,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:09,540 INFO L225 Difference]: With dead ends: 2876 [2020-02-10 19:56:09,540 INFO L226 Difference]: Without dead ends: 2855 [2020-02-10 19:56:09,540 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:56:09,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2855 states. [2020-02-10 19:56:09,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2855 to 1566. [2020-02-10 19:56:09,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1566 states. [2020-02-10 19:56:09,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 7032 transitions. [2020-02-10 19:56:09,607 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 7032 transitions. Word has length 28 [2020-02-10 19:56:09,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:09,607 INFO L479 AbstractCegarLoop]: Abstraction has 1566 states and 7032 transitions. [2020-02-10 19:56:09,607 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:56:09,607 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 7032 transitions. [2020-02-10 19:56:09,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:56:09,609 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:09,609 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:09,610 INFO L427 AbstractCegarLoop]: === Iteration 899 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:09,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:09,610 INFO L82 PathProgramCache]: Analyzing trace with hash -837031964, now seen corresponding path program 891 times [2020-02-10 19:56:09,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:09,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581016610] [2020-02-10 19:56:09,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:09,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:10,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 19:56:10,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581016610] [2020-02-10 19:56:10,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:10,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:56:10,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141734914] [2020-02-10 19:56:10,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:56:10,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:10,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:56:10,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:10,128 INFO L87 Difference]: Start difference. First operand 1566 states and 7032 transitions. Second operand 11 states. [2020-02-10 19:56:10,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:10,388 INFO L93 Difference]: Finished difference Result 2877 states and 11458 transitions. [2020-02-10 19:56:10,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:56:10,389 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:56:10,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:10,396 INFO L225 Difference]: With dead ends: 2877 [2020-02-10 19:56:10,396 INFO L226 Difference]: Without dead ends: 2862 [2020-02-10 19:56:10,396 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:56:10,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2862 states. [2020-02-10 19:56:10,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2862 to 1571. [2020-02-10 19:56:10,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 19:56:10,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7041 transitions. [2020-02-10 19:56:10,463 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7041 transitions. Word has length 28 [2020-02-10 19:56:10,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:10,463 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7041 transitions. [2020-02-10 19:56:10,463 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:56:10,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7041 transitions. [2020-02-10 19:56:10,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:56:10,465 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:10,465 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:10,465 INFO L427 AbstractCegarLoop]: === Iteration 900 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:10,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:10,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1397075530, now seen corresponding path program 892 times [2020-02-10 19:56:10,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:10,466 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233509237] [2020-02-10 19:56:10,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:10,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:10,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 19:56:10,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233509237] [2020-02-10 19:56:10,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:10,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:56:10,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275565281] [2020-02-10 19:56:10,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:56:10,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:10,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:56:10,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:10,965 INFO L87 Difference]: Start difference. First operand 1571 states and 7041 transitions. Second operand 11 states. [2020-02-10 19:56:11,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:11,232 INFO L93 Difference]: Finished difference Result 2880 states and 11459 transitions. [2020-02-10 19:56:11,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:56:11,233 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:56:11,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:11,240 INFO L225 Difference]: With dead ends: 2880 [2020-02-10 19:56:11,240 INFO L226 Difference]: Without dead ends: 2857 [2020-02-10 19:56:11,240 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:56:11,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2857 states. [2020-02-10 19:56:11,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2857 to 1566. [2020-02-10 19:56:11,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1566 states. [2020-02-10 19:56:11,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 7027 transitions. [2020-02-10 19:56:11,307 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 7027 transitions. Word has length 28 [2020-02-10 19:56:11,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:11,308 INFO L479 AbstractCegarLoop]: Abstraction has 1566 states and 7027 transitions. [2020-02-10 19:56:11,308 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:56:11,308 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 7027 transitions. [2020-02-10 19:56:11,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:56:11,310 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:11,310 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:11,310 INFO L427 AbstractCegarLoop]: === Iteration 901 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:11,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:11,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1518611492, now seen corresponding path program 893 times [2020-02-10 19:56:11,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:11,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67936813] [2020-02-10 19:56:11,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:11,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:11,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 19:56:11,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67936813] [2020-02-10 19:56:11,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:11,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:56:11,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116351835] [2020-02-10 19:56:11,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:56:11,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:11,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:56:11,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:11,829 INFO L87 Difference]: Start difference. First operand 1566 states and 7027 transitions. Second operand 11 states. [2020-02-10 19:56:12,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:12,098 INFO L93 Difference]: Finished difference Result 2880 states and 11460 transitions. [2020-02-10 19:56:12,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:56:12,099 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:56:12,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:12,106 INFO L225 Difference]: With dead ends: 2880 [2020-02-10 19:56:12,106 INFO L226 Difference]: Without dead ends: 2864 [2020-02-10 19:56:12,106 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:56:12,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2864 states. [2020-02-10 19:56:12,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2864 to 1572. [2020-02-10 19:56:12,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-02-10 19:56:12,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 7038 transitions. [2020-02-10 19:56:12,173 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 7038 transitions. Word has length 28 [2020-02-10 19:56:12,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:12,173 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 7038 transitions. [2020-02-10 19:56:12,173 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:56:12,174 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 7038 transitions. [2020-02-10 19:56:12,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:56:12,176 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:12,176 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:12,176 INFO L427 AbstractCegarLoop]: === Iteration 902 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:12,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:12,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1286950808, now seen corresponding path program 894 times [2020-02-10 19:56:12,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:12,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618264090] [2020-02-10 19:56:12,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:12,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:12,672 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 19:56:12,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 19:56:12,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618264090] [2020-02-10 19:56:12,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:12,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:56:12,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144428453] [2020-02-10 19:56:12,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:56:12,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:12,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:56:12,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:12,680 INFO L87 Difference]: Start difference. First operand 1572 states and 7038 transitions. Second operand 11 states. [2020-02-10 19:56:12,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:12,952 INFO L93 Difference]: Finished difference Result 2882 states and 11458 transitions. [2020-02-10 19:56:12,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:56:12,953 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:56:12,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:12,960 INFO L225 Difference]: With dead ends: 2882 [2020-02-10 19:56:12,961 INFO L226 Difference]: Without dead ends: 2853 [2020-02-10 19:56:12,961 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:56:13,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2853 states. [2020-02-10 19:56:13,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2853 to 1561. [2020-02-10 19:56:13,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1561 states. [2020-02-10 19:56:13,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 7015 transitions. [2020-02-10 19:56:13,027 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 7015 transitions. Word has length 28 [2020-02-10 19:56:13,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:13,027 INFO L479 AbstractCegarLoop]: Abstraction has 1561 states and 7015 transitions. [2020-02-10 19:56:13,027 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:56:13,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 7015 transitions. [2020-02-10 19:56:13,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:56:13,029 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:13,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] [2020-02-10 19:56:13,030 INFO L427 AbstractCegarLoop]: === Iteration 903 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:13,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:13,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1746731620, now seen corresponding path program 895 times [2020-02-10 19:56:13,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:13,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984460731] [2020-02-10 19:56:13,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:13,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:13,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:13,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984460731] [2020-02-10 19:56:13,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:13,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:56:13,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810975317] [2020-02-10 19:56:13,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:56:13,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:13,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:56:13,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:13,558 INFO L87 Difference]: Start difference. First operand 1561 states and 7015 transitions. Second operand 11 states. [2020-02-10 19:56:13,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:13,829 INFO L93 Difference]: Finished difference Result 2863 states and 11423 transitions. [2020-02-10 19:56:13,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:56:13,829 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:56:13,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:13,836 INFO L225 Difference]: With dead ends: 2863 [2020-02-10 19:56:13,836 INFO L226 Difference]: Without dead ends: 2848 [2020-02-10 19:56:13,836 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:56:13,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2848 states. [2020-02-10 19:56:13,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2848 to 1569. [2020-02-10 19:56:13,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 19:56:13,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7035 transitions. [2020-02-10 19:56:13,903 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7035 transitions. Word has length 28 [2020-02-10 19:56:13,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:13,903 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7035 transitions. [2020-02-10 19:56:13,903 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:56:13,903 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7035 transitions. [2020-02-10 19:56:13,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:56:13,906 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:13,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] [2020-02-10 19:56:13,906 INFO L427 AbstractCegarLoop]: === Iteration 904 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:13,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:13,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1803533178, now seen corresponding path program 896 times [2020-02-10 19:56:13,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:13,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640468308] [2020-02-10 19:56:13,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:13,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:14,351 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 30 [2020-02-10 19:56:14,467 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 19:56:14,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:14,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640468308] [2020-02-10 19:56:14,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:14,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:56:14,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143709024] [2020-02-10 19:56:14,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:56:14,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:14,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:56:14,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:14,475 INFO L87 Difference]: Start difference. First operand 1569 states and 7035 transitions. Second operand 11 states. [2020-02-10 19:56:14,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:14,746 INFO L93 Difference]: Finished difference Result 2864 states and 11420 transitions. [2020-02-10 19:56:14,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:56:14,746 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:56:14,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:14,754 INFO L225 Difference]: With dead ends: 2864 [2020-02-10 19:56:14,754 INFO L226 Difference]: Without dead ends: 2843 [2020-02-10 19:56:14,754 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:56:14,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2843 states. [2020-02-10 19:56:14,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2843 to 1564. [2020-02-10 19:56:14,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1564 states. [2020-02-10 19:56:14,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 7023 transitions. [2020-02-10 19:56:14,821 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 7023 transitions. Word has length 28 [2020-02-10 19:56:14,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:14,821 INFO L479 AbstractCegarLoop]: Abstraction has 1564 states and 7023 transitions. [2020-02-10 19:56:14,821 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:56:14,821 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 7023 transitions. [2020-02-10 19:56:14,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:56:14,823 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:14,823 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:14,823 INFO L427 AbstractCegarLoop]: === Iteration 905 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:14,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:14,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1370119256, now seen corresponding path program 897 times [2020-02-10 19:56:14,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:14,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789850543] [2020-02-10 19:56:14,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:14,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:15,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 19:56:15,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789850543] [2020-02-10 19:56:15,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:15,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:56:15,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291131919] [2020-02-10 19:56:15,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:56:15,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:15,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:56:15,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:15,347 INFO L87 Difference]: Start difference. First operand 1564 states and 7023 transitions. Second operand 11 states. [2020-02-10 19:56:15,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:15,582 INFO L93 Difference]: Finished difference Result 2858 states and 11408 transitions. [2020-02-10 19:56:15,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:56:15,582 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:56:15,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:15,589 INFO L225 Difference]: With dead ends: 2858 [2020-02-10 19:56:15,589 INFO L226 Difference]: Without dead ends: 2843 [2020-02-10 19:56:15,589 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:56:15,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2843 states. [2020-02-10 19:56:15,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2843 to 1567. [2020-02-10 19:56:15,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 19:56:15,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7028 transitions. [2020-02-10 19:56:15,656 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7028 transitions. Word has length 28 [2020-02-10 19:56:15,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:15,656 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7028 transitions. [2020-02-10 19:56:15,656 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:56:15,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7028 transitions. [2020-02-10 19:56:15,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:56:15,658 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:15,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] [2020-02-10 19:56:15,658 INFO L427 AbstractCegarLoop]: === Iteration 906 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:15,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:15,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1577717284, now seen corresponding path program 898 times [2020-02-10 19:56:15,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:15,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300470120] [2020-02-10 19:56:15,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:15,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:16,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:16,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300470120] [2020-02-10 19:56:16,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:16,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:56:16,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442195761] [2020-02-10 19:56:16,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:56:16,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:16,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:56:16,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:16,173 INFO L87 Difference]: Start difference. First operand 1567 states and 7028 transitions. Second operand 11 states. [2020-02-10 19:56:16,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:16,396 INFO L93 Difference]: Finished difference Result 2856 states and 11401 transitions. [2020-02-10 19:56:16,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:56:16,396 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:56:16,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:16,403 INFO L225 Difference]: With dead ends: 2856 [2020-02-10 19:56:16,403 INFO L226 Difference]: Without dead ends: 2840 [2020-02-10 19:56:16,403 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:56:16,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2840 states. [2020-02-10 19:56:16,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2840 to 1564. [2020-02-10 19:56:16,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1564 states. [2020-02-10 19:56:16,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 7020 transitions. [2020-02-10 19:56:16,469 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 7020 transitions. Word has length 28 [2020-02-10 19:56:16,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:16,470 INFO L479 AbstractCegarLoop]: Abstraction has 1564 states and 7020 transitions. [2020-02-10 19:56:16,470 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:56:16,470 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 7020 transitions. [2020-02-10 19:56:16,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:56:16,472 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:16,472 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:16,472 INFO L427 AbstractCegarLoop]: === Iteration 907 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:16,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:16,472 INFO L82 PathProgramCache]: Analyzing trace with hash -614913654, now seen corresponding path program 899 times [2020-02-10 19:56:16,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:16,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36088668] [2020-02-10 19:56:16,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:16,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:16,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 19:56:16,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36088668] [2020-02-10 19:56:16,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:16,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:56:16,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125099076] [2020-02-10 19:56:16,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:56:16,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:16,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:56:16,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:16,988 INFO L87 Difference]: Start difference. First operand 1564 states and 7020 transitions. Second operand 11 states. [2020-02-10 19:56:17,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:17,187 INFO L93 Difference]: Finished difference Result 2860 states and 11409 transitions. [2020-02-10 19:56:17,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:56:17,188 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:56:17,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:17,195 INFO L225 Difference]: With dead ends: 2860 [2020-02-10 19:56:17,195 INFO L226 Difference]: Without dead ends: 2844 [2020-02-10 19:56:17,195 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:56:17,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2844 states. [2020-02-10 19:56:17,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2844 to 1567. [2020-02-10 19:56:17,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 19:56:17,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7025 transitions. [2020-02-10 19:56:17,261 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7025 transitions. Word has length 28 [2020-02-10 19:56:17,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:17,262 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7025 transitions. [2020-02-10 19:56:17,262 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:56:17,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7025 transitions. [2020-02-10 19:56:17,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:56:17,264 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:17,264 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:17,264 INFO L427 AbstractCegarLoop]: === Iteration 908 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:17,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:17,264 INFO L82 PathProgramCache]: Analyzing trace with hash -22720570, now seen corresponding path program 900 times [2020-02-10 19:56:17,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:17,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050481355] [2020-02-10 19:56:17,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:17,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:17,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:17,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050481355] [2020-02-10 19:56:17,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:17,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:56:17,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622495358] [2020-02-10 19:56:17,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:56:17,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:17,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:56:17,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:17,770 INFO L87 Difference]: Start difference. First operand 1567 states and 7025 transitions. Second operand 11 states. [2020-02-10 19:56:18,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:18,040 INFO L93 Difference]: Finished difference Result 2857 states and 11400 transitions. [2020-02-10 19:56:18,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:56:18,041 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:56:18,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:18,048 INFO L225 Difference]: With dead ends: 2857 [2020-02-10 19:56:18,048 INFO L226 Difference]: Without dead ends: 2838 [2020-02-10 19:56:18,048 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:56:18,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2838 states. [2020-02-10 19:56:18,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2838 to 1561. [2020-02-10 19:56:18,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1561 states. [2020-02-10 19:56:18,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 7012 transitions. [2020-02-10 19:56:18,115 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 7012 transitions. Word has length 28 [2020-02-10 19:56:18,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:18,115 INFO L479 AbstractCegarLoop]: Abstraction has 1561 states and 7012 transitions. [2020-02-10 19:56:18,115 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:56:18,115 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 7012 transitions. [2020-02-10 19:56:18,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:56:18,118 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:18,118 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:18,118 INFO L427 AbstractCegarLoop]: === Iteration 909 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:18,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:18,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1324838688, now seen corresponding path program 901 times [2020-02-10 19:56:18,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:18,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051074127] [2020-02-10 19:56:18,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:18,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:18,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:18,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051074127] [2020-02-10 19:56:18,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:18,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:56:18,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720430985] [2020-02-10 19:56:18,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:56:18,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:18,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:56:18,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:18,612 INFO L87 Difference]: Start difference. First operand 1561 states and 7012 transitions. Second operand 11 states. [2020-02-10 19:56:18,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:18,814 INFO L93 Difference]: Finished difference Result 2867 states and 11428 transitions. [2020-02-10 19:56:18,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:56:18,815 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:56:18,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:18,822 INFO L225 Difference]: With dead ends: 2867 [2020-02-10 19:56:18,822 INFO L226 Difference]: Without dead ends: 2852 [2020-02-10 19:56:18,823 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:56:18,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2020-02-10 19:56:18,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 1569. [2020-02-10 19:56:18,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2020-02-10 19:56:18,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 7032 transitions. [2020-02-10 19:56:18,889 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 7032 transitions. Word has length 28 [2020-02-10 19:56:18,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:18,890 INFO L479 AbstractCegarLoop]: Abstraction has 1569 states and 7032 transitions. [2020-02-10 19:56:18,890 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:56:18,890 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 7032 transitions. [2020-02-10 19:56:18,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:56:18,892 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:18,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] [2020-02-10 19:56:18,892 INFO L427 AbstractCegarLoop]: === Iteration 910 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:18,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:18,892 INFO L82 PathProgramCache]: Analyzing trace with hash -736021114, now seen corresponding path program 902 times [2020-02-10 19:56:18,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:18,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33320325] [2020-02-10 19:56:18,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:18,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:19,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 19:56:19,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33320325] [2020-02-10 19:56:19,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:19,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:56:19,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820711228] [2020-02-10 19:56:19,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:56:19,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:19,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:56:19,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:19,386 INFO L87 Difference]: Start difference. First operand 1569 states and 7032 transitions. Second operand 11 states. [2020-02-10 19:56:19,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:19,581 INFO L93 Difference]: Finished difference Result 2870 states and 11429 transitions. [2020-02-10 19:56:19,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:56:19,581 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:56:19,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:19,588 INFO L225 Difference]: With dead ends: 2870 [2020-02-10 19:56:19,588 INFO L226 Difference]: Without dead ends: 2847 [2020-02-10 19:56:19,588 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:56:19,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2847 states. [2020-02-10 19:56:19,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2847 to 1564. [2020-02-10 19:56:19,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1564 states. [2020-02-10 19:56:19,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 7020 transitions. [2020-02-10 19:56:19,654 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 7020 transitions. Word has length 28 [2020-02-10 19:56:19,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:19,654 INFO L479 AbstractCegarLoop]: Abstraction has 1564 states and 7020 transitions. [2020-02-10 19:56:19,654 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:56:19,655 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 7020 transitions. [2020-02-10 19:56:19,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:56:19,657 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:19,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] [2020-02-10 19:56:19,657 INFO L427 AbstractCegarLoop]: === Iteration 911 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:19,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:19,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1813018396, now seen corresponding path program 903 times [2020-02-10 19:56:19,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:19,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786055771] [2020-02-10 19:56:19,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:19,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:20,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:20,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786055771] [2020-02-10 19:56:20,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:20,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:56:20,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846805309] [2020-02-10 19:56:20,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:56:20,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:20,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:56:20,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:20,159 INFO L87 Difference]: Start difference. First operand 1564 states and 7020 transitions. Second operand 11 states. [2020-02-10 19:56:20,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:20,333 INFO L93 Difference]: Finished difference Result 2860 states and 11409 transitions. [2020-02-10 19:56:20,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:56:20,333 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:56:20,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:20,340 INFO L225 Difference]: With dead ends: 2860 [2020-02-10 19:56:20,341 INFO L226 Difference]: Without dead ends: 2845 [2020-02-10 19:56:20,341 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:56:20,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2845 states. [2020-02-10 19:56:20,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2845 to 1567. [2020-02-10 19:56:20,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 19:56:20,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7025 transitions. [2020-02-10 19:56:20,408 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7025 transitions. Word has length 28 [2020-02-10 19:56:20,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:20,408 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7025 transitions. [2020-02-10 19:56:20,408 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:56:20,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7025 transitions. [2020-02-10 19:56:20,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:56:20,411 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:20,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] [2020-02-10 19:56:20,411 INFO L427 AbstractCegarLoop]: === Iteration 912 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:20,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:20,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1134818144, now seen corresponding path program 904 times [2020-02-10 19:56:20,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:20,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772693806] [2020-02-10 19:56:20,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:20,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:20,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 19:56:20,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772693806] [2020-02-10 19:56:20,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:20,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:56:20,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198805629] [2020-02-10 19:56:20,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:56:20,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:20,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:56:20,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:20,944 INFO L87 Difference]: Start difference. First operand 1567 states and 7025 transitions. Second operand 11 states. [2020-02-10 19:56:21,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:21,122 INFO L93 Difference]: Finished difference Result 2858 states and 11402 transitions. [2020-02-10 19:56:21,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:56:21,122 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:56:21,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:21,129 INFO L225 Difference]: With dead ends: 2858 [2020-02-10 19:56:21,129 INFO L226 Difference]: Without dead ends: 2842 [2020-02-10 19:56:21,130 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:56:21,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2842 states. [2020-02-10 19:56:21,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2842 to 1564. [2020-02-10 19:56:21,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1564 states. [2020-02-10 19:56:21,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 7017 transitions. [2020-02-10 19:56:21,196 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 7017 transitions. Word has length 28 [2020-02-10 19:56:21,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:21,196 INFO L479 AbstractCegarLoop]: Abstraction has 1564 states and 7017 transitions. [2020-02-10 19:56:21,196 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:56:21,196 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 7017 transitions. [2020-02-10 19:56:21,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:56:21,199 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:21,199 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:21,199 INFO L427 AbstractCegarLoop]: === Iteration 913 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:21,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:21,199 INFO L82 PathProgramCache]: Analyzing trace with hash 452598410, now seen corresponding path program 905 times [2020-02-10 19:56:21,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:21,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433573615] [2020-02-10 19:56:21,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:21,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:21,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:21,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433573615] [2020-02-10 19:56:21,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:21,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:56:21,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389636019] [2020-02-10 19:56:21,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:56:21,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:21,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:56:21,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:21,686 INFO L87 Difference]: Start difference. First operand 1564 states and 7017 transitions. Second operand 11 states. [2020-02-10 19:56:21,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:21,867 INFO L93 Difference]: Finished difference Result 2866 states and 11418 transitions. [2020-02-10 19:56:21,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:56:21,867 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:56:21,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:21,874 INFO L225 Difference]: With dead ends: 2866 [2020-02-10 19:56:21,874 INFO L226 Difference]: Without dead ends: 2848 [2020-02-10 19:56:21,874 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:56:21,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2848 states. [2020-02-10 19:56:21,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2848 to 1567. [2020-02-10 19:56:21,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 19:56:21,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7022 transitions. [2020-02-10 19:56:21,941 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7022 transitions. Word has length 28 [2020-02-10 19:56:21,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:21,941 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7022 transitions. [2020-02-10 19:56:21,941 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:56:21,941 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7022 transitions. [2020-02-10 19:56:21,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:56:21,943 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:21,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] [2020-02-10 19:56:21,944 INFO L427 AbstractCegarLoop]: === Iteration 914 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:21,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:21,944 INFO L82 PathProgramCache]: Analyzing trace with hash 628471878, now seen corresponding path program 906 times [2020-02-10 19:56:21,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:21,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141018394] [2020-02-10 19:56:21,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:21,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56: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 19:56:22,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141018394] [2020-02-10 19:56:22,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:22,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:56:22,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137565216] [2020-02-10 19:56:22,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:56:22,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:22,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:56:22,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:22,427 INFO L87 Difference]: Start difference. First operand 1567 states and 7022 transitions. Second operand 11 states. [2020-02-10 19:56:22,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:22,630 INFO L93 Difference]: Finished difference Result 2861 states and 11405 transitions. [2020-02-10 19:56:22,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:56:22,630 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:56:22,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:22,637 INFO L225 Difference]: With dead ends: 2861 [2020-02-10 19:56:22,638 INFO L226 Difference]: Without dead ends: 2842 [2020-02-10 19:56:22,638 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:56:22,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2842 states. [2020-02-10 19:56:22,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2842 to 1561. [2020-02-10 19:56:22,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1561 states. [2020-02-10 19:56:22,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 7009 transitions. [2020-02-10 19:56:22,704 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 7009 transitions. Word has length 28 [2020-02-10 19:56:22,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:22,704 INFO L479 AbstractCegarLoop]: Abstraction has 1561 states and 7009 transitions. [2020-02-10 19:56:22,704 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:56:22,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 7009 transitions. [2020-02-10 19:56:22,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:56:22,706 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:22,706 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:22,706 INFO L427 AbstractCegarLoop]: === Iteration 915 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:22,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:22,707 INFO L82 PathProgramCache]: Analyzing trace with hash -288888928, now seen corresponding path program 907 times [2020-02-10 19:56:22,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:22,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649420451] [2020-02-10 19:56:22,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:22,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:23,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 19:56:23,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649420451] [2020-02-10 19:56:23,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:23,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:56:23,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417286474] [2020-02-10 19:56:23,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:56:23,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:23,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:56:23,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:23,215 INFO L87 Difference]: Start difference. First operand 1561 states and 7009 transitions. Second operand 11 states. [2020-02-10 19:56:23,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:23,384 INFO L93 Difference]: Finished difference Result 2872 states and 11437 transitions. [2020-02-10 19:56:23,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:56:23,385 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:56:23,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:23,392 INFO L225 Difference]: With dead ends: 2872 [2020-02-10 19:56:23,392 INFO L226 Difference]: Without dead ends: 2856 [2020-02-10 19:56:23,392 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:56:23,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2856 states. [2020-02-10 19:56:23,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2856 to 1570. [2020-02-10 19:56:23,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 19:56:23,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7031 transitions. [2020-02-10 19:56:23,459 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7031 transitions. Word has length 28 [2020-02-10 19:56:23,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:23,459 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7031 transitions. [2020-02-10 19:56:23,459 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:56:23,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7031 transitions. [2020-02-10 19:56:23,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:56:23,461 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:23,461 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:23,461 INFO L427 AbstractCegarLoop]: === Iteration 916 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:23,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:23,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1200516068, now seen corresponding path program 908 times [2020-02-10 19:56:23,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:23,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623495662] [2020-02-10 19:56:23,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:23,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:23,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 19:56:23,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623495662] [2020-02-10 19:56:23,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:23,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:56:23,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099716260] [2020-02-10 19:56:23,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:56:23,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:23,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:56:23,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:23,979 INFO L87 Difference]: Start difference. First operand 1570 states and 7031 transitions. Second operand 11 states. [2020-02-10 19:56:24,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:24,146 INFO L93 Difference]: Finished difference Result 2874 states and 11435 transitions. [2020-02-10 19:56:24,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:56:24,146 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:56:24,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:24,153 INFO L225 Difference]: With dead ends: 2874 [2020-02-10 19:56:24,153 INFO L226 Difference]: Without dead ends: 2850 [2020-02-10 19:56:24,153 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:56:24,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2850 states. [2020-02-10 19:56:24,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2850 to 1564. [2020-02-10 19:56:24,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1564 states. [2020-02-10 19:56:24,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 7017 transitions. [2020-02-10 19:56:24,220 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 7017 transitions. Word has length 28 [2020-02-10 19:56:24,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:24,220 INFO L479 AbstractCegarLoop]: Abstraction has 1564 states and 7017 transitions. [2020-02-10 19:56:24,220 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:56:24,220 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 7017 transitions. [2020-02-10 19:56:24,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:56:24,222 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:24,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] [2020-02-10 19:56:24,222 INFO L427 AbstractCegarLoop]: === Iteration 917 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:24,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:24,223 INFO L82 PathProgramCache]: Analyzing trace with hash 868221284, now seen corresponding path program 909 times [2020-02-10 19:56:24,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:24,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969832738] [2020-02-10 19:56:24,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:24,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:24,730 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 31 [2020-02-10 19:56:24,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:24,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969832738] [2020-02-10 19:56:24,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:24,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:56:24,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663698409] [2020-02-10 19:56:24,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:56:24,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:24,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:56:24,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:24,738 INFO L87 Difference]: Start difference. First operand 1564 states and 7017 transitions. Second operand 11 states. [2020-02-10 19:56:24,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:24,910 INFO L93 Difference]: Finished difference Result 2864 states and 11415 transitions. [2020-02-10 19:56:24,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:56:24,911 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:56:24,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:24,918 INFO L225 Difference]: With dead ends: 2864 [2020-02-10 19:56:24,918 INFO L226 Difference]: Without dead ends: 2848 [2020-02-10 19:56:24,919 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:56:24,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2848 states. [2020-02-10 19:56:24,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2848 to 1567. [2020-02-10 19:56:24,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 19:56:24,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7022 transitions. [2020-02-10 19:56:24,985 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7022 transitions. Word has length 28 [2020-02-10 19:56:24,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:24,985 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7022 transitions. [2020-02-10 19:56:24,985 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:56:24,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7022 transitions. [2020-02-10 19:56:24,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:56:24,987 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:24,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] [2020-02-10 19:56:24,988 INFO L427 AbstractCegarLoop]: === Iteration 918 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:24,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:24,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1460414368, now seen corresponding path program 910 times [2020-02-10 19:56:24,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:24,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196554015] [2020-02-10 19:56:24,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:24,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:25,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:25,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196554015] [2020-02-10 19:56:25,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:25,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:56:25,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550515096] [2020-02-10 19:56:25,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:56:25,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:25,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:56:25,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:25,500 INFO L87 Difference]: Start difference. First operand 1567 states and 7022 transitions. Second operand 11 states. [2020-02-10 19:56:25,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:25,705 INFO L93 Difference]: Finished difference Result 2861 states and 11406 transitions. [2020-02-10 19:56:25,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:56:25,705 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:56:25,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:25,713 INFO L225 Difference]: With dead ends: 2861 [2020-02-10 19:56:25,713 INFO L226 Difference]: Without dead ends: 2845 [2020-02-10 19:56:25,713 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:56:25,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2845 states. [2020-02-10 19:56:25,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2845 to 1564. [2020-02-10 19:56:25,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1564 states. [2020-02-10 19:56:25,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 7014 transitions. [2020-02-10 19:56:25,779 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 7014 transitions. Word has length 28 [2020-02-10 19:56:25,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:25,780 INFO L479 AbstractCegarLoop]: Abstraction has 1564 states and 7014 transitions. [2020-02-10 19:56:25,780 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:56:25,780 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 7014 transitions. [2020-02-10 19:56:25,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:56:25,782 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:25,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] [2020-02-10 19:56:25,782 INFO L427 AbstractCegarLoop]: === Iteration 919 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:25,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:25,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1916334808, now seen corresponding path program 911 times [2020-02-10 19:56:25,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:25,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791745432] [2020-02-10 19:56:25,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:25,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:26,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:26,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791745432] [2020-02-10 19:56:26,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:26,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:56:26,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354801810] [2020-02-10 19:56:26,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:56:26,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:26,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:56:26,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:26,300 INFO L87 Difference]: Start difference. First operand 1564 states and 7014 transitions. Second operand 11 states. [2020-02-10 19:56:26,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:26,492 INFO L93 Difference]: Finished difference Result 2868 states and 11420 transitions. [2020-02-10 19:56:26,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:56:26,492 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:56:26,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:26,499 INFO L225 Difference]: With dead ends: 2868 [2020-02-10 19:56:26,500 INFO L226 Difference]: Without dead ends: 2850 [2020-02-10 19:56:26,500 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:56:26,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2850 states. [2020-02-10 19:56:26,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2850 to 1567. [2020-02-10 19:56:26,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 19:56:26,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7019 transitions. [2020-02-10 19:56:26,567 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7019 transitions. Word has length 28 [2020-02-10 19:56:26,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:26,567 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7019 transitions. [2020-02-10 19:56:26,567 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:56:26,567 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7019 transitions. [2020-02-10 19:56:26,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:56:26,569 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:26,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] [2020-02-10 19:56:26,570 INFO L427 AbstractCegarLoop]: === Iteration 920 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:26,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:26,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1740461340, now seen corresponding path program 912 times [2020-02-10 19:56:26,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:26,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420034796] [2020-02-10 19:56:26,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:26,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:27,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 19:56:27,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420034796] [2020-02-10 19:56:27,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:27,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:56:27,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525534868] [2020-02-10 19:56:27,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:56:27,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:27,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:56:27,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:27,116 INFO L87 Difference]: Start difference. First operand 1567 states and 7019 transitions. Second operand 11 states. [2020-02-10 19:56:27,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:27,320 INFO L93 Difference]: Finished difference Result 2863 states and 11407 transitions. [2020-02-10 19:56:27,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:56:27,320 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:56:27,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:27,328 INFO L225 Difference]: With dead ends: 2863 [2020-02-10 19:56:27,328 INFO L226 Difference]: Without dead ends: 2841 [2020-02-10 19:56:27,328 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:56:27,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2841 states. [2020-02-10 19:56:27,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2841 to 1558. [2020-02-10 19:56:27,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2020-02-10 19:56:27,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 7001 transitions. [2020-02-10 19:56:27,395 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 7001 transitions. Word has length 28 [2020-02-10 19:56:27,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:27,395 INFO L479 AbstractCegarLoop]: Abstraction has 1558 states and 7001 transitions. [2020-02-10 19:56:27,395 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:56:27,395 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 7001 transitions. [2020-02-10 19:56:27,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:56:27,397 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:27,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] [2020-02-10 19:56:27,398 INFO L427 AbstractCegarLoop]: === Iteration 921 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:27,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:27,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1750104872, now seen corresponding path program 913 times [2020-02-10 19:56:27,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:27,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684751949] [2020-02-10 19:56:27,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:27,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:27,906 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 29 [2020-02-10 19:56:27,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:27,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684751949] [2020-02-10 19:56:27,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:27,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:56:27,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762328791] [2020-02-10 19:56:27,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:56:27,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:27,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:56:27,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:27,913 INFO L87 Difference]: Start difference. First operand 1558 states and 7001 transitions. Second operand 11 states. [2020-02-10 19:56:28,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:28,084 INFO L93 Difference]: Finished difference Result 2908 states and 11528 transitions. [2020-02-10 19:56:28,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:56:28,085 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:56:28,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:28,092 INFO L225 Difference]: With dead ends: 2908 [2020-02-10 19:56:28,092 INFO L226 Difference]: Without dead ends: 2893 [2020-02-10 19:56:28,092 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:56:28,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2893 states. [2020-02-10 19:56:28,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2893 to 1576. [2020-02-10 19:56:28,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2020-02-10 19:56:28,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 7057 transitions. [2020-02-10 19:56:28,159 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 7057 transitions. Word has length 28 [2020-02-10 19:56:28,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:28,159 INFO L479 AbstractCegarLoop]: Abstraction has 1576 states and 7057 transitions. [2020-02-10 19:56:28,159 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:56:28,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 7057 transitions. [2020-02-10 19:56:28,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:56:28,161 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56: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] [2020-02-10 19:56:28,161 INFO L427 AbstractCegarLoop]: === Iteration 922 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:28,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:28,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1055457428, now seen corresponding path program 914 times [2020-02-10 19:56:28,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:28,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022944893] [2020-02-10 19:56:28,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:28,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:28,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:28,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022944893] [2020-02-10 19:56:28,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:28,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:56:28,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288109631] [2020-02-10 19:56:28,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:56:28,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:28,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:56:28,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:28,691 INFO L87 Difference]: Start difference. First operand 1576 states and 7057 transitions. Second operand 11 states. [2020-02-10 19:56:28,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:28,870 INFO L93 Difference]: Finished difference Result 2913 states and 11532 transitions. [2020-02-10 19:56:28,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:56:28,871 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:56:28,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:28,878 INFO L225 Difference]: With dead ends: 2913 [2020-02-10 19:56:28,878 INFO L226 Difference]: Without dead ends: 2887 [2020-02-10 19:56:28,878 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:56:28,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2887 states. [2020-02-10 19:56:28,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2887 to 1570. [2020-02-10 19:56:28,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 19:56:28,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7040 transitions. [2020-02-10 19:56:28,945 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7040 transitions. Word has length 28 [2020-02-10 19:56:28,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:28,945 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7040 transitions. [2020-02-10 19:56:28,945 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:56:28,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7040 transitions. [2020-02-10 19:56:28,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:56:28,947 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:28,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] [2020-02-10 19:56:28,948 INFO L427 AbstractCegarLoop]: === Iteration 923 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:28,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:28,948 INFO L82 PathProgramCache]: Analyzing trace with hash -933921466, now seen corresponding path program 915 times [2020-02-10 19:56:28,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:28,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006083493] [2020-02-10 19:56:28,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:28,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:29,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:29,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006083493] [2020-02-10 19:56:29,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:29,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:56:29,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949984447] [2020-02-10 19:56:29,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:56:29,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:29,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:56:29,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:29,469 INFO L87 Difference]: Start difference. First operand 1570 states and 7040 transitions. Second operand 11 states. [2020-02-10 19:56:29,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:29,656 INFO L93 Difference]: Finished difference Result 2905 states and 11517 transitions. [2020-02-10 19:56:29,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:56:29,656 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:56:29,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:29,663 INFO L225 Difference]: With dead ends: 2905 [2020-02-10 19:56:29,664 INFO L226 Difference]: Without dead ends: 2890 [2020-02-10 19:56:29,664 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:56:29,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2890 states. [2020-02-10 19:56:29,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2890 to 1575. [2020-02-10 19:56:29,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2020-02-10 19:56:29,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 7049 transitions. [2020-02-10 19:56:29,731 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 7049 transitions. Word has length 28 [2020-02-10 19:56:29,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:29,731 INFO L479 AbstractCegarLoop]: Abstraction has 1575 states and 7049 transitions. [2020-02-10 19:56:29,731 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:56:29,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 7049 transitions. [2020-02-10 19:56:29,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:56:29,733 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:29,733 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:29,734 INFO L427 AbstractCegarLoop]: === Iteration 924 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:29,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:29,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1300186028, now seen corresponding path program 916 times [2020-02-10 19:56:29,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:29,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786578549] [2020-02-10 19:56:29,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:29,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:30,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 19:56:30,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786578549] [2020-02-10 19:56:30,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:30,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:56:30,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54214335] [2020-02-10 19:56:30,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:56:30,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:30,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:56:30,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:30,252 INFO L87 Difference]: Start difference. First operand 1575 states and 7049 transitions. Second operand 11 states. [2020-02-10 19:56:30,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:30,431 INFO L93 Difference]: Finished difference Result 2908 states and 11518 transitions. [2020-02-10 19:56:30,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:56:30,432 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:56:30,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:30,439 INFO L225 Difference]: With dead ends: 2908 [2020-02-10 19:56:30,439 INFO L226 Difference]: Without dead ends: 2885 [2020-02-10 19:56:30,439 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:56:30,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2885 states. [2020-02-10 19:56:30,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2885 to 1570. [2020-02-10 19:56:30,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 19:56:30,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7035 transitions. [2020-02-10 19:56:30,506 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7035 transitions. Word has length 28 [2020-02-10 19:56:30,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:30,506 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7035 transitions. [2020-02-10 19:56:30,506 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:56:30,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7035 transitions. [2020-02-10 19:56:30,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:56:30,509 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:30,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] [2020-02-10 19:56:30,509 INFO L427 AbstractCegarLoop]: === Iteration 925 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:30,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:30,509 INFO L82 PathProgramCache]: Analyzing trace with hash -517601850, now seen corresponding path program 917 times [2020-02-10 19:56:30,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:30,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523708498] [2020-02-10 19:56:30,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:30,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:31,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:31,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523708498] [2020-02-10 19:56:31,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:31,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:56:31,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627764726] [2020-02-10 19:56:31,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:56:31,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:31,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:56:31,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:31,057 INFO L87 Difference]: Start difference. First operand 1570 states and 7035 transitions. Second operand 11 states. [2020-02-10 19:56:31,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:31,207 INFO L93 Difference]: Finished difference Result 2920 states and 11542 transitions. [2020-02-10 19:56:31,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:56:31,208 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:56:31,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:31,215 INFO L225 Difference]: With dead ends: 2920 [2020-02-10 19:56:31,215 INFO L226 Difference]: Without dead ends: 2900 [2020-02-10 19:56:31,215 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:56:31,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2900 states. [2020-02-10 19:56:31,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2900 to 1580. [2020-02-10 19:56:31,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1580 states. [2020-02-10 19:56:31,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 7052 transitions. [2020-02-10 19:56:31,283 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 7052 transitions. Word has length 28 [2020-02-10 19:56:31,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:31,283 INFO L479 AbstractCegarLoop]: Abstraction has 1580 states and 7052 transitions. [2020-02-10 19:56:31,283 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:56:31,283 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 7052 transitions. [2020-02-10 19:56:31,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:56:31,285 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:31,285 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:31,286 INFO L427 AbstractCegarLoop]: === Iteration 926 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:31,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:31,286 INFO L82 PathProgramCache]: Analyzing trace with hash 227100648, now seen corresponding path program 918 times [2020-02-10 19:56:31,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:31,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892638915] [2020-02-10 19:56:31,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:31,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:31,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 19:56:31,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892638915] [2020-02-10 19:56:31,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:31,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:56:31,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054608789] [2020-02-10 19:56:31,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:56:31,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:31,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:56:31,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:31,815 INFO L87 Difference]: Start difference. First operand 1580 states and 7052 transitions. Second operand 11 states. [2020-02-10 19:56:32,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:32,021 INFO L93 Difference]: Finished difference Result 2918 states and 11530 transitions. [2020-02-10 19:56:32,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:56:32,022 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:56:32,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:32,029 INFO L225 Difference]: With dead ends: 2918 [2020-02-10 19:56:32,029 INFO L226 Difference]: Without dead ends: 2883 [2020-02-10 19:56:32,030 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:56:32,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2883 states. [2020-02-10 19:56:32,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2883 to 1563. [2020-02-10 19:56:32,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2020-02-10 19:56:32,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 7017 transitions. [2020-02-10 19:56:32,097 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 7017 transitions. Word has length 28 [2020-02-10 19:56:32,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:32,097 INFO L479 AbstractCegarLoop]: Abstraction has 1563 states and 7017 transitions. [2020-02-10 19:56:32,097 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:56:32,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 7017 transitions. [2020-02-10 19:56:32,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:56:32,099 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:32,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] [2020-02-10 19:56:32,100 INFO L427 AbstractCegarLoop]: === Iteration 927 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:32,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:32,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1034184220, now seen corresponding path program 919 times [2020-02-10 19:56:32,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:32,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062676303] [2020-02-10 19:56:32,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:32,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:32,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:32,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062676303] [2020-02-10 19:56:32,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:32,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:56:32,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161627908] [2020-02-10 19:56:32,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:56:32,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:32,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:56:32,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:32,612 INFO L87 Difference]: Start difference. First operand 1563 states and 7017 transitions. Second operand 11 states. [2020-02-10 19:56:32,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:32,790 INFO L93 Difference]: Finished difference Result 2892 states and 11481 transitions. [2020-02-10 19:56:32,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:56:32,791 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:56:32,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:32,798 INFO L225 Difference]: With dead ends: 2892 [2020-02-10 19:56:32,798 INFO L226 Difference]: Without dead ends: 2877 [2020-02-10 19:56:32,798 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:56:32,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2877 states. [2020-02-10 19:56:32,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2877 to 1573. [2020-02-10 19:56:32,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2020-02-10 19:56:32,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 7042 transitions. [2020-02-10 19:56:32,867 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 7042 transitions. Word has length 28 [2020-02-10 19:56:32,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:32,867 INFO L479 AbstractCegarLoop]: Abstraction has 1573 states and 7042 transitions. [2020-02-10 19:56:32,867 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:56:32,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 7042 transitions. [2020-02-10 19:56:32,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:56:32,869 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:32,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] [2020-02-10 19:56:32,869 INFO L427 AbstractCegarLoop]: === Iteration 928 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:32,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:32,870 INFO L82 PathProgramCache]: Analyzing trace with hash 455220776, now seen corresponding path program 920 times [2020-02-10 19:56:32,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:32,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514013622] [2020-02-10 19:56:32,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:32,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:33,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:33,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514013622] [2020-02-10 19:56:33,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:33,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:56:33,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862150120] [2020-02-10 19:56:33,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:56:33,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:33,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:56:33,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:33,376 INFO L87 Difference]: Start difference. First operand 1573 states and 7042 transitions. Second operand 11 states. [2020-02-10 19:56:33,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:33,506 INFO L93 Difference]: Finished difference Result 2897 states and 11485 transitions. [2020-02-10 19:56:33,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:56:33,507 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:56:33,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:33,514 INFO L225 Difference]: With dead ends: 2897 [2020-02-10 19:56:33,514 INFO L226 Difference]: Without dead ends: 2871 [2020-02-10 19:56:33,514 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:56:33,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2871 states. [2020-02-10 19:56:33,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2871 to 1567. [2020-02-10 19:56:33,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 19:56:33,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7027 transitions. [2020-02-10 19:56:33,578 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7027 transitions. Word has length 28 [2020-02-10 19:56:33,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:33,578 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7027 transitions. [2020-02-10 19:56:33,578 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:56:33,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7027 transitions. [2020-02-10 19:56:33,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:56:33,580 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:33,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] [2020-02-10 19:56:33,581 INFO L427 AbstractCegarLoop]: === Iteration 929 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:33,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:33,581 INFO L82 PathProgramCache]: Analyzing trace with hash 133429096, now seen corresponding path program 921 times [2020-02-10 19:56:33,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:33,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827367643] [2020-02-10 19:56:33,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:33,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:34,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 19:56:34,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827367643] [2020-02-10 19:56:34,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:34,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:56:34,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263428315] [2020-02-10 19:56:34,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:56:34,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:34,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:56:34,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:34,046 INFO L87 Difference]: Start difference. First operand 1567 states and 7027 transitions. Second operand 11 states. [2020-02-10 19:56:34,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:34,211 INFO L93 Difference]: Finished difference Result 2882 states and 11456 transitions. [2020-02-10 19:56:34,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:56:34,211 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:56:34,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:34,218 INFO L225 Difference]: With dead ends: 2882 [2020-02-10 19:56:34,218 INFO L226 Difference]: Without dead ends: 2867 [2020-02-10 19:56:34,218 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:56:34,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2867 states. [2020-02-10 19:56:34,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2867 to 1570. [2020-02-10 19:56:34,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-02-10 19:56:34,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 7032 transitions. [2020-02-10 19:56:34,282 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 7032 transitions. Word has length 28 [2020-02-10 19:56:34,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:34,283 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 7032 transitions. [2020-02-10 19:56:34,283 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:56:34,283 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 7032 transitions. [2020-02-10 19:56:34,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:56:34,285 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:34,285 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:34,285 INFO L427 AbstractCegarLoop]: === Iteration 930 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:34,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:34,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1213701660, now seen corresponding path program 922 times [2020-02-10 19:56:34,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:34,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466304749] [2020-02-10 19:56:34,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:34,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:34,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 19:56:34,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466304749] [2020-02-10 19:56:34,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:34,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:56:34,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651317370] [2020-02-10 19:56:34,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:56:34,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:34,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:56:34,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:34,829 INFO L87 Difference]: Start difference. First operand 1570 states and 7032 transitions. Second operand 11 states. [2020-02-10 19:56:34,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:34,987 INFO L93 Difference]: Finished difference Result 2880 states and 11449 transitions. [2020-02-10 19:56:34,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:56:34,988 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:56:34,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:34,994 INFO L225 Difference]: With dead ends: 2880 [2020-02-10 19:56:34,994 INFO L226 Difference]: Without dead ends: 2864 [2020-02-10 19:56:34,994 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:56:35,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2864 states. [2020-02-10 19:56:35,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2864 to 1567. [2020-02-10 19:56:35,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1567 states. [2020-02-10 19:56:35,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 7024 transitions. [2020-02-10 19:56:35,058 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 7024 transitions. Word has length 28 [2020-02-10 19:56:35,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:35,058 INFO L479 AbstractCegarLoop]: Abstraction has 1567 states and 7024 transitions. [2020-02-10 19:56:35,058 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:56:35,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 7024 transitions. [2020-02-10 19:56:35,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:56:35,060 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:35,060 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 19:56:35,060 INFO L427 AbstractCegarLoop]: === Iteration 931 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:35,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:35,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1643840300, now seen corresponding path program 923 times [2020-02-10 19:56:35,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:35,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803809960] [2020-02-10 19:56:35,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:35,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:35,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 19:56:35,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803809960] [2020-02-10 19:56:35,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:35,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:56:35,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139099549] [2020-02-10 19:56:35,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:56:35,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:35,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:56:35,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:35,522 INFO L87 Difference]: Start difference. First operand 1567 states and 7024 transitions. Second operand 11 states. [2020-02-10 19:56:35,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:35,652 INFO L93 Difference]: Finished difference Result 2893 states and 11473 transitions. [2020-02-10 19:56:35,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:56:35,652 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:56:35,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:35,659 INFO L225 Difference]: With dead ends: 2893 [2020-02-10 19:56:35,659 INFO L226 Difference]: Without dead ends: 2873 [2020-02-10 19:56:35,659 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:56:35,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2873 states. [2020-02-10 19:56:35,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2873 to 1571. [2020-02-10 19:56:35,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 19:56:35,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7030 transitions. [2020-02-10 19:56:35,724 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7030 transitions. Word has length 28 [2020-02-10 19:56:35,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:35,724 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7030 transitions. [2020-02-10 19:56:35,724 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:56:35,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7030 transitions. [2020-02-10 19:56:35,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:56:35,726 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:35,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] [2020-02-10 19:56:35,726 INFO L427 AbstractCegarLoop]: === Iteration 932 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:35,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:35,726 INFO L82 PathProgramCache]: Analyzing trace with hash -119610072, now seen corresponding path program 924 times [2020-02-10 19:56:35,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:35,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481933449] [2020-02-10 19:56:35,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:35,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:36,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 19:56:36,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481933449] [2020-02-10 19:56:36,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:36,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:56:36,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379236297] [2020-02-10 19:56:36,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:56:36,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:36,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:56:36,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:36,188 INFO L87 Difference]: Start difference. First operand 1571 states and 7030 transitions. Second operand 11 states. [2020-02-10 19:56:36,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:36,349 INFO L93 Difference]: Finished difference Result 2886 states and 11456 transitions. [2020-02-10 19:56:36,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:56:36,350 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:56:36,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:36,357 INFO L225 Difference]: With dead ends: 2886 [2020-02-10 19:56:36,357 INFO L226 Difference]: Without dead ends: 2865 [2020-02-10 19:56:36,357 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:56:36,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2865 states. [2020-02-10 19:56:36,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2865 to 1563. [2020-02-10 19:56:36,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2020-02-10 19:56:36,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 7013 transitions. [2020-02-10 19:56:36,421 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 7013 transitions. Word has length 28 [2020-02-10 19:56:36,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:36,421 INFO L479 AbstractCegarLoop]: Abstraction has 1563 states and 7013 transitions. [2020-02-10 19:56:36,421 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:56:36,421 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 7013 transitions. [2020-02-10 19:56:36,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:56:36,423 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:36,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] [2020-02-10 19:56:36,424 INFO L427 AbstractCegarLoop]: === Iteration 933 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:36,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:36,424 INFO L82 PathProgramCache]: Analyzing trace with hash 902352962, now seen corresponding path program 925 times [2020-02-10 19:56:36,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:36,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597919975] [2020-02-10 19:56:36,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:36,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:36,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 19:56:36,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597919975] [2020-02-10 19:56:36,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:36,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:56:36,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308506087] [2020-02-10 19:56:36,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:56:36,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:36,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:56:36,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:36,892 INFO L87 Difference]: Start difference. First operand 1563 states and 7013 transitions. Second operand 11 states. [2020-02-10 19:56:37,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 19:56:37,077 INFO L93 Difference]: Finished difference Result 2884 states and 11462 transitions. [2020-02-10 19:56:37,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-02-10 19:56:37,077 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-02-10 19:56:37,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 19:56:37,083 INFO L225 Difference]: With dead ends: 2884 [2020-02-10 19:56:37,084 INFO L226 Difference]: Without dead ends: 2869 [2020-02-10 19:56:37,084 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2020-02-10 19:56:37,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2869 states. [2020-02-10 19:56:37,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2869 to 1571. [2020-02-10 19:56:37,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1571 states. [2020-02-10 19:56:37,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 7033 transitions. [2020-02-10 19:56:37,148 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 7033 transitions. Word has length 28 [2020-02-10 19:56:37,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 19:56:37,148 INFO L479 AbstractCegarLoop]: Abstraction has 1571 states and 7033 transitions. [2020-02-10 19:56:37,148 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-02-10 19:56:37,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 7033 transitions. [2020-02-10 19:56:37,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-02-10 19:56:37,150 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 19:56:37,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] [2020-02-10 19:56:37,150 INFO L427 AbstractCegarLoop]: === Iteration 934 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr8INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 19:56:37,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 19:56:37,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1158506840, now seen corresponding path program 926 times [2020-02-10 19:56:37,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 19:56:37,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755775648] [2020-02-10 19:56:37,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 19:56:37,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 19:56:37,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 19:56:37,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755775648] [2020-02-10 19:56:37,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 19:56:37,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-02-10 19:56:37,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294085797] [2020-02-10 19:56:37,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-02-10 19:56:37,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 19:56:37,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-02-10 19:56:37,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2020-02-10 19:56:37,627 INFO L87 Difference]: Start difference. First operand 1571 states and 7033 transitions. Second operand 11 states. Received shutdown request... [2020-02-10 19:56:37,750 WARN L209 SmtUtils]: Removed 2 from assertion stack [2020-02-10 19:56:37,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 19:56:37,751 WARN L544 AbstractCegarLoop]: Verification canceled [2020-02-10 19:56:37,754 WARN L227 ceAbstractionStarter]: Timeout [2020-02-10 19:56:37,754 INFO L202 PluginConnector]: Adding new model example_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.02 07:56:37 BasicIcfg [2020-02-10 19:56:37,754 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-02-10 19:56:37,756 INFO L168 Benchmark]: Toolchain (without parser) took 769052.14 ms. Allocated memory was 145.8 MB in the beginning and 1.8 GB in the end (delta: 1.6 GB). Free memory was 120.9 MB in the beginning and 384.0 MB in the end (delta: -263.0 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2020-02-10 19:56:37,756 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.48 ms. Allocated memory is still 145.8 MB. Free memory is still 121.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-02-10 19:56:37,756 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.41 ms. Allocated memory is still 145.8 MB. Free memory was 120.5 MB in the beginning and 118.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 19:56:37,756 INFO L168 Benchmark]: Boogie Preprocessor took 25.40 ms. Allocated memory is still 145.8 MB. Free memory was 118.8 MB in the beginning and 117.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 19:56:37,757 INFO L168 Benchmark]: RCFGBuilder took 344.09 ms. Allocated memory is still 145.8 MB. Free memory was 117.5 MB in the beginning and 103.7 MB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. [2020-02-10 19:56:37,757 INFO L168 Benchmark]: TraceAbstraction took 768632.66 ms. Allocated memory was 145.8 MB in the beginning and 1.8 GB in the end (delta: 1.6 GB). Free memory was 103.3 MB in the beginning and 384.0 MB in the end (delta: -280.7 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2020-02-10 19:56:37,758 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.48 ms. Allocated memory is still 145.8 MB. Free memory is still 121.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 37.41 ms. Allocated memory is still 145.8 MB. Free memory was 120.5 MB in the beginning and 118.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 25.40 ms. Allocated memory is still 145.8 MB. Free memory was 118.8 MB in the beginning and 117.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 344.09 ms. Allocated memory is still 145.8 MB. Free memory was 117.5 MB in the beginning and 103.7 MB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 768632.66 ms. Allocated memory was 145.8 MB in the beginning and 1.8 GB in the end (delta: 1.6 GB). Free memory was 103.3 MB in the beginning and 384.0 MB in the end (delta: -280.7 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.3s, 76 ProgramPointsBefore, 66 ProgramPointsAfterwards, 120 TransitionsBefore, 110 TransitionsAfterwards, 2736 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 9 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 720 VarBasedMoverChecksPositive, 0 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 756 CheckedPairsTotal, 10 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 31]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 31). Cancelled while BasicCegarLoop was constructing difference of abstraction (1571states) and FLOYD_HOARE automaton (currently 10 states, 11 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 35 for 39ms.. - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 49 locations, 1 error locations. Started 1 CEGAR loops. Result: TIMEOUT, OverallTime: 768.3s, OverallIterations: 934, TraceHistogramMax: 1, AutomataDifference: 190.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.0s, HoareTripleCheckerStatistics: 114183 SDtfs, 167158 SDslu, 303406 SDs, 0 SdLazy, 82583 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 81.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10210 GetRequests, 942 SyntacticMatches, 0 SemanticMatches, 9267 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6482 ImplicationChecksByTransitivity, 540.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20196occurred 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: 70.4s AutomataMinimizationTime, 933 MinimizatonAttempts, 1258870 StatesRemovedByMinimization, 925 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 490.7s InterpolantComputationTime, 26152 NumberOfCodeBlocks, 26152 NumberOfCodeBlocksAsserted, 934 NumberOfCheckSat, 25218 ConstructedInterpolants, 0 QuantifiedInterpolants, 22390398 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 934 InterpolantComputations, 934 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